A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks.

Resumo
This paper addresses the double vehicle routing problem with multiple stacks (DVRPMS) in which a fleet of vehicles must collect items in a pickup region and then travel to a delivery region where all items are delivered. The load compartment of all vehicles is divided into rows (horizontal stacks) of fixed profundity (horizontal heights), and on each row, the unloading process must respect the last‐in‐first‐out policy. The objective of the DVRPMS is to find optimal routes visiting all pickup and delivery points while ensuring the feasibility of the vehicle loading plans. We propose a new integer linear programming formulation, which was useful to find inconsistencies in the results of exact algorithms proposed in the literature, and a variable neighborhood search based algorithm that was able to find solutions with same or higher quality in shorter computational time for most instances when compared to the methods already present in the literature.
Descrição
Palavras-chave
Pickup and delivery, Loading constraints, Mathematical formulation
Citação
CHAGAS, J. B. C. das et al. A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks. International Transactions in Operational Research, p. 1–26, 2019. Disponível em: <https://onlinelibrary.wiley.com/doi/full/10.1111/itor.12623>. Acesso em: 19 mar. 2019.