A Genetic Algorithm for Solving the Container Loading Problem

The paper presents a genetic algorithm (GA) for the container loading problem. The main ideas of the approach are first to generate a set of disjunctive box towers and second to arrange the box towers on the floor of the container according to a given optimization criterion. The loading problem may include different practical constraints. The performance of the GA is demonstrated by a numerical test comparing the GA and several other procedures for the container loading problem.

MoreLess

Year of publication:	1997
Authors:	Gehring, Hermann ; Bortfeldt, Andreas
Published in:	Fernuniversität Hagen - Lehrstuhl für Wirtschaftsinformatik, Prof. Gehring - Publikation In: International Transactions of Operational Research, Vol.4, No. 5/6, 1997, S. 401-418
Publisher:	Fernuniversität <Hagen> / Fachbereich Wirtschaftswissenschaft
Subject:	Genetischer Algorithmus \| genetic algorithm \| Container \| Beladung

Check Google Scholar |

More access options

I need help

1. Introduction
2. Problem formulation and basic approach
3. Generation of tower sets
4. Covering the container floor with a genetic algorithm
4.1 A general incemental GA
4.2 Adaptation of the general GA to the given problem
4.3 Hybridization of the GA
5. Inclusion of practical constraints
6. Computational results
6.1 Test of alternative operators
6.2 First comparison with other methods
6.3 Second comparison with other methods
7. Concluding remarks

Persistent link: https://www.econbiz.de/10005856302