Abstract
This paper discusses the implementation of local search in evolutionary multiobjective optimization (EMO) algorithms for the design of a simple but powerful memetic EMO algorithm. First we propose a basic framework of our memetic EMO algorithm, which is a hybrid algorithm of the NSGA-II and local search. In the generation update procedure of our memetic EMO algorithm, the next population is constructed from three populations: the current population, its offspring population generated by genetic operations, and an improved population obtained from the offspring population by local search. We use Pareto ranking and the concept of crowding in the same manner as in the NSGA-II for choosing good solutions to construct the next population from these three populations. For implementing local search in our memetic EMO algorithm, we examine two approaches, which have been often used in the literature: One is based on Pareto ranking, and the other is based on a weighted scalar fitness function. The main difficulty of the Pareto ranking approach is that the movable area of the current solution by local search is very small. On the other hand, the main difficulty of the weighted scalar approach is that the offspring population can be degraded by local search. These difficulties are clearly demonstrated through computational experiments on multiobjective knapsack problems using our memetic EMO algorithm. Our experimental results show that better results are obtained from the weighted scalar approach than the Pareto ranking approach. For further improving the weighted scalar approach, we examine some tricks that can be used for overcoming its difficulty.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Coello, C.A.C., Van Veldhuizen, D.A., Lamont, G.B.: Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer Academic Publishers, Boston (2002)
Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms. John Wiley & Sons, Chichester (2001)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Trans. on Evolutionary Computation 6, 182–197 (2002)
Ishibuchi, H., Kaige, S.: Effects of Repair Procedures on the Performance of EMO Algorithms for Multiobjective 0/1 Knapsack Problems. In: Proc. of 2003 Congress on Evolutionary Computation, pp. 2254–2261 (2003)
Ishibuchi, H., Kaige, S.: Implementation of Simple Multiobjective Memetic Algorithms and Its Application to Knapsack Problems. International Journal of Hybrid Intelligent System 1, 22–35 (2004)
Ishibuchi, H., 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, 392–403 (1998)
Ishibuchi, H., Yoshida, T., Murata, T.: Balance between Genetic Search and Local Search in Memetic Algorithms for Multiobjective Permutation Flowshop Scheduling. IEEE Trans. on Evolutionary Computation 7, 204–223 (2003)
Jaszkiewicz, A.: Comparison of Local Search-Based Metaheuristics on the Multiple Objective Knapsack Problem. Foundations of Computing and Decision Sciences 26, 99–120 (2001)
Jaszkiewicz, A.: On the Performance of Multiple-Objective Genetic Local Search on the 0/1 Knapsack Problem - A Comparative Experiment. IEEE Trans. on Evolutionary Computation 6, 402–412 (2002)
Jaszkiewicz, A.: Genetic Local Search for Multi-Objective Combinatorial Optimization. European Journal of Operational Research 137, 50–71 (2002)
Knowles, J.D., Corne, D.W.: M-PAES: A Memetic Algorithm for Multiobjective Optimization. In: Proc. of 2000 Congress on Evolutionary Computation, pp. 325–332 (2000)
Knowles, J.D., Corne, D.W.: A Comparison of Diverse Approaches to Memetic Multiobjective Combinatorial Optimization. In: Proc. of 2000 Genetic and Evolutionary Computation Conference Workshop Program: WOMA I, pp. 103–108 (2000)
Murata, T., Kaige, S., Ishibuchi, H.: Generalization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 1234–1245. Springer, Heidelberg (2003)
Zitzler, E., Thiele, L.: Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation 3, 257–271 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ishibuchi, H., Narukawa, K. (2004). Some Issues on the Implementation of Local Search in Evolutionary Multiobjective Optimization. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24854-5_120
Download citation
DOI: https://doi.org/10.1007/978-3-540-24854-5_120
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22344-3
Online ISBN: 978-3-540-24854-5
eBook Packages: Springer Book Archive