Reducing local optima in single-objective problems by multi-objectivization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1993, Issue , 2001, Pages 269-283

  Knowles, Joshua D ^a   Watson, Richard A ^b   Corne, David W ^a  

^a UNIVERSITY OF READING   (United Kingdom)

^b BRANDEIS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TRAVELING SALESMAN PROBLEM;

BUILDING BLOCKES; HILL-CLIMBING OPTIMIZATION; LOCAL OPTIMA; MULTI OBJECTIVE; SIMULTANEOUS OPTIMIZATION; SINGLE OBJECTIVE; SINGLE OBJECTIVE OPTIMIZATION; TRAVELLING SALESMAN PROBLEM;

MULTIOBJECTIVE OPTIMIZATION;

EID: 84931320658     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44719-9_19     Document Type: Conference Paper

References (18)

1. R. Bellman. Dynamic programming and multi-stage decision processes of stochastic type. In Proceedings of the second symposium in linear programming, volume 2, pages 229-250, Washington D.C., 1955. NBS and USAF.
2. D. W. Corne and J. D. Knowles. The Pareto-envelope based selection algorithm for multiobjective optimization. In Proceedings of the Sixth International Conference on Parallel Problem Solving from Nature (PPSN VI), pages 839-848, Berlin, 2000. Springer-Verlag.
3. M. M. Flood. The travelling-salesman problem. Operations Research, 4:61-75, 1956.
4. J. Horn, D. Goldberg, and K. Deb. Long path problems for mutation-based algorithms. Technical Report 92011, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, Urbana IL, 1992.
5. M. Huynen, P. Stadler, and W. Fontana. Smoothness within ruggedness: The role of neutrality in adaptation. Proceedings of the National Academy of Sciences (USA), 93:397-401, 1996.
6. D. S. Johnson and L. A. McGeoch. The travelling salesman problem: a case study. In E. Aarts and J. K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 215-310. John Wiley and Sons, 1997.
7. T. Jones. Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, University of New Mexico, Albuquerque, 1995.
8. J. D. Knowles and D. W. Corne. The Pareto archived evolution strategy: A new baseline algorithm for multiobjective optimisation. In 1999 Congress on Evolutionary Computation, pages 98-105, Washington, D.C., July 1999. IEEE Service Center.
9. J. D. Knowles and D. W. Corne. Approximating the nondominated front using the Pareto archived evolution strategy. Evolutionary Computation, 8(2):149-172, 2000.
10. S. J. Louis and G. J. E. Rawlins. Pareto optimality, GA-easiness and deception. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms (ICGA-5), pages 118-123, San Mateo, CA, 1993. Morgan Kaufmann.
11. S. W. Mahfoud. Niching methods for genetic algorithms. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, IL, USA, 1995. IlliGAL Report 95001.
12. W. Mendenhall and R. J. Beaver. Introduction to Probability and Statistics - 9th edition. Duxbury Press, International Thomson Publishing, Pacific Grove, CA, 1994.
13. M. G. Norman and P. Moscato. The euclidean traveling salesman problem and a space-filling curve. Chaos, Solitons and Fractals, 6:389-397, 1995.
14. C. R. Reeves. Modern heuristic techniques. In V. Rayward-Smith, I. Osman, C. Reeves, and G. Smith, editors, Modern Heuristic Search Methods, chapter 1, pages 1-26. John Wiley and Sons Ltd., 1996.
15. D. A. Van Veldhuizen and G. B. Lamont. Multiobjective Optimization with Messy Genetic Algorithms. In Proceedings of the 2000 ACM Symposium on Applied Computing, pages 470-476, Villa Olmo, Como, Italy, 2000. ACM.
16. R. A. Watson, G. S. Hornby, and J. B. Pollack. Modeling building-block inter- dependency. In Parallel Problem Solving from Nature - PPSN 5, pages 97-106. Springer-Verlag, 1998.
17. R. A. Watson and J. B. Pollack. Analysis of recombinative algorithms on a hier- archical building-block problem. In Foundations of Genetic Algorithms (FOGA), 2000.
18. R. A. Watson and J. B. Pollack. Symbiotic combination as an alternative to sexual recombination in genetic algorithms. In Proceedings of the Sixth International Conference of Parallel Problem Solving From Nature (PPSN VI), pages 425-436. Springer-Verlag, 2000.