Comparison between Lamarckian and Baldwinian repair on multiobjective 0/1 knapsack problems

Lecture Notes in Computer Science

Volumn 3410, Issue , 2005, Pages 370-385

  Ishibuchi, Hisao ^a   Kaige, Shiori ^a   Narukawa, Kaname ^a  

^a Osaka Prefecture University   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; MATHEMATICAL MODELS; PROBABILITY;

COMPUTATIONAL EXPERIMENTS; POPULATION MODEL;

PROBLEM SOLVING;

EID: 24344459552     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31880-4_26     Document Type: Conference Paper

References (18)

1. Czyzak, P. and Jaszkiewicz, A.: Pareto-Simulated Annealing - A Metaheuristic Technique for Multi-Objective Combinatorial Optimization. Journal of Multi-Criteria Decision Analysis 7 (1998) 34-47.
2. Deb, K., Pratap, A., Agarwal, S., and Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Trans. on Evolutionary Computation 6 (2002) 182-197.
3. Houck, C. R., Joines, J. A., Kay, M. G., and Wilson, J. R.: Empirical Investigations of the Benefits of Partial Lamarckianism. Evolutionary Computation 5 (1997) 31-60.
4. Ishibuchi, H. and Kaige, S.: Effects of Repair Procedures on the Performance of EMO Algorithms for Multiobjective 0/1 Knapsack Problems. Proc. of 2003 Congress on Evolutionary Computation (2003) 2254-2261.
5. Jaszkiewicz, A.: Comparison of Local Search-based Metaheuristics on the Multiple Objective Knapsack Problem. Foundations of Computing and Decision Sciences 26 (2001) 99-120.
6. 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 (2002) 402-412.
7. 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.
8. Knowles, J. D. and Corne, D. W.: On Metrics for Comparing Non-dominated Sets. Proc. of 2002 Congress on Evolutionary Computation (2002) 711-716.
9. Liu, B., Haftka, R. T., Akgun, M. A., and Todoroki, A.: Permutation Genetic Algorithm for Stacking Sequence Design of Composite Laminates. Computer Methods in Applied Mechanics and Engineering 186 (2000) 357-372.
10. Michalewicz, Z. and Nazhiyath, G.: Genocop III: A Co-evolutionary Algorithm for Numerical Optimization Problems with Nonlinear Constraints. Proc. of 2nd IEEE International Conference on Evolutionary Computation 2 (1995) 647-651.
11. Mumford, C. L.: Comparing Representations and Recombination Operators for the Multi-Objective 0/1 Knapsack Problem. Proc. of 2003 Congress on Evolutionary Computation (2003) 854-861.
12. Orvosh, D. and Davis, L.: Shall We Repair? Genetic Algorithms, Combinatorial Optimization, and Feasibility Constraints. Proc. of 5th International Conference on Genetic Algorithms (1993) 650.
13. Orvosh, D. and Davis, L.: Using Genetic Algorithms to Optimize Problems with Feasibility Constraints. Proc. of 1st IEEE Conference on Evolutionary Computation (1994) 548-553.
14. Skolicki, Z. and De Jong, K.: Improving Evolutionary Algorithms with Multirepresentation Island Models. Lecture Notes in Computer Science, Vol. 3242 (Proc. of PPSN VIII), Springer, Berlin (2004) 420-429.
15. Van Veldhuizen, D. A.: Multiobjective Evolutionary Algorithms: Classifications, Analyses, and New Innovations. Ph. D dissertation, Air Force Institute of Technology (1999).
16. Zitzler, E. and Thiele, L.: Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Trans. on Evolutionary Computation 3 (1999) 257-271.
17. Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., and da Fonseca, V. G.: Performance Assessment of Multiobjective Optimizers: An Analysis and Review. IEEE Trans. on Evolutionary Computation 7 (2003) 117-132.
18. Zydallis, J. B. and Lamont, G. B.: Explicit Building-Block Multiobjective Evolutionary Algorithms for NPC Problems. Proc. of 2003 Congress on Evolutionary Computation (2003) 2685-2695.