This thesis investigates the three-dimensional container loading problem. We review all literatures published in this area, and explain our unique problem raised from an industry partner. As constructive heuristic remains uncontrollable to us, we design improvement algorithms both to and not to intervene with how constructive heuristic works, namely iterated local search and beam search. New benchmark data sets for multiple containers problem are generated to fill the shortage of challenging data sets. Computational results for homogeneous containers problem indicate that while both approaches work on our problem, beam search remains a favourable choice. We also extend our algorithms to solve heterogeneous containers problem.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:722919 |
| Date | January 2017 |
| Creators | Zhao, Xiaozhou |
| Contributors | Bennell, Julia |
| Publisher | University of Southampton |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | https://eprints.soton.ac.uk/413542/ |
Page generated in 0.0022 seconds