Comparison between lamarckian and baldwinian repair on multiobjective 0/1 knapsack problems

Authors:
Hisao Ishibuchi;Shiori Kaige;Kaname Narukawa
Affiliations:
Department of Industrial Engineering, Osaka Prefecture University, Osaka, Japan;Department of Industrial Engineering, Osaka Prefecture University, Osaka, Japan;Department of Industrial Engineering, Osaka Prefecture University, Osaka, Japan
Venue:
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Year:
2005

Citing 7
Cited 8

Shall We Repair? Genetic AlgorithmsCombinatorial Optimizationand Feasibility Constraints

Proceedings of the 5th International Conference on Genetic Algorithms
Multiobjective evolutionary algorithms: classifications, analyses, and new innovations

Multiobjective evolutionary algorithms: classifications, analyses, and new innovations
Empirical investigation of the benefits of partial lamarckianism

Evolutionary Computation
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach

IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation
On the performance of multiple-objective genetic local search onthe 0/1 knapsack problem - a comparative experiment

IEEE Transactions on Evolutionary Computation
Performance assessment of multiobjective optimizers: an analysis and review

IEEE Transactions on Evolutionary Computation

Effects of the use of non-geometric binary crossover on evolutionary multiobjective optimization

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Computer-based dietary menu planning

EC'06 Proceedings of the 7th WSEAS International Conference on Evolutionary Computing
The development of a sub-population genetic algorithm II (SPGA II) for multi-objective combinatorial problems

Applied Soft Computing
Discussion of Search Strategy for Multi-objective Genetic Algorithm with Consideration of Accuracy and Broadness of Pareto Optimal Solutions

SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
A multi-tiered memetic multiobjective evolutionary algorithm for the design of quantum cascade lasers

EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Diversity improvement by non-geometric binary crossover in evolutionary multiobjective optimization

IEEE Transactions on Evolutionary Computation
Imitation tendencies of local search schemes in baldwinian evolution

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Empirical evaluation of search based requirements interaction management

Information and Software Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper examines two repair schemes (i.e., Lamarckian and Baldwinian) through computational experiments on multiobjective 0/1 knapsack problems. First we compare Lamarckian and Baldwinian with each other. Experimental results show that the Baldwinian repair outperforms the Lamarckian repair. It is also shown that these repair schemes outperform a penalty function approach. Then we examine partial Lamarckianism where the Lamarckian repair is applied to each individual with a prespecified probability. Experimental results show that a so-called 5% rule works well. Finally partial Lamarckianism is compared with an island model with two subpopulations where each island has a different repair scheme. Experimental results show that the island model slightly outperforms the standard single-population model with the 50% partial Lamarckian repair in terms of the diversity of solutions.