Planejamento do transporte de empregados por uma frota de ônibus fretada por meio de um modelo matemático baseado no Open Vehicle Routing Problem (OVRP)

Authors

  • Rayane Florentina Scárdua UFES-Universidade Federal do Espírito Santo
  • Rodrigo Alvarenga Rosa UFES-Universidade Federal do Espírito Santo
  • Jodelson Aguilar Sabino UFES-Universidade Federal do Espírito Santo
  • Lirielly Ruela Vitorugo UFES-Universidade Federal do Espírito Santo

DOI:

https://doi.org/10.14295/transportes.v24i3.1089

Keywords:

Open Vehicle Routing Problem (OVRP), Chartered Passenger Transportation, Urban Logistics.

Abstract

Several transportation problems like traffic jam, crowded public transportation, parking shortage and pollution is caused by the actual scenario of urban mobility. The transport of passengers by charter is an alternative to improve the quality of urban mobility avoiding traffic jam and reducing pollution. Several companies offer as a benefit to their employees this type of transport to carry them to the company from their home and vice versa. Thus, it is proposed in this paper an adaptation of a mathematical model based on Open Vehicle Routing Problem (OVRP) for planning the transport of employees by a chartered bus fleet in order to reduce the total cost spent by the company. The model was applied to a company located in Vitória-ES and the results obtained by the model indicated a reduction in the cost of transportation when compared to the currently paid by the company.

Downloads

Download data is not yet available.

Author Biographies

Rayane Florentina Scárdua, UFES-Universidade Federal do Espírito Santo

Engenheira de Produção, trabalhando em empresa privada

Rodrigo Alvarenga Rosa, UFES-Universidade Federal do Espírito Santo

Pós-Doutor no Programa de Engenharia de Transportes (PET) na COPPE/UFRJ. Bolsista de Produtividade da Fundação de Amparo à Pesquisa do Espírito Santo (FAPES) recebendo a bolsa Pesquisador Capixaba (2013-2016). Doutor em Engenharia Elétrica pela Universidade Federal do Espírito Santo (UFES), Planejamento Portuário utilizando Inteligência Artificial Distribuída (2006). Mestre em Informática pela UFES, Roteirização de Veículos (1996). Graduado em Engenharia Civil pela UFES (1989). Professor adjunto no Depart. Eng. Produção da UFES; Professor permanente do Mestrado de Engenharia Civil (UFES) - Área de Transportes.

Jodelson Aguilar Sabino, UFES-Universidade Federal do Espírito Santo

Possui graduação em Bacharelado em Matemática pela Universidade Federal do Espírito Santo(1987), mestrado em Informática pela Universidade Federal do Espírito Santo(2004) e doutorado em Engenharia de Produção pela Pontifícia Universidade Católica do Rio de Janeiro(2008). Atualmente é GERENTE DE PROJETOS DE TI da Companhia Vale do Rio Doce. Tem experiência na área de Ciência da Computação, com ênfase em Sistemas de Computação. Atuando principalmente nos seguintes temas:ANT COLONY SYSTEMS, PLANEJAMENTO OPERACIONAL DE FERROVIAS.

Lirielly Ruela Vitorugo, UFES-Universidade Federal do Espírito Santo

Formanda em Engenheira de Produção e pesquisadora de Iniciação Cientifica no LAMMEP

References

Bektaş, T.; Elmastaş, Seda. Solving school bus routing problems through integer programming. Journal of the Operational Research Society, v. 58, n. 12, p. 1599-1604, 2007. DOI: 10.1057/palgrave.jors.2602305

Bodin, L.; Golden, B.; Assad, A. routing and scheduling of vehicles and crews–the state of the art. 1981.

Brandão, José. A tabu search algorithm for the open vehicle routing problem. European Journal of Operational Research, v. 157, n. 3, p. 552-564, 2004. DOI: 10.1016/S0377-2217(03)00238-8

De Jaegere, Nathalie; Defraeye, Mieke; Van Nieuwenhuyse, Inneke. The vehicle routing problem: state of the art classification and review. 2014.

Fu, Z.; Eglese, R.; Li, L. Y. O. A new tabu search heuristic for the open vehicle routing problem. Journal of the Operational Research Society, v. 57, n. 8, p. 1018-1018, 2006. DOI: 10.1057/palgrave.jors.2602181

HUANG, Fuhua; LIU, Changshi. An improved tabu search for open vehicle routing problem. In: Management and Service Science (MASS), 2010 International Conference on. IEEE, 2010. p. 1-4. DOI: 10.1109/ICMSS.2010.5576368

Letchford, Adam N.; Lysgaard, Jens; Eglese, Richard W. A branch-and-cut algorithm for the capacitated open vehicle routing problem. Journal of the Operational Research Society, v. 58, n. 12, p. 1642-1651, 2007. DOI: 10.1057/palgrave.jors.2602345

LI, Feiyue; GOLDEN, Bruce; WASIL, Edward. The open vehicle routing problem: Algorithms, large-scale test problems, and computational results. Computers & operations research, v. 34, n. 10, p. 2918-2930, 2007. DOI: 10.1016/j.cor.2005.11.018

Li, Xiangyong; Tian, Peng. An ant colony system for the open vehicle routing problem. In: International Workshop on Ant Colony Optimization and Swarm Intelligence. Springer Berlin Heidelberg, 2006. p. 356-363. DOI: 10.1007/11839088_33

Miller, Clair E.; Tucker, Albert W.; Zemlin, Richard A. Integer programming formulation of traveling salesman problems. Journal of the ACM (JACM), v. 7, n. 4, p. 326-329, 1960. DOI: 10.1145/321043.321046

Mirhassani, S. A.; Abolghasemi, N. A particle swarm optimization algorithm for open vehicle routing problem. Expert Systems with Applications, v. 38, n. 9, p. 11547-11551, 2011. DOI: 10.1016/j.eswa.2011.03.032

Nadal, C. A. Introdução à Trigonometria Esférica – Aplicações na Astronomia e na Cartografia. Curitiba. 1991.

Novaes, Antonio. Logistica e Gerenciamento da Cadeia de Distribuição-4ª Edição. Elsevier Brasil, 2004.

Pan, Lijun; Fu, Z. A Clone Selection Algorithm for the Open Vehicle Routing Problem. In: 2009 Third International Conference on Genetic and Evolutionary Computing. 2009. DOI: 10.1109/WGEC.2009.174

Perugia, Alessandro et al. Designing a home-to-work bus service in a metropolitan area. Transportation Research Part B: Methodological, v. 45, n. 10, p. 1710-1726, 2011. DOI: 10.1016/j.trb.2011.05.025

Pinto, V. P. A inserção do transporte por fretamento na matriz da mobilidade urbana. Série Cadernos Técnicos, Campinas, v. 9, p. 12-25, 2012.

PMV - Sistema Ponto Vitória. Disponível em: . Acesso em: 04 Out. 2014.

Raghavendra, Anirudh et al. A practical heuristic for a large scale vehicle routing problem. European journal of operational research, v. 57, n. 1, p. 32-38, 1992. DOI: 10.1016/0377-2217(92)90303-Q

Rosa, R.A. Roteirização do transporte diário de empregados por uma frota de ônibus fretada. 1996. 119 p. Dissertação (Mestrado em Informática) - Programa de Pós-Graduação em Informática, Universidade Federal do Espírito Santo, Vitória, 1996.

Salari, Majid; TOTH, Paolo; TRAMONTANI, Andrea. An ILP improvement procedure for the open vehicle routing problem. Computers & Operations Research, v. 37, n. 12, p. 2106-2120, 2010. DOI: 10.1016/j.cor.2010.02.010

Salles, R. S. Estudo de roteirização de veículos com apoio de um sistema de informações geográficas: uma contribuição para o transporte urbano de empregados por uma frota de ônibus fretada. 2013. 159 p. Dissertação (Mestrado em Engenharia Civil) - Programa de Pós-Graduação em Engenharia Civil, Universidade Federal do Espírito Santo, Vitória, 2013.

Sariklis, Dimitrios; Powell, Susan. A heuristic method for the open vehicle routing problem. Journal of the Operational Research Society, v. 51, n. 5, p. 564-573, 2000. DOI: 10.1057/palgrave.jors.2600924

Sedighpour, Mohammad et al. Solving the open vehicle routing problem by a hybrid ant colony optimization. Kuwait Journal of Science, v. 41, n. 3, 2014.

Singh, Er Gurpreet; Dhir, Vijay. Open Vehicle Routing Problem by Ant Colony Optimization. International Journal of Advanced Computer Science & Applications, v. 1, n. 5, p. 63-68. DOI: 10.1.1.682.3142

Tarantilis, C. D.; Kiranoudis, C. T. Distribution of fresh meat. Journal of Food Engineering, v. 51, n. 1, p. 85-91, 2002. DOI: 10.1016/S0260-8774(01)00040-1

Tarantilis, C. D. et al. Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm. Journal of the Operational Research Society, v. 56, n. 5, p. 588-596, 2005. DOI: 10.1057/palgrave.jors.2601848

Vasconcellos, E. A. Os serviços de transporte de passageiros por fretamento. Série Cadernos Técnicos, Campinas, v. 9, p. 26-45, 2012.

Wu, Jianjun; Tan, Yubo. A particle swarm optimization algorithm for grain logistics vehicle routing problem. In: 2009 ISECS International Colloquium on Computing, Communication, Control, and Management. IEEE, 2009. p. 364-367. DOI: 10.1109/CCCM.2009.5267915

Yao, Baozhen et al. Improved ant colony optimization for seafood product delivery routing problem. PROMET-Traffic&Transportation, v. 26, n. 1, p. 1-10, 2014. DOI: http://hrcak.srce.hr/124151

Yu, Shiwei; Ding, Chang; Zhu, Kejun. A hybrid GA–TS algorithm for open vehicle routing optimization of coal mines material. Expert Systems with Applications, v. 38, n. 8, p. 10568-10573, 2011. DOI:10.1016/j.eswa.2011.02.108

Zachariadis, Emmanouil E.; Kiranoudis, Chris T. An open vehicle routing problem metaheuristic for examining wide solution neighborhoods. Computers & Operations Research, v. 37, n. 4, p. 712-723, 2010. DOI: 10.1016/j.cor.2009.06.021

Downloads

Published

2016-12-01

How to Cite

Scárdua, R. F., Rosa, R. A., Sabino, J. A., & Vitorugo, L. R. (2016). Planejamento do transporte de empregados por uma frota de ônibus fretada por meio de um modelo matemático baseado no Open Vehicle Routing Problem (OVRP). TRANSPORTES, 24(3), 20–28. https://doi.org/10.14295/transportes.v24i3.1089

Issue

Vol. 24 No. 3 (2016): Prêmio ANPET de Produção Científica 2015

Section

Artigos Vencedores do Prêmio ANPET Produção Científica

License

Authors who submit papers for publication by TRANSPORTES agree to the following terms:

  1. Authors retain copyright and grant TRANSPORTES the right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

  2. Authors may enter into separate, additional contractual arrangements for the non-exclusive distribution of this journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in TRANSPORTES.

  3. Authors are allowed and encouraged to post their work online (e.g., in institutional repositories or on their website) after publication of the article. Authors are encouraged to use links to TRANSPORTES (e.g., DOIs or direct links) when posting the article online, as TRANSPORTES is freely available to all readers.

  4. Authors have secured all necessary clearances and written permissions to published the work and grant copyright under the terms of this agreement. Furthermore, the authors assume full responsibility for any copyright infringements related to the article, exonerating ANPET and TRANSPORTES of any responsibility regarding copyright infringement.

  5. Authors assume full responsibility for the contents of the article submitted for review, including all necessary clearances for divulgation of data and results, exonerating ANPET and TRANSPORTES of any responsibility regarding to this aspect.