urban delivery planning considering intermediate replenishment, vehicles with multiple compartments vehicles and site dependent

Authors

  • Henrique Fiorot Astoures Universidade Federal do Espírito Santo, Espírito Santo – Brasil
  • Rodrigo Alvarenga Rosa Universidade Federal do Espírito Santo, Espírito Santo – Brasil http://orcid.org/0000-0003-0841-514X

DOI:

https://doi.org/10.14295/transportes.v28i4.2414

Keywords:

Intermediate replenishment facilities vehicle routing problem. Multiple compartment vehicle routing problem. City logistics.

Abstract

Due to the increasing demand in recent years for freight transportation by businesses and residences and, considering the access restrictions of large trucks imposed by cities, a new strategy is required to make deliveries within those cities. Thus, this article proposes a goods delivery planning considering route intermediate replenishment, vehicles with multiple compartments, independent boxes allocation time window for customer service and their access restrictions. A new model called Site Dependent Multiple Compartment Vehicle Routing Problem with Intermediate Replenishment Facilities and Time Windows is proposed to minimize the total transportation cost. The problem of a company that is being implemented in the city of Vitória-ES was analyzed. CPLEX 12.8 was used to solve the model and the results showed that the most economical strategy is the availability of more intermediate warehouses.

Downloads

Download data is not yet available.

Author Biographies

Henrique Fiorot Astoures, Universidade Federal do Espírito Santo, Espírito Santo – Brasil

Mestre em Engenharia Civil pela UFES, Eng. Produção pela UFES

Rodrigo Alvarenga Rosa, Universidade Federal do Espírito Santo, Espírito Santo – Brasil

Bolsista CNPq Produtividade PQ-1D Transporte. Professor associado no Depto. Eng. Produção da UFES (disciplinas Portos, Estrada de Ferro e Logística). Pós-Doutor em Engenharia de Transportes (PET) na COPPE- Universidade Federal do Rio de Janeiro (UFRJ). Doutor em Engenharia Elétrica (Planejamento Portuário) pela Universidade Federal do Espírito Santo (UFES) (2006). Mestre em Informática (Roteirização de Veículos) pela UFES (1996). Graduado em Engenharia Civil pela UFES (1989). Professor permanente do PPGEC- UFES - Área de Transportes (Portos, Ferrovia, Pesquisa Operacional, Meta-heurística). Professor permanente do Programa de Pós-Graduação em Gestão Pública (UFES).

References

Agência Transporta Brasil. (2014). Mais de cem municípios do Brasil já criaram restrição ao trânsito de caminhões. Disponí-vel em: < http://www.transportabrasil.com.br/2014/11/mais-de-cem-municipios-do-brasil-ja-criaram-restricao-ao-transito-de-caminhoes/>. Acesso em: 20 junho 2019.

Astoures, H. F., de Alvarenga Rosa, R., e da Silva Rosa, A. L. (2016). Planning the Diesel Supply for Offshore Platforms by a Mathematical Model Based on the Vehicle Routing Problem with Replenishment. Transportation Research Procedia, v. 18, p. 11-18. DOI https://doi.org/10.1016/j.trpro.2016.12.002.

Braekers, K., Ramaekers, K., e Van Nieuwenhuyse, I. (2016). The vehicle routing problem: State of the art classification and review. Computers & Industrial Engineering, v. 99, p. 300-313. DOI https://doi.org/10.1016/j.cie.2015.12.007.

Brandão, R., e Pureza, V. (2015) Distribuição de laticínios com restrições de recarga via programação matemática. XXIX Anpet, p. 9-13.

Buhrkal, K., Larsen, A., e Ropke, S. (2012). The waste collection vehicle routing problem with time windows in a city logistics context. Procedia-Social and Behavioral Sciences, v. 39, p. 241-254. DOI https://doi.org/10.1016/j.sbspro.2012.03.105.

Crainic, T.G., Ricciardi, N. e Storchi, G. (2004). Advanced freight transportation systems for congested urban areas. Transpor-tation Research, Part C, v. 12, n. 2, p. 119–137. DOI https://doi.org/10.1016/j.trc.2004.07.002.

Crevier, B., Cordeau, J. F., e Laporte, G. (2007). The multi-depot vehicle routing problem with inter-depot routes. European Journal of Operational Research, v. 176, n. 2, p. 756-773. DOI https://doi.org/10.1016/j.ejor.2005.08.015.

E-Bit. Webshoppers, 35. 2019. Disponível em: <https://www.ebit.com.br/webshoppers>. Acesso em: 28 de novembro de 2019.

Google. (2019). Google My Maps. Disponível em: <https://www.google.com.br/maps/preview>. Acesso em: 10 junho 2019.

Hemmelmayr, V., Doerner, K. F., Hartl, R. F., e Rath, S. (2013). A heuristic solution method for node routing based solid waste collection problems. Journal of Heuristics, v. 19, n. 2, p. 129-156. DOI 10.1007/s10732-011-9188-9.

Henke, T., Speranza, M. G., e Wäscher, G. (2015). The multi-compartment vehicle routing problem with flexible compartment sizes. European Journal of Operational Research, v. 246, no. 3, p. 730-743. DOI https://doi.org/10.1016/j.ejor.2015.05.020.

Hübner, A., e Ostermeier, M. (2018). A multi-compartment vehicle routing problem with loading and unloading costs. Transportation Science, v. 53, n. 1, p. 282-300. DOI https://doi.org/10.1287/trsc.2017.0775.

IBGE. (2018). Panorama dos municípios do Brasil: Município de Vitória. Disponível em: < https://cidades.ibge.gov.br/brasil/es/vitoria/panorama>. Acesso em: 22 junho 2019.

Koch, H., Henke, T., e Wäscher, G. (2016). A genetic algorithm for the multi-compartment vehicle routing problem with flexi-ble compartment sizes. Otto-von-Guericke University Magdeburg, Faculty of Economics and Management. Working Paper Series, n. 4. DOI https://doi.org/10.24352/UB.OVGU-2018-552.

Lin, C., Choy, K. L., Ho, G. T., Chung, S. H., e Lam, H. Y. (2014). Survey of green vehicle routing problem: past and future trends. Expert Systems With Applications, v. 41, n. 4, p. 1118-1138. DOI https://doi.org/10.1016/j.eswa.2013.07.107.

Oliveira, L. K., Morganti, E., Dablanc, L., e Oliveira, R. L. M. (2017). Analysis of the potential demand of automated delivery stations for e-commerce deliveries in Belo Horizonte, Brazil. Research in Transportation Economics, v. 65, p. 34-43. DOI https://doi.org/10.1016/j.retrec.2017.09.003.

Reed, M., Yiannakou, A., e Evering, R. (2014). An ant colony algorithm for the multi-compartment vehicle routing prob-lem. Applied Soft Computing, v. 15, p. 169-176. DOI https://doi.org/10.1016/j.asoc.2013.10.017

Santana, R. A., Rosa, R. D. A., Astoures, H. F., e Silva, D. S. D. (2017). Planning the distribution of goods in the context of city logistics considering split deliveries with access and time restrictions. International Journal of Logistics Systems and Management, v. 28, n. 4, p. 507-527. DOI https://doi.org/10.1504/IJLSM.2017.087789.

Schiffer, M., Schneider, M., Walther, G., e Laporte, G. (2019). Vehicle routing and location routing with intermediate stops: A review. Transportation Science, v. 53, n. 2, p. 319-343. DOI https://doi.org/10.1287/trsc.2018.0836.

Schneider, M., Stenger, A., e Goeke, D. (2014). The electric vehicle-routing problem with time windows and recharging sta-tions. Transportation Science, v. 48, n. 4, p. 500-520. DOI https://doi.org/10.1287/trsc.2013.0490.

Schneider, M., Stenger, A., e Hof, J. (2015). An adaptive VNS algorithm for vehicle routing problems with intermediate stops. OR Spectrum, v. 37, n. 2, p. 353-387. DOI https://doi.org/10.1007/s00291-014-0376-5.

Silvestrin, P. V., e Ritt, M. (2017). An iterated tabu search for the multi-compartment vehicle routing problem. Computers & Operations Research, v. 81, p. 192-202. DOI https://doi.org/10.1016/j.cor.2016.12.023.

Tarantilis, C. D., Zachariadis, E. E., e Kiranoudis, C. T. (2008). A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities. INFORMS Journal on Computing, v. 20, n. 1, p. 154-168. DOI https://doi.org/10.1287/ijoc.1070.0230.

Yahyaoui, H., Kaabachi, I., Krichen, S., e Dekdouk, A. (2018). Two metaheuristic approaches for solving the multi-compartment vehicle routing problem. Operational Research, p. 1-24. DOI https://doi.org/10.1007/s12351-018-0403-4.

Downloads

Published

2020-11-16

How to Cite

Astoures, H. F., & Rosa, R. A. (2020). urban delivery planning considering intermediate replenishment, vehicles with multiple compartments vehicles and site dependent. TRANSPORTES, 28(4), 117–132. https://doi.org/10.14295/transportes.v28i4.2414

Issue

Vol. 28 No. 4 (2020): Prêmio ANPET Produção Científica 2019

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.