Solving Vehicle Routing with Full Container Load and Time Windows
Publication: Research - peer-review › Conference article – Annual report year: 2012
Standard
Solving Vehicle Routing with Full Container Load and Time Windows. / Reinhardt, Line Blander; Spoorendonk, Simon; Pisinger, David.
In: Lecture Notes in Computer Science, Vol. 7555, 2012, p. 120-128.Publication: Research - peer-review › Conference article – Annual report year: 2012
Harvard
APA
CBE
MLA
Vancouver
Author
Bibtex
}
RIS
TY - CONF
T1 - Solving Vehicle Routing with Full Container Load and Time Windows
A1 - Reinhardt,Line Blander
A1 - Spoorendonk,Simon
A1 - Pisinger,David
AU - Reinhardt,Line Blander
AU - Spoorendonk,Simon
AU - Pisinger,David
PB - Springer
PY - 2012
Y1 - 2012
N2 - A service provided by the liner shipping companies is the transport of containers by truck between the terminal and customers. These transports consist of import orders and export orders. Even though these transports concern containers and, therefore, each order is a full load, an import and an export order can be combined in one trip where the container is emptied at an import customer and taken to an export customer to be filled. Finding a set of optimal vehicle routes allowing these combinations is NP-hard. However, exploring the fact that the number of possible routes is small in the problem presented, we in this report show a model which can within seconds solve the problem to optimality. The model is tested on real-life data sets and additional constraints to the problem are considered.
AB - A service provided by the liner shipping companies is the transport of containers by truck between the terminal and customers. These transports consist of import orders and export orders. Even though these transports concern containers and, therefore, each order is a full load, an import and an export order can be combined in one trip where the container is emptied at an import customer and taken to an export customer to be filled. Finding a set of optimal vehicle routes allowing these combinations is NP-hard. However, exploring the fact that the number of possible routes is small in the problem presented, we in this report show a model which can within seconds solve the problem to optimality. The model is tested on real-life data sets and additional constraints to the problem are considered.
U2 - 10.1007/978-3-642-33587-7_9
DO - 10.1007/978-3-642-33587-7_9
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
SN - 0302-9743
VL - 7555
SP - 120
EP - 128
ER -