Genetic algorithms for the multiple container packing problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1498 LNCS, Issue , 1998, Pages 875-884

  Raidl, Günther R ^a   Kodydek, Gabriele ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; COMBINATORIAL OPTIMIZATION; ENCODING (SYMBOLS); GENETIC ALGORITHMS;

BIN PACKING PROBLEM; COMBINATORIAL OPTIMIZATION PROBLEMS; CONVERGENCE RATES; GENETIC ALGORITHM (GAS); KNAPSACK PROBLEMS; LOCAL-IMPROVEMENT OPERATORS; REPAIR ALGORITHMS; REPRESENTATION SCHEMES;

SIGNAL ENCODING;

EID: 84878569318     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0056929     Document Type: Conference Paper

References (19)

1. Back T.: Evolutionary Algorithms in Theory and Practice, Oxford University Press, New York (1996)
2. Bäck T., Fogel D. B., Michalewicz Z.: Handbook of Evolutionary Computation, Oxford University Press (1997)
3. Chu P. C: A Genetic Algorithm Approach for Combinatorial Optimization Problems, Ph.D. thesis at The Management School, Imperial College of Science, London (1997)
4. Chu P. C, Beasley J. E.: A Genetic Algorithm for the Generalized Assignment Problem, Computers & Operations Research 24(1) (1997) 17-23
5. 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)
6. 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)
7. Fogel D. B.: Evolutionary Computation - Toward a New Philosophy of Machine Intelligence, IEEE Press, Piscataway, NJ (1995)
8. Garey M. D., Johnson D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco (1979)
9. Gavish B., Pirkul H.: Efficient Algorithms for Solving Multiconstraint Zero-One Knapsack Problems to Optimality, Mathematical Programming 31 (1985) 78-105
10. Goldberg D. E.: Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley (1989)
11. 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
12. Khuri S., Back 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
13. Martello S., Toth P.: Knapsack Problems: Algorithms and Computer Implementations, J. Wiley & Sons (1990)
14. Michalewicz Z.: Genetic Algorithms + Data Structures = Evolution Programs, Springer, Berlin (1992)
15. 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
16. Raidi 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)
17. 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
18. 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
19. Wall M.: GAlib - A C++ Genetic Algorithms Library, Version 2.4, Massachusetts Institute of Technology, http://lancet.mit.edu/ga (1996)