Skip to main content
SpringerLink
Log in

Permutation Problems, Genetic Algorithms, and Dynamic Representations

  • Chapter
  • First Online:
Nature-Inspired Computing and Optimization

Part of the book series: Modeling and Optimization in Science and Technologies ((MOST,volume 10))

Abstract

Permutation problems are a very common classification of optimization problems. Because of their popularity countless algorithms have been developed in an attempt to find high quality solutions. It is also common to see many different types of search spaces reduced to permutation problems as there are many heuristics and metaheuristics for them due to their popularity. This study incorporates the travelling salesman problem, bin packing problem, and graph colouring problem. These problems are studied with multiple variations and combinations of heuristics and metaheuristics with two distinct types of representations. The majority of the algorithms are built around the Recentering-Restarting Genetic Algorithm. The algorithm variations were effective on all problems examined although the variations between the different algorithms in this particular study were for the most part not statistically different. This observation led to the conclusion that algorithm success is dependent on problem instance; in order to fully explore the search space, one needs to study multiple algorithms for a given problem.

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

Access this chapter

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 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 179.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 179.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

References

  1. Ashlock D, Lee C (2008) Characterization of extremal epidemic networks with diffusion characters. In: IEEE symposium on Computational Intelligence in Bioinformatics and Computational Biology, CIBCB’08. IEEE, pp 264–271

    Google Scholar 

  2. Ashlock D, McEachern A (2009) Ring optimization of side effect machines. Intell Eng Syst Artif Neural Netw 19:165–172

    Google Scholar 

  3. Ashlock D, Shiller, E (2011) Fitting contact networks to epidemic behavior with an evolutionary algorith. In: 2011 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB). IEEE, pp 1–8

    Google Scholar 

  4. Ashlock D, Warner E (2008) Classifying synthetic and biological dna sequences with side effect machines. In: IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, CIBCB’08. IEEE, pp 22–29

    Google Scholar 

  5. Barlow T (1972) An historical note on the parity of permutations. Am Math Month 766–769

    Google Scholar 

  6. Belov G, Scheithauer G (2006) A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. Eur J Oper Res 171(1):85–106

    Article  MathSciNet  MATH  Google Scholar 

  7. Brooks RL (1941) On colouring the nodes of a network. In: Mathematical proceedings of the cambridge philosophical society, vol 37. Cambridge Univ Press, pp 194–197

    Google Scholar 

  8. Concorde TSP Solver (2011). http://www.math.uwaterloo.ca/tsp/concorde/index.html. Accessed 19 Jan 2014

  9. Cook W (2012) In pursuit of the traveling salesman: mathematics at the limits of computation. Princeton University Press

    Google Scholar 

  10. DIMACS TSP Challenge (2008). http://dimacs.rutgers.edu/Challenges/TSP/. Accessed 19 June 2014

  11. Eiben ÁE, Van Der Hauw JK, van Hemert JI (1998) Graph coloring with adaptive evolutionary algorithms. J Heuris 4(1):25–46

    Article  MATH  Google Scholar 

  12. Falkenauer E (1996) A hybrid grouping genetic algorithm for bin packing. J Heuris 2(1):5–30

    Article  Google Scholar 

  13. Garey MR, Johnson DS, Stockmeyer L (1974) Some simplified np-complete problems. In: Proceedings of the sixth annual ACM symposium on theory of computing. ACM, pp 47–63

    Google Scholar 

  14. Gualandi S, Chiarandini M, Graph coloring benchmarks: vertex coloring. https://sites.google.com/site/graphcoloring/vertex-coloring. Accessed 2 Sept 2013

  15. Helsgaun K (2000) An effective implementation of the lin-kernighan traveling salesman heuristic. Eur J Oper Res 126(1):106–130

    Article  MathSciNet  MATH  Google Scholar 

  16. Hughes JA (2012) Reanchoring, recentering & restarting an evolutionary algorithm. Undergraduate thesis, Brock University

    Google Scholar 

  17. Hughes JA (2014) A study of ordered gene problems featuring DNA error correction and DNA fragment assembly with a variety of heuristics, genetic algorithm variations, and dynamic representations. Master’s thesis, Brock University

    Google Scholar 

  18. Hughes JA, Houghten S, Ashlock D (2014) Recentering and restarting a genetic algorithm using a generative representation for an ordered gene problem. Int J Hybrid Intell Syst 11(4):257–271

    Article  Google Scholar 

  19. Hughes J, Brown JA, Houghten S, Ashlock D (2013) Edit metric decoding: representation strikes back. In: 2013 IEEE Congress on Evolutionary Computation (CEC). IEEE, pp 229–236

    Google Scholar 

  20. Hughes J, Houghten S, Ashlock D (2013) Recentering, reanchoring & restarting an evolutionary algorithm. In: 2013 World Congress on Nature and Biologically Inspired Computing (NaBIC). IEEE, pp 76–83

    Google Scholar 

  21. Hughes J, Houghten S, Mallen-Fullerton GM, Ashlock D (2014) Recentering and restarting genetic algorithm variations for DNA fragment assembly. In: 2014 IEEE conference on computational intelligence in bioinformatics and computational biology. IEEE, pp 1–8

    Google Scholar 

  22. Jacobson N (2012) Basic algebra I. Courier Dover Publications

    Google Scholar 

  23. Johnson DS, Garey MR (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman & Co, San Francisco, p 32

    Google Scholar 

  24. Johnson DS, McGeoch LA (2007) Experimental analysis of heuristics for the STSP. In: The traveling salesman problem and its variations. Springer, pp 369–443

    Google Scholar 

  25. Kanda J, Carvalho A, Hruschka E, Soares C (2011) Selection of algorithms to solve traveling salesman problems using meta-learning. Int J Hybrid Intell Syst 8(3):117–128

    Article  Google Scholar 

  26. Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. John Wiley & Sons, Inc

    Google Scholar 

  27. Reinelt G (2013) TSPlib. http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/. Accessed 13 Nov 2013

  28. Schoenfield JE (2002) Fast, exact solution of open bin packing problems without linear programming. Draft, US Army Space & Missile Defense Command, p 45

    Google Scholar 

  29. Whitley D (1992) An executable model of a simple genetic algorithm. In: Foundations of generic algorithms, vol. 2, pp 45–62

    Google Scholar 

  30. Whitley D, Rana S, Heckendorn RB (1999) The island model genetic algorithm: on separability, population size and convergence. J Comput Inf Technol 7:33–48

    Google Scholar 

  31. Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67–82

    Article  Google Scholar 

  32. Xia B, Tan Z (2010) Tighter bounds of the first fit algorithm for the bin-packing problem. Discret Appl Math 158(15):1668–1675

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This research was supported in part by the Natural Sciences and Engineering Research Council of Canada.

Author information

Authors and Affiliations

  1. Brock University, St. Catharines, ON, Canada

    James Alexander Hughes & Sheridan Houghten

  2. University of Guelph, Guelph, ON, Canada

    Daniel Ashlock

Authors
  1. James Alexander Hughes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sheridan Houghten
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniel Ashlock
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sheridan Houghten .

Editor information

Editors and Affiliations

  1. Dept of Computer Science and Engineering, SOA University Dept of Computer Science and Engineering, Bhubaneswar, Odisha, India

    Srikanta Patnaik

  2. School of Science and Technology, Middlesex University School of Science and Technology, London, United Kingdom

    Xin-She Yang

  3. School of H.S.E., University of Hyogo School of H.S.E., Himeji, Japan

    Kazumi Nakamatsu

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Hughes, J.A., Houghten, S., Ashlock, D. (2017). Permutation Problems, Genetic Algorithms, and Dynamic Representations. In: Patnaik, S., Yang, XS., Nakamatsu, K. (eds) Nature-Inspired Computing and Optimization. Modeling and Optimization in Science and Technologies, vol 10. Springer, Cham. https://doi.org/10.1007/978-3-319-50920-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50920-4_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-50919-8

  • Online ISBN: 978-3-319-50920-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation