Skip to main content
SpringerLink
Log in
Book cover

Intelligent Information Processing and Web Mining pp 299–308Cite as

Effects of Versatile Crossover and Mutation Operators on Evolutionary Search in Partition and Permutation Problems

  • Conference paper

Part of the book series: Advances in Soft Computing ((AINSC,volume 31))

Abstract

The paper investigates the influence of versatile crossover and mutation operators on the efficiency of evolutionary search in solving two important classes of hard optimization problems. Chromosome representations of set partitions and permutations defined in the paper are not problem-oriented and are described together with their versatile variation operators. The proposed representations are tested in evolutionary programs on standard partitions and permutation problems i.e. graph coloring (GCP) and traveling salesman (TSP). The optimization results vary depending on the problem class. They are relatively positive with respect to GCP and negative for TSP.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Croitoriu C., Luchian H., Gheorghies O., Apetrei A. (2002) A new genetic graph coloring heuristic. Computational Symposium on Graph Coloring and Generalizations COLOR’02. Proc. Int. Conf. Constraint Programming CP’02

    Google Scholar 

  2. Dorne R., Hao J-K. (1998) A new genetic local search for graph coloring. Parallel Problem Solving from Nature 1998, LNCS 1498, 745–754

    Google Scholar 

  3. Filho G. R., Lorena L. A. N. (2000) Constructive genetic algorithm and column generation: an application to graph coloring, Proc. Asia Pacific Operarions Research Symposium APORS’2000

    Google Scholar 

  4. Galinier P., Hao J-K. (1999) Hybrid evolutionary algorithms for graph coloring. J. Combinatorial Optimization, 374–397

    Google Scholar 

  5. Garey R., Johnson D. S. (1979) Computers and intractability. A guide to the theory of NP-completeness. Freeman, San Francisco

    Google Scholar 

  6. Grefenstette J. J. et al. (1985) Genetic algorithm for the TSP. Proc. 1st Int. Conf. on Genetic Algorithms, 160–168

    Google Scholar 

  7. Johnson D. S., Trick M. A. (1996) Cliques, coloring and satisfiability: Second DIMACS Implementation Challenge. DIMACS Series in Discr. Math. and Theor. Comp. Sc. 26

    Google Scholar 

  8. Khuri S., Walters T. Sugono Y. (2000) Grouping genetic algorithm for coloring edges of graph. Proc. 2000 ACM Symposium on Applied Computing, 422–427

    Google Scholar 

  9. Kokosiński Z. (1999) A chromosome representation of permutations for genetic algorithms. Proc. International Conference on Artificial Intelligence ICAI’1999, Las Vegas, CSREA Press, 66–69

    Google Scholar 

  10. Kokosiński Z., Kolodziej M., Kwarciany K. (2004) Parallel genetic algorithm for graph coloring problem. Proc. International Conference on Computational Science ICCS’2004, LNCS 3036, 215–222

    Google Scholar 

  11. Kubale, M. (ed.) (2004) Graph colorings. American Mathematical Society

    Google Scholar 

  12. Lorena L. A. N., Filho G. R. (1997) Constructive genetic algorithm for graph coloring. Proc. Asia Pacific Operarions Research Symposium APORS’1997

    Google Scholar 

  13. Michalewicz Z.: Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag (1996)

    Google Scholar 

  14. Murata T., Ischibuchi H. (1996) Positive and negative combination effect of crossover and mutation operators in sequencing problems. Proc. Int. Conf. on Evolutionary Computation ICEC’96, IEEE Computer Society Press, 170–175

    Google Scholar 

  15. Oliver M., Smith D. J., Holland J. R. C. (1987) A study of permutation crossover operators on the travelling salesman problem, Proc. 2nd Int. Conf. on Genetic Algorithms and Their Application, 224–230

    Google Scholar 

  16. Syswerda G. (1991) Scheduling optimization using genetic algorithms. [in:] Davis L. (ed.) Handbook of Genetic Algorithms. Van Nostrand Reinhold, 332–349

    Google Scholar 

  17. Üçoluk G. (1997) A method for chromosome handling of r-permutations of n-element set in genetic algorithms. Proc. 4th Int. Conf. on Evolutionary Computing ICEC’97, IEEE Computer Society, 55–58

    Google Scholar 

  18. de Werra D. (1990) Heuristics for graph coloring. [in:] Tinhofer G. et all. (eds.) Computational graph theory. Springer-Verlag, 191–208

    Google Scholar 

  19. Whitley D., Starweather T., Fuquay D. A. (1989) Scheduling problems and travelling salesman: The genetic edge recombination operator. Proc. 3rd Int. Conf. on Genetic Algorithms, 133–140

    Google Scholar 

  20. http://mat.gsia.cmu.edu/COLOR/instances.html

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Electr. & Computer Eng., Dept. of Control Eng., Cracow University of Technology, ul. Warszawska 24, 31-155, Kraków, Poland

    Zbigniew Kokosiński

Authors
  1. Zbigniew Kokosiński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Sciences, Polish Academy of Sciences, ul. Ordona 21, 01-237, Warszawa, Poland

    Mieczysław A. Kłopotek , Sławomir T. Wierzchoń  & Krzysztof Trojanowski ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kokosiński, Z. (2005). Effects of Versatile Crossover and Mutation Operators on Evolutionary Search in Partition and Permutation Problems. In: Kłopotek, M.A., Wierzchoń, S.T., Trojanowski, K. (eds) Intelligent Information Processing and Web Mining. Advances in Soft Computing, vol 31. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32392-9_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-32392-9_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25056-2

  • Online ISBN: 978-3-540-32392-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation