Large-Scale Permutation Optimization with the Ordering Messy Genetic Algorithm
暂无分享,去创建一个
[1] D. Goldberg,et al. BOA: the Bayesian optimization algorithm , 1999 .
[2] D. E. Goldberg,et al. Simple Genetic Algorithms and the Minimal, Deceptive Problem , 1987 .
[3] Lawrence Davis,et al. Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.
[4] Kalyanmoy Deb,et al. Ordering Genetic Algorithms and Deception , 1992, PPSN.
[5] David E. Goldberg,et al. OMEGA - Ordering Messy GA: Solving Permutation Problems with the Fast Genetic Algorithm and Random Keys , 2000, GECCO.
[6] David E. Goldberg,et al. AllelesLociand the Traveling Salesman Problem , 1985, ICGA.
[7] G. Harik. Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms , 1997 .
[8] Dirk Thierens,et al. Mixing in Genetic Algorithms , 1993, ICGA.
[9] James C. Bean,et al. Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..
[10] Kalyanmoy Deb,et al. Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..
[11] Roger L. Wainwright,et al. Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms , 1993, ICGA.
[12] Kalyanmoy Deb,et al. RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms , 1993, ICGA.
[13] Sushil J. Louis,et al. Designer Genetic Algorithms: Genetic Algorithms in Structure Design , 1991, ICGA.
[14] David E. Goldberg,et al. Alleles, loci and the traveling salesman problem , 1985 .