.png){kind=icon}
.png){kind=icon}
Return
The multi-depot split delivery vehicle routing problem: An integer programming-based heuristic, new test problems, and computational results
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2011.05.012.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The multi-depot split delivery vehicle routing problem combines the split delivery vehicle routing problem and the multiple depot vehicle routing problem. We define this new problem and develop an integer programming-based heuristic for it. We apply our heuristic to 30 instances to determine the reduction in distance traveled that can be achieved by allowing split deliveries among vehicles based at the same depot and vehicles based at different depots. We generate new test instances with high-quality, visually estimated solutions and report results on these instances. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Multi-depot
Split delivery
Vehicle routing problem
Integer program
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W