A Maximal-Space Algorithm for the Container Loading Problem

References

• Bischoff E. E. Three dimensional packing of items with limited load bearing strength. Eur. J. Oper. Res. (2006) 168:952–966Crossref, Google Scholar
• Bischoff E. E., Marriot M. D. A comparative evaluation of heuristics for container loading. Eur. J. Oper. Res. (1990) 44:267–276Crossref, Google Scholar
• Bischoff E. E., Ratcliff M. S. W. Issues in the development of approaches to container loading. Omega (1995) 23:377–390Crossref, Google Scholar
• Bischoff E. E., Janetz F., Ratcliff M. S. W. Loading pallets with nonidentical items. Eur. J. Oper. Res. (1995) 84:681–692Crossref, Google Scholar
• Bortfeldt A., Gehring H. A tabu search algorithm for weakly heterogeneous container loading problems. OR Spectrum (1998) 20:237–250Google Scholar
• Bortfeldt A., Gehring H. A hybrid genetic algorithm for the container loading problem. Eur. J. Oper. Res. (2001) 131:143–161Crossref, Google Scholar
• Bortfeldt A., Gehring H., Mack D. A parallel tabu search algorithm for solving the container loading problem. Parallel Comput. (2003) 29:641–662Crossref, Google Scholar
• Davies A. P., Bischoff E. E. Weight distribution considerations in container loading. Eur. J. Oper. Res. (1998) 114(3):509–527Crossref, Google Scholar
• Delorme X., Gandibleux X., Rodriguez J. GRASP for set packing problems. Eur. J. Oper. Res. (2004) 153(3):564–580Crossref, Google Scholar
• Eley M. Solving container loading problems by block arrangement. Eur. J. Oper. Res. (2002) 141:393–409Crossref, Google Scholar
• Feo T., Resende M. G. C. A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. (1989) 8:67–71Crossref, Google Scholar
• Gehring H., Bortfeldt A. A genetic algorithm for solving the container loading problem. Internat. Trans. Oper. Res. (1997) 4:401–418Crossref, Google Scholar
• Gehring H., Bortfeldt A. A parallel genetic algorithm for solving the container loading problem. Internat. Trans. Oper. Res. (2002) 9:497–511Crossref, Google Scholar
• George J. A., Robinson D. F. A heuristic for packing boxes into a container. Comput. Oper. Res. (1980) 7:147–156Crossref, Google Scholar
• Mack D., Bortfeldt A., Gehring H. A parallel hybrid local search algorithm for the container loading problem. Internat. Trans. Oper. Res. (2004) 11:511–533Crossref, Google Scholar
• Moura A., Oliveira J. F. A GRASP approach to the container-loading problem. IEEE Intelligent Systems (2005) 20:50–57Crossref, Google Scholar
• Pisinger D. Heuristics for the container loading problem. Eur. J. Oper. Res. (2002) 141:382–392Crossref, Google Scholar
• Prais M., Ribeiro C. C. Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J. Comput. (2000) 12(3):164–176Link, Google Scholar
• Ratcliff M. S. W., Bischoff E. E. Allowing for weight considerations in container loading. OR Spectrum (1998) 20:65–71Crossref, Google Scholar
• Resende M. G. C., Ribeiro C. C., Glover F., Kochenberger G. Greedy randomized adaptive search procedures. Handbook of Metaheuristics (2003) (Kluwer Academic Publishers, Dordrecht, The Netherlands) 219–249Crossref, Google Scholar
• Wäscher G., Haussner H., Schumann H. An improved typology of cutting and packing problems. Eur. J. Oper. Res. (2007) 183:1109–1130Crossref, Google Scholar