A hybrid fine-tuned multi-objective memetic algorithm

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E89-A, Issue 3, 2006, Pages 790-797

  Guo, Xiuping ^a   Yang, Genke ^a   Wu, Zhiming ^a   Huang, Zhonghua ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Fine tuned; Hybrid; Memetic algorithm; Multi objective 0 1 knapsack problem; Multi objective optimization

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; ONLINE SYSTEMS; OPTIMIZATION; PERTURBATION TECHNIQUES; SIMULATED ANNEALING;

FINE-TUNED; HYBRID; MEMETIC ALGORITHM; MULTI-OBJECTIVE 0/1 KNAPSACK PROBLEM; MULTI-OBJECTIVE OPTIMIZATION;

ALGORITHMS;

EID: 33645749765     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e89-a.3.790     Document Type: Article

References (18)

1. J. Ulungu, P.M. Teghem, D. Fortemps, and Tuyttens, "MOSA method: A tool for solving multiobjective combinatorial optimization problems," Journal of Multi-Criteria Decision Analysis, vol.8, pp.221-236, 1999.
2. E. Zitzler, M. Laumanns, and L. Thiele, "SPEA2: Improving the strength pareto evolutionary algorithm," TIK-Report 103, 2001.
3. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, "A fast and elitist multiobjective genetic algorithm NSGA-II," IEEE Trans. Evol. Comput., vol.6, no.2, pp. 182-197, 2002.
4. J.D. Knowles and D.W. Corne, "The Pareto archived evolution strategy: A new baseline algorithm for Pareto multiobjective optimization," Proc. 1999 Congress on Evolutionary Computation, pp.98-105, 1999.
5. S.M. Yang, D.G. Shao, and Y.J. Luo, "A novel evolution strategy for multiobjective optimization problem," Appl. Math. Comput., pp. 1-24, 2005.
6. E. Zitzler and L. Thiele, "Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach," IEEE Trans. Evol. Comput., vol.3, no.4, pp.257-271, 1999.
7. H. Ishibuchi and T. Murata, "Multi-objective genetic local search algorithm," Proc. 1996 Congress on Evolutionary Computation, pp.119-124, 1996.
8. H. Ishibuchi and T. Murata, "A multi-objective genetic local search algorithm and its application to flowshop scheduling," IEEE Trans. Syst. Man. Cybern., vol.28, no.3, pp.392-403, 1998.
9. H. Ishibuchi, T. Yoshida, and T. Murata, "Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling," IEEE Trans. Evol. Comput., vol.7, no.2, pp.204-223, 2003.
10. A. Jaszkiewicz, "Genetic local search for multiple objective combinatorial optimization," Eur. J. Oper. Res., vol.137, pp.50-71, 2002.
11. J.D. Knowles and D.W. Corne, "M-PAES A memetic algorithm for multiobjective optimization," Proc. 2000 Congress on Evolutionary Computation, pp.325-332, 2000.
12. A. Jaszkiewicz, "Brief papers on the performance of multiple-objective genetic local search on the 0/1 knapsack problem: A comparative experiment," IEEE Trans. Evol. Comput., vol.6, no.4, pp.402-412, 2002.
13. G.G. Yen and L. Haiming, "Dynamic multiobjective evolutionary algorithm: Adaptive cell-based rank and density estimation," IEEE Trans. Evol. Comput., vol.7, pp.253-274, 2003.
14. K.C. Tan, T.H. Lee, and E.F. Khor, "Evolutionary algorithms with dynamic population size and local exploration for multiobjective optimization," IEEE Trans. Evol. Comput., vol.5, pp.565-588, 2001.
15. http://www.tik.ee.ethz.ch/~ziztler/testdata.html
16. http://www-idss.cs.put.poznan.pl/~jaszkiewicz/mokp
17. J.E. Fieldsend, R.M. Everson, and S. Singh, "Using unconstrained elite archives for multiobjective optimization," IEEE Trans. Evol. Comput., vol.7, pp.305-323, 2003.
18. P.A.N. Bosman and D. Thierens, "The balance between proximity and diversity in multiobjective evolutionary algorithms," IEEE Trans. Evol. Comput., vol.7, pp. 174-188, 2003.