Abstract
This paper proposes a new mating scheme for evolutionary multiobjective optimization (EMO), which simultaneously improves the convergence speed to the Pareto-front and the diversity of solutions. The proposed mating scheme is a two-stage selection mechanism. In the first stage, standard fitness-based selection is iterated for selecting a pre-specified number of candidate solutions from the current population. In the second stage, similarity-based tournament selection is used for choosing a pair of parents among the candidate solutions selected in the first stage. For maintaining the diversity of solutions, selection probabilities of parents are biased toward extreme solutions that are different from prototypical (i.e., average) solutions. At the same time, our mating scheme uses a mechanism where similar parents are more likely to be chosen for improving the convergence speed to the Pareto-front. Through computational experiments on multi-objective knapsack problems, it is shown that the performance of recently proposed well-known EMO algorithms (SPEA and NSGA-II) can be improved by our mating scheme.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Coello Coello, C. A., Van Veldhuizen, D. A., and Lamont, G. B.: Evolutionary Algorithms for Solving Multi-Objective Problems, Kluwer Academic Publishers, Boston (2002).
Czyzak, P., and Jaszkiewicz, A.: Pareto-Simulated Annealing — A Metaheuristic Technique for Multi-Objective Combinatorial Optimization, Journal of Multi-Criteria Decision Analysis 7 (1998) 34–47.
Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms, John Wiley & Sons, Chichester (2001).
Deb, K., Pratap, A., Agarwal, S., and Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II, IEEE Trans. on Evolutionary Computation 6 (2002) 182–197.
Fonseca, C. M., and Fleming, P. J.: Genetic Algorithms for Multiobjective Optimization: Formulation, Discussion and Generalization, Proc. of 5th International Conference on Genetic Algorithms (1993) 416–423.
Fonseca, C. M., and Fleming, P. J.: An Overview of Evolutionary Algorithms in Multiobjective Optimization, Evolutionary Computation 3 (1995) 1–16.
Goldberg, D. E.: Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading (1989).
Hajela, P., and Lin, C. Y.: Genetic Search Strategies in Multicriterion Optimal Design, Structural Optimization 4 (1992) 99–107.
Horn, J., Nafpliotis, N., and Goldberg, D. E.: A Niched Pareto Genetic Algorithm for Multi-Objective Optimization, Proc. of 1st IEEE International Conference on Evolutionary Computation (1994) 82–87.
Ishibuchi, H., and Murata, T.: A Multi-Objective Genetic Local Search Algorithm and Its Application to Flowshop Scheduling, IEEE Trans. on Systems, Man, and Cybernetics-Part C: Applications and Reviews 28 (1998) 392–403.
Ishibuchi, H., and Shibata, Y.: An Empirical Study on the Effect of Mating Restriction on the Search Ability of EMO Algorithms, Proc. of Second International Conference on Evolutionary Multi-Criterion Optimization (2003 in press).
Ishibuchi, H., Yoshida, T., and Murata, T.: Balance between Genetic Search and Local Search in Memetic Algorithms for Multiobjective Permutation Flowshop Scheduling, IEEE Trans. on Evolutionary Computation (2003 in press).
Jaszkiewicz, A.: Genetic Local Search for Multi-Objective Combinatorial Optimization, European Journal of Operational Research 137 (2002) 50–71.
Knowles, J. D., and Corne, D. W.: M-PAES: A Memetic Algorithm for Multiobjective Optimization, Proc. of 2000 Congress on Evolutionary Computation (2000) 325–332.
Knowles, J. D., and Corne, D. W.: On Metrics for Comparing Non-Dominated Sets, Proc. of 2002 Congress on Evolutionary Computation (2002) 711–716.
Schaffer, J. D.: Multiple Objective Optimization with Vector Evaluated Genetic Algorithms, Proc. of 1st International Conference on Genetic Algorithms and Their Applications (1985) 93–100.
Van Veldhuizen, D. A., and Lamont, G. B.: Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art, Evolutionary Computation 8 (2000) 125–147.
Watanabe, S., Hiroyasu, T., and Miki, M.: LCGA: Local Cultivation Genetic Algorithm for Multi-Objective Optimization Problem, Proc. of 2002 Genetic and Evolutionary Computation Conference (2002) 702.
Zitzler, E., Deb, K., and Thiele, L.: Comparison of Multiobjective Evolutionary Algorithms: Empirical Results, Evolutionary Computation 8 (2000) 173–195.
Zitzler, E., and Thiele, L.: Multiobjective Optimization using Evolutionary Algorithms — A Comparative Case Study, Proc. of 5th International Conference on Parallel Problem Solving from Nature (1998) 292–301.
Zitzler, E., and Thiele, L.: Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach, IEEE Transactions on Evolutionary Computation 3 (1999) 257–271.
Zitzler, E., Laumanns, M., and Thiele, L.: SPEA2: Improving the Performance of the Strength Pareto Evolutionary Algorithm, Technical Report 103, Computer Engineering and Communication Networks Lab, Swiss Federal Institute of Technology, Zurich (2001).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ishibuchi, H., Shibata, Y. (2003). A Similarity-Based Mating Scheme for Evolutionary Multiobjective Optimization. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45105-6_116
Download citation
DOI: https://doi.org/10.1007/3-540-45105-6_116
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40602-0
Online ISBN: 978-3-540-45105-1
eBook Packages: Springer Book Archive