Two-echelon routing in last-mile delivery: Formulations and exact methods

- 325680
Prêmio de Dissertação de Mestrado - Etapa 1
Favoritar este trabalho
Como citar esse trabalho?
Resumo

Last-mile delivery systems are getting more and more complex with the increase of urban deliveries. To overcome this challenge, several variants of the vehicle routing problem have been proposed. A popular approach is based on two-echelon systems, in which goods are first taken from depots to intermediary points and then shipped to the final customers by smaller vehicles or walking deliverymen. Two classical problems with these characteristics are the two-echelon location-routing problem (2E-LRP) and the vehicle routing problem with time windows and multiple deliverymen (VRPTWMD). This paper provides a summary of a master’s dissertation that addresses both problems. For the 2E-LRP, novel mixed-integer programming formulations were proposed, and they were theoretically and computationally compared. Improved best-known lower bounds and new optimal solutions of benchmark instances were found. For the VRPTWMD, variants were introduced to better reflect realistic settings. These variants were formulated and exact methods to solve them were proposed.

Compartilhe suas ideias ou dúvidas com os autores!

Sabia que o maior estímulo no desenvolvimento científico e cultural é a curiosidade? Deixe seus questionamentos ou sugestões para o autor!

Faça login para interagir

Tem uma dúvida ou sugestão? Compartilhe seu feedback com os autores!

Instituições
  • 1 Departamento de Engenharia de Produção / Universidade Federal de São Carlos
  • 2 Universidade Federal Rural de Pernambuco/Programa de Pós-Graduação em Ciência e Tecnologia de Alimentos/Departamento de Ciências Domésticas
Eixo Temático
  • 11. L&T – Logística e Transportes
Palavras-chave
Vehicle routing
Two-echelon location-routing problem
Multiple deliverymen