Understanding elementary landscapes

GECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008

Volumn , Issue , 2008, Pages 585-592

  Whitley, L Darrell ^a   Sutton, Andrew M ^a   Howe, Adele E ^a  

^a Department of Computer Science   (United States)

Author keywords

Combinatorial optimization; Local search

Indexed keywords

LOCAL SEARCH (OPTIMIZATION);

COMBINATORIAL OPTIMIZATION PROBLEMS; DECOMPOSABILITY; ELEMENTARY LANDSCAPES; LOCAL SEARCH; NEIGHBORHOOD TOPOLOGY; OBJECTIVE FUNCTIONS; SEARCH ALGORITHMS; SOLUTION COMPONENTS;

COMBINATORIAL OPTIMIZATION;

EID: 57349181457     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1389095.1389208     Document Type: Conference Paper

References (16)

1. L. Barbulescu, A. E. Howe, L. D. Whitley, and M. Roberts. Understanding algorithm performance on an oversubscribed scheduling application. Journal of Artificial Intelligence Research, 27:577-615, Dec 2006.
2. J. W. Barnes, B. Dimova, and S. P. Dokov. The theory of elementary landscapes. Applied Mathematics Letters, 16(3):337-343, April 2003.
3. L. Barnett. Netcrawling - optimal evolutionary search with neutral networks. In Proceedings of the 2001 Congress of Evolutionary Computation (CEC2001), pages 30-37, Seoul, Korea, May 2001.
4. J. Carlier. Ordonnancements a contraintes disjunctives. R.A.I.R.O. Recherche operationelle/Operations Research, 12:333-351, 1978.
5. B. Codenotti and L. Margara. Local properties of some NP-complete problems. Technical Report TR 92-021, International Computer Science Institute, Berkeley, CA, 1992.
6. B. Colletti and J. W. Barnes. Linearity in the traveling salesman problem. Applied Mathematics Letters, 13(3):27-32, April 2000.
7. B. Dimova, J. Wesley Barnes, and E. Popova. Arbitrary elementary landscapes & ar(1) processes. Appl. Math. Lett., 18(3):287-292, 2005.
8. J. Frank, P. Cheeseman, and J. Stutz. When gravity fails: Local search topology. Journal of Artificial Intelligence Research, 7:249-281, 1997.
9. L. K. Grover. Local search and the local structure of NP-complete problems. Operations Research Letters, 12:235-243, 1992.
10. C. M. Reidys and P. F. Stadler. Neutrality in fitness landscapes. Applied Mathematics and Computation, 117:321-350, 2001.
11. A. Solomon, J. W. Barnes, S. P. Dokov, and R. Acevedo. Weakly symmetric graphs, elementary landscapes, and the tsp. Appl. Math. Lett., 16(3):401-407, 2003.
12. P. F. Stadler. Toward a theory of landscapes. In R. Lopéz- Peña, R. Capovilla, R. García-Pelayo, H. Waelbroeck, and F. Zertruche, editors, Complex Systems and Binary Networks, pages 77-163. Springer Verlag, 1995.
13. P. F. Stadler. Landscapes and their correlation functions. Journal of Mathematical Chemistry, 20:1-45, 1996.
14. P. F. Stadler and G. P. Wagner. Algebraic theory of recombination spaces. Evolutionary Computation, 5(3):241-275, 1997.
15. E. Taillard. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operations Research, 47:65-74, 1990.
16. S. Wright. The roles of mutation, inbreeding, crossbreeding, and selection in evolution. In Proceedings of the Sixth Congress of Genetics, volume 1, 1932.