.png){kind=icon}
.png){kind=icon}
Return
Integer linear programming models for a cement delivery problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2012.04.039.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider a cement delivery problem with an heterogeneous fleet of vehicles and several depots. The demands of the customers are typically larger than the capacity of the vehicles which means that most customers are visited several times. This is a split delivery vehicle routing problem with additional constraints. We first propose a two phase solution method that assigns deliveries to the vehicles, and then builds vehicle routes. Both subproblems are formulated as integer linear programming problems. We then show how to combine the two phases in a single integer linear program. Experiments on real life instances are performed to compare the performance of the two solution methods. (C) 2012 Elsevier B.V. All rights reserved.
Keywords:
Vehicle routing
Split deliveries
Integer linear programs
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W