Abstract
Many evolutionary systems have been developed that solve various specific scheduling problems. In this work, one such permutation based system, which uses a linear GP type Genotype to Phenotype Mapping (GPM), known as the Random Key Genetic Algorithm is investigated. The role standard mutation plays in this representation is analysed formally and is shown to be extremely disruptive. To ensure small fixed sized changes in the phenotype a swap mutation operator is suggested for this representation. An empirical investigation reveals that swap mutation outperforms the standard mutation to solve a hard deceptive problem even without the use of crossover. Swap mutation is also used in conjunction with different crossover operators and significant boost has been observed in the performance especially in the case of headless chicken crossover that produced surprising results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing (1994)
Ryan, C., Collins, J.J., O’Neill, M.: Grammatical evolution: Evolving programs for an arbitrary language. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds.) EuroGP 1998. LNCS, vol. 1391, pp. 83–95. Springer, Heidelberg (1998)
Johnson, D.: The travelling salesman problem: A case study in local optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, London, UK, pp. 215–310. John Wiley and Sons, Chichester (1997)
Knjazew, D., Goldberg, D.E.: Large-scale permutation optimization with the ordering messy genetic algorithm. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 631–640. Springer, Heidelberg (2000)
Knjazew, D., Goldberg, D.E.: Omega - ordering messy ga: Solving permutation problems with the fast messy genetic algorithm and random keys. ILLiGAL Technical Report No. 2000004 (2000)
Goldberg, D.E., Korb, B.: K. Deb. Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems, 493–530 (1989)
Hart, E., Ross, P.: An immune system approach to scheduling in changing environments. In: Banzhaf, W., et al. (eds.) Genetic and Evolutionary Computation Conference - GECCO 1999, Orlando, Florida, USA, pp. 1559–1565. Morgan Kaufmann, San Francisco (1999)
Hart, E., Ross, P., Nelson, J.: Producing robust schedules via an artificial immune system. In: International Conference on Evolutionary Computing, ICEC 1998, Anchorage, Alaska, USA, pp. 464–469. IEEE Press, Los Alamitos (1998)
Kargupta, H., Deb, K., Goldberg, D.E.: Ordering genetic algorithms and deception. In: Parallel Problem Solving from Nature - PPSN II, pp. 47–56 (1992)
Angeline, P.J.: Subtree crossover: Building block engine or macromutation? In: Koza, J.R., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M., Iba, H., Riolo, R.L. (eds.) Genetic Programming 1997: Proceedings of the Second Annual Conference, San Francisco, CA, pp. 9–17. Morgan Kaufmann, San Francisco (1997)
Fang, H.L.: Genetic Algorithms in Timetabling and Scheduling. PhD thesis, Department of Artificial Intelligence, University of Edinburgh (1994)
Fang, H.L., Ross, P., Corne, D.: A promising genetic algorithm approach to jobshop scheduling, rescheduling, and open-shop scheduling problems. In: Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 375–382 (1993)
O’Neill, M., Ryan, C., Keijzer, M., Cattolico, M.: Crossover in grammatical evolution. Genetic Programming and Evolvable Machines 4(1), 67–93 (2003)
O’Neill, M., Ryan, C.: Grammatical Evolution - Evolving programs in an arbitrary language. Kluwer Academic Publishers, Dordrecht (2003)
Moscato, P.: On genetic crossover operators for relative order preservation (1989)
Paterson, N.: Genetic programming with context-sensitive grammars. PhD thesis, Saint Andrew’s University (September 2002)
Ciesielski, V., Scerri, P.: Real time genetic scheduling of aircraft landing times
Watson, J., Ross, C., Eisele, V., Bins, J., Guerra, C., Whitley, L., Howe, A.: The traveling salesrep problem, edge assembly crossover, and 2-opt (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ryan, E., Azad, R.M.A., Ryan, C. (2004). On the Performance of Genetic Operators and the Random Key Representation. In: Keijzer, M., O’Reilly, UM., Lucas, S., Costa, E., Soule, T. (eds) Genetic Programming. EuroGP 2004. Lecture Notes in Computer Science, vol 3003. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24650-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-24650-3_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21346-8
Online ISBN: 978-3-540-24650-3
eBook Packages: Springer Book Archive