Use of biased neighborhood structures in multiobjective memetic algorithms

Soft Computing

Volumn 13, Issue 8-9, 2009, Pages 795-810

  Ishibuchi, Hisao ^a   Hitotsuyanagi, Yasuhiro ^a   Tsukamoto, Noritaka ^a   Nojima, Yusuke ^a  

^a Osaka Prefecture University   (Japan)

Author keywords

Evolutionary computation; Flowshop scheduling problems; Knapsack problems; Multiobjective memetic algorithms; Multiobjective optimization

Indexed keywords

EVOLUTIONARY ALGORITHMS; INTEGER PROGRAMMING; PROBABILITY; SCHEDULING; SCHEDULING ALGORITHMS; SOFT COMPUTING;

COMPUTATIONAL EXPERIMENTS; EVOLUTIONARY COMPUTATION; FLOWSHOP SCHEDULING PROBLEMS; HYBRID ALGORITHMS; KNAPSACK PROBLEMS; LOCAL SEARCHES; MULTIOBJECTIVE MEMETIC ALGORITHMS; NEIGHBORHOOD STRUCTURES; NSGA-II;

MULTIOBJECTIVE OPTIMIZATION;

EID: 62649089182     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-008-0352-6     Document Type: Article

References (36)

1. Caponio A, Cascella GL, Neri F, Salvatore N, Sumner M (2007) A fast adaptive memetic algorithm for online and offline control design of PMSM drives. IEEE Trans Syst Man Cybern B 37:28-41
2. Coello CAC, Lamont GB (2004) Applications of multi-objective evolutionary algorithms. World Scientific, Singapore
3. Coello CAC, Van Veldhuizen DA, Lamont GB (2002) Evolutionary algorithms for solving multi-objective problems. Kluwer, Boston
4. Czyzak P, Jaszkiewicz A (1998) Pareto simulated annealing - a metaheuristic technique for multiple objective combinatorial optimization. J Multi-Criteria Decis Anal 7:34-47
5. Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, Chichester
6. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6:182-197
7. Doerner K, Gutjahr WJ, Hartl RF, Strauss C, Stummer C (2004) Pareto ant colony optimization: A metaheuristic approach to multiobjective portfolio selection. Ann Oper Res 131:79-99
8. Fonseca CM, Fleming PJ (1996) On the performance assessment and comparison of stochastic multiobjective optimizers. Lect Notes Comput Sci 1141:584-593
9. Guo XP, Yang GK, Zhiming W, Huang ZH (2006) A hybrid fine-timed multi-objective memetic algorithm. IEICE Trans Fundam Electron Commun Comput Sci E89A:790-797
10. Ishibuchi H, Kaige S, Narukawa K (2005) Comparison between Lamarckian and Baldwinian repair on multiobjective 0/1 knapsack problems. Lect Notes Comput Sci 3410:370-385
11. Ishibuchi H, Murata M (1998) A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans Syst Man Cybern C 28:392-403
12. Ishibuchi H, Narukawa K (2004) Some issues on the implementation of local search in evolutionary multiobjective optimization. Lect Notes Comput Sci 3102:1246-1258
13. Ishibuchi H, Yoshida T, Murata T (2003) Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans Evol Comput 7:204-223
14. Jakob W (2006) Towards an adaptive multimeme algorithm for parameter optimisation suiting the engineers' needs. Lect Notes Comput Sci 4193:132-141
15. Jaszkiewicz A (2001) Comparison of local search-based meta-heuristics on the multiple objective knapsack problem. Found Comput Decis Sci 26:99-120
16. Jaszkiewicz A (2002a) Genetic local search for multi-objective combinatorial optimization. Eur J Oper Res 137:50-71
17. Jaszkiewicz A (2002b) On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment. IEEE Trans Evol Comput 6:402-412
18. Jaszkiewicz A (2004) On the computational efficiency of multiple objective metaheuristics: The knapsack problem case study. Eur J Oper Res 158:418-433
19. Knowles JD, Corne DW (2000a) M-PAES: A memetic algorithm for multiobjective optimization. In: Proceedings of 2000 congress on evolutionary computation, pp 325-332
20. Knowles JD, Corne DW (2000b) A comparison of diverse approaches to memetic multiobjective combinatorial optimization. In: Proceedings of 2000 genetic and evolutionary computation conference workshop program, pp 103-108
21. Knowles JD, Corne DW (2002) On metrics for comparing non-dominated sets. In: Proceedings of 2002 congress on evolutionary computation, pp 711-716
22. Knowles JD, Corne DW (2005) Memetic algorithms for multi-objective optimization: Issues, methods and prospects. In: Hart WE, Krasnogor N, Smith JE(eds) Recent advances in memetic algorithms. Springer, Berlin, pp 313-352
23. Krasnogor N, Blackburnem B, Hirst JD, Burke EK (2002) Multimeme algorithms for protein structure prediction. Lect Notes Comput Sci 2439:769-778
24. Krasnogor N, Smith JE (2005) A tutorial for competent memetic algorithms: Model, taxonomy, and design issues. IEEE Trans Evol Comput 9:474-488
25. Moscato P (1999) Memetic algorithms: A short introduction. In: Corne D, Dorigo M, Glover F(eds) New ideas in optimization.. McGraw-Hill, Maidenhead, pp 219-234
26. Murata T, Ishibuchi H, Gen M (2001) Specification of genetic search directions in cellular multi-objective genetic algorithm. Lect Notes Comput Sci 1993:82-95
27. Murata T, Ishibuchi H, Tanaka T (1996) Genetic algorithms for flowshop scheduling problems. Comput Ind Eng 30:1061-1071
28. Murata T, Kaige S, Ishibuchi H (2003) Generalization of dominance relation-based replacement rules for memetic EMO algorithms. Lect Notes Comput Sci 2723:1233-1244
29. Ong YS, Keane AJ (2004) Meta-Lamarckian learning in memetic algorithms. IEEE Trans Evol Comput 8:99-110
30. Ong YS, Lim MH, Zhu N, Wong KW (2006) Classification of adaptive memetic algorithms: A comparative study. IEEE Trans Syst Man Cybern B 36:141-152
31. Rahimi-Vahed AR, Mirghorbani SM (2007) A multi-objective particle swarm for a flow shop scheduling problem. J Comb Optim 13:79-102
32. Smith JE (2007) Coevolving memetic algorithms: A review and progress report. IEEE Trans Syst Man Cybern B 37:6-17
33. Van Veldhuizen DA (1999) Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. PhD dissertation. Air Force Institute of Technology, Dayton, USA
34. Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3:257-271
35. Zitzler E, Laumanns M, Thiele L (2001) SPEA2: Improving the strength Pareto evolutionary algorithm. TIK-Report 130, Swiss Federal Institute of Technology (ETH) Zurich, Zurich, Switzerland
36. Zitzler E, Thiele L, Laumanns M, Fonseca CM, da Fonseca VG (2003) Performance assessment of multiobjective optimizers: An analysis and review. IEEE Trans Evol Comput 7:117-132