A parallel tabu search algorithm for solving the container loading problem

Parallel Computing

Volumn 29, Issue 5 SPEC., 2003, Pages 641-662

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

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

Container loading problem; Distributed parallel search; Tabu search

Indexed keywords

ALGORITHMS; COMPUTER WORKSTATIONS; LOCAL AREA NETWORKS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

CONTAINER LOADING PROBLEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0038555386     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(03)00047-4     Document Type: Article

References (20)

1. Bischoff E.E., Ratcliff B.S.W. Issues in the development of approaches to container loading. Omega. 23:1995;377-390.
2. Bischoff E.E., Janetz F., Ratcliff M.S.W. Loading pallets with non-identical items. European Journal of Operational Research. 84:1995;681-692.
3. A. Bortfeldt, Informierte Graphensuchverfahren und genetische Algorithmen zur Lösung von Containerbeladeproblemen, Dissertation, Freie Universität, Berlin, Verlag Dr. Köster, Berlin, 1995.
4. Bortfeldt A., Gehring H. Ein Tabu Search-Verfahren für Containerbeladeprobleme mit schwach heterogenem Kistenvorrat. OR Spektrum. 20:1998;237-250.
5. Bortfeldt A., Gehring H. A hybrid genetic algorithm for the container loading problem. European Journal of Operational Research. 131:2001;143-161.
6. Crainic T.G., Toulouse M., Gendreau M. Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements. OR Spektrum. 17:1995;113-123.
7. Dyckhoff H., Finke U. Cutting and Packing in Production and Distribution. 1992;Physica, Heidelberg.
8. Gehring H., Bortfeldt A. A genetic algorithm for solving the container loading problem. International Transactions in Operational Research. 4:1997;401-418.
9. Gehring H., Bortfeldt A. Ein verteilt-paralleles Tabu Search-Verfahren für Containerbeladeprobleme mit schwach heterogenem Kistenvorrat. Kall P., Lüthi H.-J. Operations Research Proceedings 1998. 1999;220-227 Springer, Berlin.
10. Gehring H., Bortfeldt A. A parallel genetic algorithm for solving the container loading problem. International Transactions in Operational Research. 9:2002;497-511.
11. Gehring H., Homberger J. A parallel two-phase metaheuristic for routing problems with time windows. Asia-Pacific Journal of Operational Research. 18:2001;35-47.
12. Glover F., Laguna M. Tabu search. Reeves C.R. Modern Heuristic Techniques for Combinatorial Problems. 1993;70-150 Blackwell Scientific Publications, Oxford.
13. T.H. Loh, A.Y.C. Nee, A packing algorithm for hexahedral boxes, in: Proceedings of the Conference of Industrial Automation, Singapore, 1992, pp. 115-126.
14. Morabito R., Arenales M. An AND/OR-graph approach to the container loading problem. International Transactions in Operational Research. 1:1994;59-73.
15. Ngoi B.K.A., Tay M.L., Chua E.S. Applying spatial representation techniques to the container packing problem. International Journal of Production Research. 32:1994;111-123.
16. Pisinger D. Heuristics for the container loading problem. European Journal of Operational Research. 141:2002;143-153.
17. Rochat Y., Taillard E. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics. 1:1995;147-167.
18. Scheithauer G. Algorithms for the container loading problem. Operations Research Proceedings, 1991. 1992;445-452 Springer, Berlin.
19. M. Sixt, Dreidimensionale Packprobleme. Lösungsverfahren basierend auf den Meta-Heuristiken Simulated Annealing und Tabu-Suche, Europäischer Verlag der Wissenschaften, Frankfurt am Main, 1996.
20. M. Toulouse, T.G. Crainic, M. Gendreau, Issues in designing parallel and distributed search algorithms for discrete optimization problems, Publication CRT-96-36, Centre de recherche sur les transports, Université de Montréal, Canada, 1996.