Publication: Research - peer-review › Conference article – Annual report year: 2012
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.
|Book series||Lecture Notes in Computer Science|
|Conference||3rd International Conference on Computational Logistics|
|Period||24/09/12 → 26/09/12|
|Citations||Web of Science® Times Cited: No match on DOI|
Loading map data...