The Heterogeneous Vehicle Routing Problem with Multiple Deliverymen and Simultaneous Pickup and Delivery

Vol 51, 2019 - 107632
Trabalho completo (oral)
Favoritar este trabalho
Como citar esse trabalho?
Resumo

In this article, the Heterogeneous Vehicle Routing Problem with Multiple Deliverymen and Simultaneous Pickup and Delivery (HVRPMDSPD) is discussed. This problem is inspired by real world reverse logistics applications where a bottling company, using a fleet of different vehicles, must deliver beverages to clients and also pick up empty cases of bottles to recycle. Moreover, it is usually not possible to stop at every client’s location, and many clients might be close to one another. This proximity allows the vehicles to park at certain areas from where the deliverymen can serve the clients nearby on foot. Employing more deliverymen on a given route cuts down service times, but also potentially raises operational costs. The HVRPMDSPD is modelled mathematically as a Mixed Integer Linear Programming Model (MILP) problem. A constructive heuristic was developed so as to provide an initial solution for the solver CPLEX, and the solutions obtained were investigated.

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 Instituto de Ciências Matemáticas e de Computação (ICMC) da USP - São Carlos
Eixo Temático
  • L&T – Logística e Transportes
Palavras-chave
Heterogeneous Vehicle Routing
Simultaneous Pickup and Delivery
Mathematical model