Abstract
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising similarities to the Knapsack Problem and the Bin Packing Problem. Two different representation schemes are suggested, namely direct encoding and order based encoding. While order based encoded solutions are always feasible, a repair algorithm is used in case of direct encoding to ensure feasibility. Additionally, local improvement operators have been applied to both GA variants. The proposed algorithms were empirically compared by using various sets of differently sized test data. Order based encoding performed better for problems with fewer items, whereas direct encoding exhibited advantages when dealing with larger problems. The local improvement operators lead in many cases not only to better final results but also to shorter running times because of higher convergence rates.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bäck T.: Evolutionary Algorithms in Theory and Practice, Oxford University Press, New York (1996)
Bäck T., Fogel D. B., Michalewicz Z.: Handbook of Evolutionary Computation, Oxford University Press (1997)
Chu P. C.: A Genetic Algorithm Approach for Combinatorial Optimization Problems, Ph.D. thesis at The Management School, Imperial College of Science, London (1997)
Chu P. C., Beasley J. E.: A Genetic Algorithm for the Generalized Assignment Problem, Computers & Operations Research 24(1) (1997) 17–23
Chu P. C., Beasley J. E.: A Genetic Algorithm for the Multidimensional Knapsack Problem, working paper at The Management School, Imperial College of Science, London (1997)
Falkenauer E.: A Hybrid Grouping Genetic Algorithm for Bin Packing, working paper at CRIF Industrial Management and Automation, CP 106-P4, 50 av. F. D. Roosevelt, Brussels, Belgium (1994)
Fogel D. B.: Evolutionary Computation — Toward a New Philosophy of Machine Intelligence, IEEE Press, Piscataway, NJ (1995)
Garey M. D., Johnson D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco (1979)
Gavish B., Pirkul H.: Efficient Algorithms for Solving Multiconstraint Zero-One Knapsack Problems to Optimality, Mathematical Programming 31 (1985) 78–105
Goldberg D. E.: Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley (1989)
Hinterding R.: Mapping, Order-independent Genes and the Knapsack Problem, in Proc. of the 1st IEEE Int. Conference on Evolutionary Computation 1994, Orlando, FL (1994) 13–17
Khuri S., Bäck T., Heitkötter J.: The Zero/One Multiple Knapsack Problem and Genetic Algorithms, in Proc. of the 1994 ACM Symposium on Applied Computing, ACM Press (1994) 188–193
Martello S., Toth P.: Knapsack Problems: Algorithms and Computer Implementations, J. Wiley & Sons (1990)
Michalewicz Z.: Genetic Algorithms + Data Structures = Evolution Programs, Springer, Berlin (1992)
Olsen A. L.: Penalty Functions and the Knapsack Problem, in Proc. of the 1st International Conference on Evolutionary Computation 1994, Orlando, FL (1994) 559–564
Raidl G. R.: An Improved Genetic Algorithm for the Multiconstrained 0–1 Knapsack Problem, in Proc. of the 1998 IEEE International Conference on Evolutionary Computation, Anchorage, Alaska (1998) (to appear)
Rudolph G., Sprave J.: Significance of Locality and Selection Pressure in the Grand Deluge Evolutionary Algorithm, in Proc. of the International Conference on Parallel Problem Solving from Nature IV (1996) 686–694
Sun Y., Wang Z.: The Genetic Algorithm for 0–1 Programming with Linear Constraints, in Proc. of the 1st ICEC'94, Orlando, FL (1994) 559–564
Wall M.: GAlib — A C++ Genetic Algorithms Library, Version 2.4, Massachusetts Institute of Technology, http://lancet.mit.edu/ga (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raidl, G.R., Kodydek, G. (1998). Genetic algorithms for the Multiple Container Packing Problem. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN V. PPSN 1998. Lecture Notes in Computer Science, vol 1498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056929
Download citation
DOI: https://doi.org/10.1007/BFb0056929
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65078-2
Online ISBN: 978-3-540-49672-4
eBook Packages: Springer Book Archive