M-PAES: A memetic algorithm for multiobjective optimization

Proceedings of the 2000 Congress on Evolutionary Computation, CEC 2000

Volumn 1, Issue , 2000, Pages 325-332

  Knowles, Joshua D ^a   Corne, David W ^a  

^a UNIVERSITY OF READING   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; EVOLUTIONARY ALGORITHMS; OPTIMIZATION; PARETO PRINCIPLE; PROBLEM SOLVING;

0/1 KNAPSACK PROBLEMS; LOCAL SEARCH STRATEGY; MEMETIC ALGORITHMS; MULTI OBJECTIVE; MULTI-OBJECTIVE OPTIMIZATION PROBLEM; PARETO ARCHIVED EVOLUTION STRATEGIES; PROBLEM INSTANCES; STRENGTH PARETO EVOLUTIONARY ALGORITHM;

MULTIOBJECTIVE OPTIMIZATION; GENETIC ALGORITHMS;

MEMETIC ALGORITHM; MULTIOBJECTIVE OPTIMIZATION; PARETO ARCHIVED EVOLUTIONARY STRATEGY;

EID: 0033666525     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2000.870313     Document Type: Conference Paper

References (32)

1. P. C. Borges and M. Pilegaard Hansen. A basis for future successes in multiobjective combinatorial optmiza-tion. Technical Report IMM-REP-1998-8, Institute of Mathematical Modelling, Technical University of Denmark, 2800 Lyngby, Denmark, 1998.
2. C. A. Coello Coello. A Comprehensive Survey of Evolutionary-Based Multiobjective Optimization Techniques. Knowledge and Information Systems. An International Journal, l(3):269-308, August 1999.
3. P. Czyzak and A. Jaszkiewicz. Pareto simulated annealing-a metaheuristic technique for multiple-objective combinatorial optimization. Journal of Multi-Criteria Decision Analysis, 7(l):34-47, January 1998.
4. C. M. Fonseca and P. J. Fleming. Genetic Algorithms for Multiobjective Optimization: Formulation, Discussion and Generalization. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 416-423, San Mateo, California, 1993. University of Illinois at Urbana-Champaign, Morgan Kauffman Publishers.
5. C. M. Fonseca and P. J. Fleming. Nonlinear System Identification with Multiobjective Genetic Algorithms. In Proceedings of the 13th World Congress of the International Federation of Automatic Control, pages 187-192, San Francisco, California, 1996. Pergamon Press.
6. B. Freisleben and P. Merz. A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems. In Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, pages 616-621. IEEE Press, 1996.
7. X. Gandibleux and A. Froville. Tabu Search Based Procedure for solving the 0/1 Multiobjective knapsack Problem : the two objective case. Journal of Heuristics, Accepted 1998. (to appear).
8. X. Gandibleux, N. Mezdaoui, and A. Frdville. A tabu Search Procedure to Solve Multiobjective Combinatorial Optimization Problems. In R. Caballero and R. Steuer, editors, Proceedings volume of MOPGP'96, pages 291-300, Berlin, 1996. Springer-Verlag.
9. D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing Company, Reading, Massachusetts, 1989.
10. J. Horn and N. Nafpliotis. Multiobjective Optimization using the Niched Pareto Genetic Algorithm. Technical Report IlliGAl Report 93005, University of Illinois at Urbana-Champaign, Urbana, Illinois, USA, 1993.
11. H. Ishibuchi and T. Murata. Multi-Objective Genetic Local Search Algorithm. In T. Fukuda and T. Fu-ruhashi, editors, Proceedings of the 1996 International Conference on Evolutionary Computation, pages 119-124, Nagoya, Japan, 1996. IEEE.
12. A. Jaszkiewicz. Genetic local search for multiple objective combinatorial optimization. Technical Report RA-014/98, Institute of Computing Science, Poznan University of Technology, December 1998.
13. A. Jaszkiewicz. Improving performance of genetic local search by changing local search space topology. Foundations of Computing and Decision Sciences, 24:77-84, 1999.
14. J. D. Knowles and D. W. Corne. Assessing the Performance of the Pareto Archived Evolution Strategy. In A. S. Wu, editor, Proceedings of the 1999 Genetic and Evolutionary Computation Conference. Workshop Program, pages 123-124, San Francisco, CA, July 1999. Morgan Kaufmann.
15. J. D. Knowles and D. W. Corne. Local Search, Multiobjective Optimization and the Pareto Archived Evolution Strategy. In B. McKay, editor, Proceedings of The Third Australia-Japan Joint Workshop on Intelligent and Evolutionary Systems, pages 209-216, Ashik-aga, Japan, November 1999. Ashikaga Institute of Technology.
16. 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, Piscataway, NJ, July 1999. IEEE Service Center.
17. J. D. Knowles and D. W. Corne. Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy. Evolutionary Computation, 8(2): 149172, 2000.
18. W. Mendenhall and R. J. Beaver. Introduction to Probability and Statistics-9th edition. Duxbury Press, International Thomson Publishing, Pacific Grove, CA, 1994.
19. P. Moscato. Memetic algorithms: A short introduction. In D. Come, F. Glover, and M. Dorigo, editors, New Ideas in Optimization, pages 219-234. McGraw-Hill, 1999.
20. P. Moscato and F. Tinetti. Blending heuristics with a population-based approach: A memetic algorithm for the traveling salesman problem. Report 92-12, Univer-sidad Nacional de La Plata, C.C. 75, 1900 La Plata, Argentina, 1992.
21. G. T. Parks and I. Miller. Selective Breeding in a Multi-objective Genetic Algorithm. In A. E. Eiben, M. Schoe-nauer, and H.-P. Schwefel, editors, Parallel Problem Solving From Nature-PPSN V, pages 250-259, Amsterdam, Holland, 1998. Springer-Verlag.
22. M. Pilegaard Hansen. Tabu Search in Multiobjective Optimisation : MOTS. In T. Stewart and R. van den Honert, editors, Proceedings of 13th International Conference on Multiple Criteria Decision Making, Berlin, 1996. Springer-Verlag.
23. G. Rudolph. Evolutionary Search for Minimal Elements in Partially Ordered Finite Sets. In V. Porto, N. Sara-vanan, D. Waagen, and A. Eiben, editors, Evolutionary Programming VII, Proceedings of the 7th Annual Conference on Evolutionary Programming, pages 345-353, Berlin, 1998. Springer-Verlag.
24. G. Rudolph. On a Multi-Objective Evolutionary Algorithm and Its Convergence to the Pareto Set. In Proceedings of the 5th IEEE Conference on Evolutionary Computation, pages 511-516, Piscataway, New Jersey, 1998. IEEE Press.
25. J. D. Schaffer. Multiple Objective Optimization with Vector Evaluated Genetic Algorithms. PhD thesis, Van-derbilt University, 1984.
26. P. Serafini. Simulated Annealing for Multi Objective Optimization Problems. Multiple Criteria Decision Making-Expand and Enrich the Domains of Thinking and Application, pages 283-292, 1994.
27. N. Srinivas and K. Deb. Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms. Evolutionary Computation, 2(3):221-248, fall 1994.
28. E. L. Ulungu, J. Teghem, P. H. Fortemps, and D. Tuyt-tens. MOSA Method: A Tool for Solving Multiobjective Combinatorial Optimization Problems. Journal of Multi-Criteria Decision Analysis, 8(4):221-236,1999.
29. A. P. Wierzbicki. The use of reference objectives in multiobjective optimization. In G. Fandel and T. Gal, editors, MCDM Theory and Application, Proceedings Hagen/Konigswinter 1979, Lecture Notes in Economics and Mathematical Systems 177, pages 468-186, Berlin, 1980. Springer-Verlag.
30. E. Zitzler, K. Deb, and L. Thiele. Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Technical Report 70, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich, Switzerland, February 1999.
31. E. Zitzler and L. Thiele. An Evolutionary Algorithm for Multiobjective Optimization: The Strength Pareto Approach. Technical Report 43, Computer Engineering and Communication Networks Lab (TIK), Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, May 1998.
32. E. Zitzler and L. Thiele. Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation, 3(4):257-271, November 1999.