Skip to main content
SpringerLink
Log in

Ein Tabu Search-Verfahren für Containerbeladeprobleme mit schwach heterogenem Kistenvorrat

A tabu search algorithm for weakly heterogeneous container loading problems

  • Theoretische Arbeiten
  • Published:
Operations-Research-Spektrum Aims and scope Submit manuscript

Zusammenfassung

Gegenstand des Beitrags ist die Entwicklung eines Tabu Search-Verfahrens (TSV) für Containerbeladeprobleme mit schwach heterogenem Kistenvorrat. Das TSV basiert auf einem zweistufigen Verfahrensansatz. Ein integrierter Greedy-Algorithmus dient unmittelbar der Erzeugung von Stauplänen. Vermittelt über eine geeignete Repräsentation zulässiger Problemlösungen wird in einer zweiten Verfahrensstufe eine Tabu-Suche durchgeführt. Das TSV berücksichtigt einige praxisrelevante Restriktionen. Die Performance des TSV wird anhand von Benchmarkproblemen aus der Literatur demonstriert, wobei Containerbeladeverfahren verschiedener Autoren zu Vergleichszwecken herangezogen werden.

Abstract

The paper presents a tabu search algorithm (TSA) for weakly heterogeneous container loading problems. The approach includes two integrated components: The generation of different stowage plans by means of a greedy algorithm and a tabu search using an appropriate representation of these plans. The TSA considers some restrictions of practical relevance. The overall algorithm has been applied to numerous benchmark problems and its performance is demonstrated by a numerical comparison with several loading procedures suggested by other authors.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literatur

  1. Bischoff EE, Janetz F, Ratcliff MSW (1995) Loading pallets with non-identical items. European Journal of Operational Research 84:681–692

    Google Scholar 

  2. Bischoff EE, Ratcliff MSW (1995) Issues in the development of approaches to container loading. Omega 23:377–390

    Google Scholar 

  3. Bortfeldt A (1994) A genetic algorithm for the container loading problem. Proceedings of the Conference on Adaptive Computing and Information Processing, London, Vol. 2, pp 25–32

    Google Scholar 

  4. Bortfeldt A (1995) Informierte Graphensuchverfahren und genetische Algorithmen zur Lösung von Containerbeladeproblemen. Köster, Berlin

    Google Scholar 

  5. Dyckhoff H, Finke U (1992) Cutting and packing in production and distribution. Physica, Heidelberg

    Google Scholar 

  6. Gehring H, Menschner K, Meyer M (1990) A computer-based heuristic for packing pooled shipment containers. European Journal of Operational Research 44:277–288

    Google Scholar 

  7. Gehring H, Bortfeldt A (1997) A genetic algorithm for solving the container loading problem. International Transactions in Operational Research 4(5/6):401–418

    Google Scholar 

  8. Glover F (1986) Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 5:533–549

    Google Scholar 

  9. Glover F, Laguna M (1993) Tabu search. In: Reeves CR (ed) Modern heuristic techniques for combinatiorial problems. Blackwell, Oxford, pp 70–150

    Google Scholar 

  10. Lin J-L, Foote B, Pulat S, Chang C-H, Cheung J-Y (1993) Hybrid genetic algorithm for container packing in three dimensions. Proceedings of the 9th IEEE conference on Artificial Intelligence. IEEE Computer Society Press, Washington, DC, pp 353–358

    Google Scholar 

  11. Loh TH, Nee AYC (1992) A packing algorithm for hexahedral boxes. In: Proceedings of the Conference of Industrial Automation. Singapore, pp 115–126

  12. Morabito R, Arenales M (1994) An AND/OR-graph approach to the container loading problem. International Transactions in Operational Research 1(1):59–73

    Google Scholar 

  13. Ngoi BKA, Tay ML, Chua ES (1994) Applying spatial representation techniques to the container packing problem. International Journal of Production Research 32:111–123

    Google Scholar 

  14. Prosser P (1988) A hybrid genetic algorithm for container loading. Proceedings of the 8th European Conference on Artificial Intelligence. Pitman, London, pp 159–164

    Google Scholar 

  15. Reeves CR (ed) (1993) Modern heuristic techniques for combinatorial problems. Blackwell, Oxford

    Google Scholar 

  16. Sixt M (1996) Dreidimensionale Packprobleme. Lösungsverfahren basierend auf den Metaheuristiken Simulated Annealing und Tabu-Suche. Peter Lang, Europäischer Verlag der Wissenschaften, Frankfurt/Main

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Wirtschaftsinformatik, Fachbereich Wirtschaftswissenschaft, FernUniversität-Gesamthochschule-Hagen, Profilstraße 8, D-58084, Hagen, Deutschland

    Andreas Bortfeldt & Hermann Gehring

Authors
  1. Andreas Bortfeldt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hermann Gehring
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andreas Bortfeldt.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bortfeldt, A., Gehring, H. Ein Tabu Search-Verfahren für Containerbeladeprobleme mit schwach heterogenem Kistenvorrat. OR Spektrum 20, 237–250 (1998). https://doi.org/10.1007/BF01539742

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01539742

Schlüsselwörter

Key words

Search

Navigation