Local search for a cargo assembly planning problem
G Belov, N Boland, MWP Savelsbergh, PJ Stuckey
Integration of AI and OR Techniques in Constraint Programming | Springer International Publishing | Published : 2014
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.