Abstract
We consider a real-world cargo assembly planning problem arising in a coal supply chain. The cargoes are built on the stockyard at a port terminal from coal delivered by trains. Then the cargoes are loaded onto vessels. Only a limited number of arriving vessels is known in advance. The goal is to minimize the average delay time of the vessels over a long planning period. We model the problem in the MiniZinc constraint programming language and design a large neighbourhood search scheme. We compare against (an extended version of) a greedy heuristic for the same problem. © 2014 Springer International Publishing.
Author supplied keywords
Cite
CITATION STYLE
Belov, G., Boland, N., Savelsbergh, M. W. P., & Stuckey, P. J. (2014). Local search for a cargo assembly planning problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8451 LNCS, pp. 159–175). Springer Verlag. https://doi.org/10.1007/978-3-319-07046-9_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
