A parallel hybrid local search algorithm for the container loading problem

International Transactions in Operational Research

Volumn 11, Issue 5, 2004, Pages 511-533

  Mack, D ^a   Bortfeldt, A ^a   Gehring, H ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

Container loading problem; Cutting and packing; Distributed parallel search; Hybrid algorithm; Local search; Metaheuristic; Simulated annealing; Tabu search

Indexed keywords

EID: 34548110328     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2004.00474.x     Document Type: Article

References (23)

1. Aarts, E., Korst, J., 1997. Simulated Annealing and Boltzmann Machines. John Wiley, New York.
2. Azencott, R., 1992. Parallel simulated annealing: An overview of basic techniques. In Azencott, R. (ed.) Simulated Annealing: Parallelization Techniques. John Wiley, New York, pp.37-46.
3. Bischoff, E.E., Ratcliff, M.S.W., 1995. Issues in the development of approaches to container loading. Omega, 23, 377-390.
4. Bischoff, E.E., Janetz, F., Ratcliff, M.S.W., 1995. Loading pallets with non-identical items. European Journal of Operational Research, 84, 681-692.
5. Bortfeldt, A., 1995. Informierte Graphensuchverfahren und genetische Algorithmen zur Lösung von Containerbeladeproblemen (Dissertation). Verlag Köster, Berlin.
6. Bortfeldt, A., Gehring, H., 1998. Ein Tabu Search-Verfahren für Containerbeladeprobleme mit schwach heterogenem Kistenvorrat. OR Spektrum, 20, 237-250.
7. Bortfeldt, A., Gehring, H., 2001. A hybrid genetic algorithm for the container loading problem. European Journal of Operational Research, 131, 143-161.
8. Bortfeldt, A., Gehring, H., Mack, D., 2002. A parallel tabu search algorithm for solving the container loading problem. Parallel Computing, 29, 641-662.
9. Dowsland, K.A., 1993. Simulated annealing. In Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications, Oxford, pp. 20-69.
10. Dyckhoff, H., Finke, U., 1992. Cutting and Packing in Production and Distribution. Physica-Verlag, Heidelberg.
11. Eley, M., 2002. Solving container loading problems by block arrangements. European Journal of Operational Research, 141, 393-409.
12. Gehring, H., Bortfeldt, A., 1997. A genetic algorithm for solving the container loading problem. International Transactions in Operational Research, 4, 401-418.
13. Gehring, H., Bortfeldt, A., 2002. A parallel genetic algorithm for solving the container loading problem. International Transactions in Operational Research, 9, 497-511.
14. Graffigne, C., 1992. Parallel annealing by periodically interacting multiple searches: An experimental study. In Azencott, R. (ed.) Simulated Annealing: Parallelization Techniques. John Wiley, New York, pp.47-79.
15. Hifi, M., 2002. Approximate algorithms for the container loading problem. International Transactions in Operational Research, 9, 747-774.
16. Kirkpatrick, S., Gellat, C.D., Vecchi, M.P., 1983. Optimization by simulated annealing. Science, 220, 671-680.
17. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E., 1953. Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21, 1087-1092.
18. Morabito, R., Arenales, M., 1994. An AND/Or-graph approach to the container loading problem. International Transactions in Operational Research, 1, 59-73.
19. Pisinger, D., 2002. Heuristics for the container loading problem. European Journal of Operational Research, 141, 143-153.
20. Reeves, C.R. (ed.) 1993. Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications, Oxford.
21. Scheithauer, G., 1992. Algorithms for the container loading problem. In Gaul, W., Bachem, A., Habenicht, W., Runge, W., Stahl, W.W. (eds) Operations Research Proceedings 1991, DGOR Deutsche Gesellschaft für Operations Research. Springer, Berlin, pp.445-452.
22. Sixt, M., 1996. Dreidimensionale Packprobleme. Lösungsverfahren basierend auf den Metaheuristiken Simulated Annealing und Tabu-Suche (Dissertation). Peter Lang, Europäischer Verlag der Wissenschaften, Frankfurt am Main.
23. Toulouse, M., Crainic, T.G., Gendreau, M., 1996. Issues in designing parallel and distributed search algorithms for discrete optimization problems. Publications CRT-96-36, Centre de recherche sur les transports, Université de Montréal, Canada.