A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks
JBC Chagas, UEF Silveira, AG Santos… - International …, 2020 - Wiley Online Library
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 …
which a fleet of vehicles must collect items in a pickup region and then travel to a delivery …
A double traveling salesman problem with three-dimensional loading constraints for bulky item delivery
M Ruan, C Shen, J Tang, C Qi, S Qiu - IEEE Access, 2021 - ieeexplore.ieee.org
This article considers bulky item delivery problems in which multiple items are retrieved and
loaded onto a vehicle from different warehouses and then delivered. This problem is …
loaded onto a vehicle from different warehouses and then delivered. This problem is …
A late acceptance hill-climbing heuristic algorithm for the double vehicle routing problem with multiple stacks and heterogeneous demand
We propose a heuristic algorithm based on the Late Acceptance Hill-Climbing metaheuristic
for solving the Double Vehicle Routing Problem with Multiple Stacks and Heterogeneous …
for solving the Double Vehicle Routing Problem with Multiple Stacks and Heterogeneous …
[引用][C] Mathematical models and heuristic algorithms for routing problems with multiple interacting components.
JBC Chagas - 2021