Affiliation:
1. King Mongkut’s University of Technology North Bangkok (KMUTNB)
Abstract
Based on Multi-Objective Memetic Algorithm (MOMA), a novel Multi-Objective Chaos Memetic Algorithm (MOCMA) is proposed . MOCMA is presented to keep population’s diversity, avoid local optimum and improve performance of Multi-Objective Memetic Algorithm. By virtue of the over-spread character of chaos sequence, it is used to generate chromosome to overcome redundancies. At the same time, searching space is enlarged by using sensitivity of chaos initial value. The comparisons of MOCMA with NSGAII in DTLZ problems suggest that MOCMA clearly outperforms in converging towards the true pareto front and finding the spread of solutions.
Publisher
Trans Tech Publications, Ltd.
Reference15 articles.
1. A. Alkan, E. Özcan, Memetic Algorithms for timetabling, Yeditepe University, 34755 Kayisdagi - Istanbul/Turkey, (2003).
2. Kumar R, Singh PK , Pareto evolutionary Algorithm hybridized with local search for biobjective TSP, In: Grosan C, Abraham A, Ishibuchi H (eds) Hybrid Evolutionary Algorithms, Springer, Berlin, 2007, p.361–98.
3. Nguyen Quoc Viet Hung, Ta Quang Binh and Duong Tuan Anh, A Memetic Algorithm for Timetabling" Proceedings of 3nd Int, Conf. RIVF, 05 Research Informatics Vietnam-Francophony , 2005 , p.289 – 294.
4. H Ishibuchi, Y Hitotsuyanagi, N Tsukamoto, Y., Implementation of Multiobjective Memetic Algorithms for Combinatorial Optimization Problems: A Knapsack Problem Case Study , Multi-objective Memetic Algorithms, 2009 , p.27–49.
5. Ishibuchi, H., Murata, T., Multi-Objective Genetic Local Search Algorithm, In: Proc. of 1996 IEEE International Conference on Evolutionary Computation, 1996, p.119–124.