OMEGA - ordering messy GA: solving permutation problems with the fast messy genetic algorithm and random keys
Pages 181 - 188
Abstract
This paper presents an ordering messy genetic algorithm (OmeGA) that is able to solve difficult permutation problems efficiently. It is essentially a fast messy genetic algorithm (fmGA) using random keys to represent chromosomes. Experimental results that show the random key-based simple genetic algorithm (RKGA) being outperformed by its messy competitor in 32-length ordering deceptive problems are presented.
References
[1]
Bandyopadhyay, S., Kargupta, H., & Wang, G. (1998). Revisiting the GEMGA: Scalable evolutionary optimizaiton through linkage learning, (pp. 603-608). Piscataway, NJ: IEEE Service Center.
[2]
Bean, J. C. (1994). Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6(2), 154-160.
[3]
Blanton Jr., J. L., & Wainwright, R. L. (1993). Multiple vehicle routing with time and capacity constraints using genetic algorithms. In Proceedings of the Fifth International Conference on Genetic Algorithms (pp. 452-459).
[4]
Davis, L. (1985). Job shop scheduling with genetic algorithms. In Proceedings of an International Conference on Genetic Algorithms and Their Applications (pp. 136-140).
[5]
Davis, L. (1991). A genetic algorithms tutorial. In Handbook of Genetic Algorithms (pp. 1-101).
[6]
Goldberg, D. (1999). Using time efficiently: Genetic-evolutionary algorithms and the continuation problem. In Banzhaf, W., Daida, J., Eiben, A. E., Garzon, M. H., Honavar, V., Jakiela, M., & Smith, R. E. (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99, Volume I (pp. 212-219). Orlando, FL: Morgan Kaufmann Publishers, San Fransisco, CA.
[7]
Goldberg, D. E. (1989). Genetic algorithms and Walsh functions: Part I, a gentle introduction. Complex Systems, 3(2), 129-152. (Also TCGA Report 88006).
[8]
Goldberg, D. E. (1993). Making genetic algorithms fly: A lesson from the Wright Brothers. Advanced Technology for Developers, 2, 1-8.
[9]
Goldberg, D. E., Deb, K., Kargupta, H., & Harik, G. (1993). Rapid, accurate optimization of difficult problems using fast messy genetic algorithms. Proceedings of the Fifth International Conference on Genetic Algorithms, 56-64.
[10]
Goldberg, D. E., Deb, K., & Korb, B. (1990). Messy genetic algorithms revisited: Studies in mixed size and scale. Complex Systems, 4, 415-444.
[11]
Goldberg, D. E., Korb, B., & Deb, K. (1989). Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems, 3(5), 493-530. (Also TCGA Report 89003).
[12]
Goldberg, D. E., & Lingle, Jr., R. (1985). Alleles, loci, and the traveling salesman problem. In Proceedings of an International Conference on Genetic Algorithms and Their Applications (pp. 154-159).
[13]
Harik, G. R. (1997). Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms. Unpublished doctoral dissertation, University of Michigan, Ann Arbor. Also IlliGAL Report No. 97005.
[14]
Janikow, C. Z., & Michalewicz, Z. (1991). An experimental comparison of binary and floating point representations in genetic algorithms. In Proceedings of the Fourth International Conference on Genetic Algorithms (pp. 31-36).
[15]
Kargupta, H. (1995). SEARCH, polynomial complexity, and the fast messy genetic algorithm (Technical Report 95008). Urbana, IL: University of Illinois at Urbana-Champaign.
[16]
Kargupta, H., Deb, K., & Goldberg, D. E. (1992). Ordering genetic algorithms and deception. In Parallel Problem Solving from Nature - PPSN II (pp. 47-56).
[17]
Louis, S. J., & Rawlins, G. J. E. (1991). Designer genetic algorithms: Genetic algorithms in structure design. In Proceedings of the Fourth International Conference on Genetic Algorithms (pp. 53-60).
[18]
Norman, B., & Bean, J. (1997). A random keys genetic algorithm for job shop scheduling. Engineering Design and Automation, 3, 145-156.
[19]
Pelikan, M., Goldberg, D. E., & Cantú-Paz, E. (1999). BOA: The Bayesian optimization algorithm. In GECCO-99: Proceedings of 1999 Genetic and Evolutionary Computation Conference, Volume 1 (pp. 525-532).
[20]
Schwefel, H. P. (1995). Evolution and optimum seeking. Sixth-Generation Computer Technology Series. New York: John Wiley & Sons, Inc.
[21]
Thierens, D., & Goldberg, D. E. (1993). Mixing in genetic algorithms. In Proceedings of the Fifth International Conference on Genetic Algorithms (pp. 38-45).
[22]
Whitley, D., & Yoo, N.-W. (1994). Modeling simple genetic algorithms for permutation problems. In Whitley, L. D., & Vose, M. D. (Eds.), Foundations of Genetic Algorithms 3 (pp. 163-184). San Francisco, California: Morgan Kaufmann Publishers, Inc.
Recommendations
Solving permutation problems with the ordering messy genetic algorithm
Advances in evolutionary computingAlthough successful at first, messy genetic algorithms had minimum attention within the evolutionary computation community for the past few years. This chapter presents an ordering messy genetic algorithm (OmeGA) that is able to solve difficult ...
Combinatorial optimization for weighing matrices with the ordering messy genetic algorithm
SEA'11: Proceedings of the 10th international conference on Experimental algorithmsIn this paper, we demonstrate that the search for weighing matrices constructed from two circulants can be viewed as a permutation problem. To solve it a set of two competent genetic algorithms (CGAs) are used to locate common integers in two sorted ...
Using messy genetic algorithms for solving the winner determination problem
GECCO '10: Proceedings of the 12th annual conference companion on Genetic and evolutionary computationThe paper presents a study on the application of messy genetic algorithms for the winner determination problem in the combinatorial auction realm. Messy genetic algorithms operate explicitly on building blocks in order to obtain good solutions. Since ...
Comments
Information & Contributors
Information
Published In
July 2000
1081 pages
ISBN:1558607080
Publisher
Morgan Kaufmann Publishers Inc.
San Francisco, CA, United States
Publication History
Published: 10 July 2000
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 58Total Downloads
- Downloads (Last 12 months)22
- Downloads (Last 6 weeks)12
Reflects downloads up to 12 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in