Skip to main content
SpringerLink
Log in

Elementary Landscape Decomposition of the Hamiltonian Path Optimization Problem,

  • Conference paper
Evolutionary Computation in Combinatorial Optimisation (EvoCOP 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8600))

Abstract

There exist local search landscapes where the evaluation function is an eigenfunction of the graph Laplacian that corresponds to the neighborhood structure of the search space. Problems that display this structure are called “Elementary Landscapes” and they have a number of special mathematical properties. The problems that are not elementary landscapes can be decomposed in a sum of elementary ones. This sum is called the elementary landscape decomposition of the problem. In this paper, we provide the elementary landscape decomposition for the Hamiltonian Path Optimization Problem under two different neighborhoods.

This research was sponsored by the Air Force Office of Scientific Research, Air Force Materiel Command, USAF, under grant number FA9550-11-1-0088. The U.S. Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon.

It was also partially funded by the Fulbright program, the Spanish Ministry of Education (“José Castillejo” mobility program), the University of Málaga (Andalucía Tech), the Spanish Ministry of Science and Innovation and FEDER under contract TIN2011-28194 and VSB-Technical University of Ostrava under contract OTRI 8.06/5.47.4142. The authors would also like to thank the organizers and participants of the seminar on Theory of Evolutionary Algorithms (13271) at Schloß Dagstuhl - Leibniz-Zentrum für Informatik.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Agarwala, R., Applegate, D.L., Maglott, D., Schuler, G.D.: A fast and scalable radiation hybrid map construction and integration strategy. Genome Research 10(3), 350–364 (2000)

    Article  Google Scholar 

  2. Burkard, R.E.: Quadratic Assignment Problems. In: Handbook of Combinatorial Optimization, 2nd edn., pp. 2741–2815. Springer (2013)

    Google Scholar 

  3. Chen, W., Whitley, D., Hains, D., Howe, A.: Second order partial derivatives for NK-landscapes. In: Proceeding of GECCO, pp. 503–510. ACM (2013)

    Google Scholar 

  4. Chicano, F., Alba, E.: Exact computation of the expectation curves of the bit-flip mutation using landscapes theory. In: Proc. of GECCO, pp. 2027–2034 (2011)

    Google Scholar 

  5. Chicano, F., Alba, E.: Exact computation of the fitness-distance correlation for pseudoboolean functions with one global optimum. In: Hao, J.-K., Middendorf, M. (eds.) EvoCOP 2012. LNCS, vol. 7245, pp. 111–123. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Chicano, F., Whitley, L.D., Alba, E.: A methodology to find the elementary landscape decomposition of combinatorial optimization problems. Evolutionary Computation 19(4), 597–637 (2011)

    Article  Google Scholar 

  7. Grover, L.K.: Local search and the local structure of NP-complete problems. Operations Research Letters 12, 235–243 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hains, D., Whitley, D., Howe, A., Chen, W.: Hyperplane initialized local search for MAXSAT. In: Proceeding of GECCO, pp. 805–812. ACM (2013)

    Google Scholar 

  9. Lawler, E.L.: The quadratic assignment problem. Manage. Sci. 9, 586–599 (1963)

    Article  MATH  MathSciNet  Google Scholar 

  10. Parsons, R., Forrest, S., Burks, C.: Genetic algorithms, operators, and DNA fragment assembly. Machine Learning 21, 11–33 (1995)

    Google Scholar 

  11. Reidys, C.M., Stadler, P.F.: Combinatorial landscapes. SIAM Review 44(1), 3–54 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Sutton, A.M., Chicano, F., Whitley, L.D.: Fitness function distributions over generalized search neighborhoods in the q-ary hypercube. Evol. Comput. 21(4) (2013)

    Google Scholar 

  13. Sutton, A.M., Whitley, D., Howe, A.E.: Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis. In: Proc. of GECCO, pp. 973–980 (2011)

    Google Scholar 

  14. Sutton, A.M., Whitley, L.D., Howe, A.E.: Computing the moments of k-bounded pseudo-boolean functions over hamming spheres of arbitrary radius in polynomial time. Theoretical Computer Science 425, 58–74 (2011)

    Article  MathSciNet  Google Scholar 

  15. Whitley, D., Chen, W.: Constant time steepest descent local search with lookahead for NK-landscapes and MAX-kSAT. In: Proc. of GECCO, pp. 1357–1364 (2012)

    Google Scholar 

  16. Whitley, D., Sutton, A.M., Howe, A.E.: Understanding elementary landscapes. In: Proc. of GECCO, pp. 585–592 (2008)

    Google Scholar 

  17. Whitley, L.D., Sutton, A.M.: Partial neighborhoods of elementary landscapes. In: Proc. of GECCO, pp. 381–388 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Colorado State University, Fort Collins, CO, USA

    Darrell Whitley

  2. Dept. de Lenguajes y Ciencias de la Computación, University of Málaga, Spain

    Francisco Chicano

Authors
  1. Darrell Whitley
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francisco Chicano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Artificial Intelligence, IKERBASQUE, Basque Foundation for Science, University of the Basque Country, Paseo Manuel Lardizabal 1, 20018, San Sebastian, Spain

    Christian Blum

  2. School of Natural Sciences, Department of Computing Science and Mathematics, University of Stirling, Room 4B104, Cottrell Building, FK9 4LA, Stirling, UK

    Gabriela Ochoa

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Whitley, D., Chicano, F. (2014). Elementary Landscape Decomposition of the Hamiltonian Path Optimization Problem, . In: Blum, C., Ochoa, G. (eds) Evolutionary Computation in Combinatorial Optimisation. EvoCOP 2014. Lecture Notes in Computer Science, vol 8600. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44320-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44320-0_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44319-4

  • Online ISBN: 978-3-662-44320-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation