Abstract
Hybridization of evolutionary algorithms with local search (LS) has already been investigated in many studies. Such a hybrid algorithm is often referred to as a memetic algorithm. Hart investigated the following four questions for designing efficient memetic algorithms for single-objective optimization: (1) How often should LS be applied? (2) On which solutions should LS be used? (3) How long should LS be run? (4) How efficient does LS need to be? When we apply LS to an evolutionary multiobjective optimization (EMO) algorithm, another question arises: (5) To which direction should LS drive? This paper mainly addresses the final issue together with the others. We apply LS to the set of non-dominated solutions that is stored separately from the population governed by genetic operations in a cellular multiobjective genetic algorithm (C-MOGA). The appropriate direction for the non-dominated solutions is attained in experiments on multiobjective classification problems.
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
Schaffer, J.D.: Multi-objective optimization with vector evaluated genetic algorithms. Proc. of 1st International Conference on Genetic Algorithms (1985) 93–100.
Knowles, J.D. and Corne, D.W.: The Pareto archived evolution strategy: A new baseline algorithm for Pareto multiobjective optimization, Proc. of 1999 Congress on Evolutionary Computation (1999) 98–105.
Zitzler, E. and Thiele, L.: Multiobjective evolutionary algorithms: A comparative casestudy and the strength Pareto approach, IEEE Trans. on Evolutionary Computation 3,4 (1999) 257–271.
Knowles, J.D. and Corne, D.W.: Approximating the nondominated front using the Pareto archived evolution strategy, Evolutionary Computation 8,2 (2000) 149–172.
Zitzler, E., Deb, K. and Thiele, L.: Comparison of multiobjective evolutionary algorithms: Empirical results, Evolutionary Computation 8,2 (2000) 173–195.
Deb, K., Pratap, A., Agarwal, S. and Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Trans. on Evolutionary Computaiton 6,2 (2002) 182–197.
Merz, P. and Freisleben B.: Genetic local search for the TSP: New results, Proc. of 4th IEEE International Conference on Evolutionary Computation (1997) 159–164.
Krasnogor, N. and Smith, J.: A memetic algorithm with self-adaptive local search: TSP as a case study, Proc. of 2000 Genetic and Evolutionary Computation Conference (2000) 987–994.
Moscato, P.: Memetic algorithms: A short instruction, in Corne, D., Glover F. and Doring M. (eds.) New Ideas in Optimization. McGraw-Hill, Maidenhead (1999) 219–234.
Hart, W. E., Krasnogor, N., and Smith, J. (eds.), First Workshop on Memetic Algorithms (WOMA I), in Proc. of 2000 Genetic and Evolutionary Computation Conference Workshop Program (2000) 95–130.
Hart, W. E., Krasnogor, N., and Smith, J. (eds.), Second Workshop on Memetic Algorithms (WOMA II), in Proc. of 2001 Genetic and Evolutionary Computation Conference Workshop Program (2001) 137–179.
Hart, W. E., Krasnogor, N., and Smith, J. (eds.), Proc. of Third Workshop on Memetic Algorithms (WOMA III) (2002) (in press).
Hart, W. E.: Adaptive global optimization with local search, Ph. D. Thesis, University of California (1994).
Ishibuchi, H. and Murata, T.: Multi-objective genetic local search algorithm, Proc. of 3rd IEEE International Conference on Evolutionary Computation (1996) 119–124.
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,3 (1998) 392–403.
Jaszkiewicz, A.: Genetic local search for multi-objective combinatorial optimization, European Journal of Operational Research 137,1 (2002) 50–71.
Murata, T., Nozawa, H., Tsujimura, Y., Gen, M. and Ishibuchi, H.: Effect of local search on the performance of cellular multi-objective genetic algorithms for designing fuzzy rulebased classification systems, Proc. of the 2002 Congress on Evolutionary Computation (2002) 663–668.
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.: A comparison of diverse approaches to memetic multiobjective combinatorial optimization, Proc. of 2000 Genetic and Evolutionary Computation Conference Workshop Program (2000) 103–108.
Knowles, J.D. and Corne, D.W.: A comparison of diverse approaches to memetic multiobjective combinatorial optimization, Proc. of 2001 Genetic and Evolutionary Computation Conference Workshop Program (2001) 162–167.
Deb, K. and Goel, T.: A hybrid multi-objective evolutionary approach to engineering shape design, Proc. of 1st International Conference on Evolutionary Multi-Criterion Optimization (2001) 385–399.
Talbi, E., Rahoual, M., Mabed, M. H. and Dhaenens, C.: A hybrid evolutionary approach for multicriteria optimization problems: Application to the flow shop, Proc. of 1st International Conference on Evolutionary Multi-Criterion Optimization (2001) 416–428.
Whitley, D.: Cellular genetic algorithms, Proc. of 5th International Conference on Genetic Algorithms (1993) 658.
Manderick, B. and Spiessens, P.: Fine-grained parallel genetic algorithms, Proc. of 3rd International Conference on Genetic Algorithms (1989) 428–433.
Murata, T., Ishibuchi, H. and Gen, M.: Specification of genetic search directions in cellular multi-objective genetic algorithms, Proc. of First International Conference on Evolutionary multi-criterion optimization (2001) 82–95.
Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms, John Wiley & Sons, Chichester (2001).
Ishibuchi, H, Nozaki, K. and Tanaka, H.: Distributed representation of fuzzy rules and its application to pattern classification, Fuzzy Sets and Systems 52 (1992) 21–32.
Hammerstrom, D.: Neural networks at work, IEEE Spectrum June (1993) 26–32.
Hammerstrom, D.: Working with neural networks, IEEE Spectrum July (1993) 46–53.
Quinlan, J.R.: Introduction of decision trees, Machine Learning 1 (1985) 71–99.
Murata, T. and Ishibuchi, H.: MOGA: Multi-objective genetic algorithms, Proc. of The 2nd IEEE International Conference on Evolutionary Computing (1995) 289–294.
Murata, T., Ishibuchi, H. and Gen, M.: Specification of genetic search directions in cellular multi-objective genetic algorithms, Proc. of First International Conference on Evolutionary multi-criterion optimization (2001) 82–95.
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
Murata, T., Nozawa, H., Ishibuchi, H., Gen, M. (2003). Modification of Local Search Directions for Non-dominated Solutions in Cellular Multiobjective Genetic Algorithms for Pattern Classification Problems. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds) Evolutionary Multi-Criterion Optimization. EMO 2003. Lecture Notes in Computer Science, vol 2632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36970-8_42
Download citation
DOI: https://doi.org/10.1007/3-540-36970-8_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-01869-8
Online ISBN: 978-3-540-36970-7
eBook Packages: Springer Book Archive