A genetic algorithm with exon shuffling crossover for hard bin packing problems

Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference

Volumn , Issue , 2007, Pages 1365-1371

  Rohlfshagen, Philipp ^a   Bullinaria, John A ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Bin packing problem; Exon shuffling; Genetic algorithms

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; CONSTRAINT THEORY; HEURISTIC ALGORITHMS; PROBLEM SOLVING;

BENCHMARK PROBLEMS; BIN PACKING PROBLEM; EXON SHUFFLING;

GENETIC ALGORITHMS;

EID: 34548090783     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1276958.1277213     Document Type: Conference Paper

References (14)

1. A. C. F. Alvim, C. C. Ribeiro, F. Glover, and D. J. Aloise. A hybrid improvment heuristic for the one-dimensional bin packing problem. Journal of Heuristics, 10:205-229, 2004.
2. E. G. Coffman, M. R. Garey, and D. S. Johnson. An application of bin-packing to multimachine scheduling. Journal of Computing, 7:1-17, 1978.
3. J. M. Daida, S. P. Yalcin, P. M. Litvak, G. A. Eickhoff, and J. A. Polit. Of metaphors and darwinism: Deconstructing genetic programming's chimera. In P. J. Angeline, Z. Michalewicz, M. Schoenauer, X. Yao, and A. Zalzala, editors, Proceedings of the Congress on Evolutionary Computation, volume 1, pages 453-462, 1999.
4. E. Falkenauer. A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2:5-30, 1996.
5. K. Fleszar and K. S. Hindi. New heuristics for one-dimensional bin-packing. Computers & operations research, 29:821-839, 2002.
6. J. N. D. Gupta and J. C. Ho. A new heuristic algorithms of the one-dimensional bin-packing problem. Production planning & control, 10(6):598-603, 1999.
7. J. H. Holland. Adaptation in Natural and Artifical Systems. University of Michigan Press, Ann Arbor, MI, 1975.
8. C.-Y. Kao and F.-T. Lin. A stochastic approach for the one-dimensional bin-packing problems. In Systems, Man and Cybernetics, 1992, volume 2, pages 1545-1551, 1992.
9. J. A. Kolkman and W. P. C. Stemmer. Directed evolution of proteins by exon shuffling. Nature Biotechnology, 19:423-428, 2001.
10. H. Lima and T. Yakawa. A new design of genetic algorithm for bin packing. In Evolutionary Computation, 2003. CEC '03. The 2003 Congress on Evolutionary Computation, volume 2, pages 1044-1049, 2003.
11. M. Mitchell. An Introduction to Genetic Algorithms. MIT Press, 1996.
12. B. Modrek and C. J. Lee. Alternative splicing in the human, mouse and rat genomes is associated with an increased frequency of exon creation and/or loss. Nature Genetics, 34(2):177-180, 2003.
13. A. Scholl, R. Klein, and C. Juergens. Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research, 24(7):627-645, 1997.
14. M. Silvano and T. Paolo. Knapsack Problems, Algorithms and Computer Implementations, chapter Bin-packing problem, pages 221-245. John Wiley and Sons Ltd., England, 1990.