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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Czyzak, P., Jaszkiewicz, A.: Pareto-Simulated Annealing – A Metaheuristic Technique for Multi-Objective Combinatorial Optimization. Journal of Multi-Criteria Decision Analysis 7, 34–47 (1998)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Trans. on Evolutionary Computation 6, 182–197 (2002)
Houck, C.R., Joines, J.A., Kay, M.G., Wilson, J.R.: Empirical Investigations of the Benefits of Partial Lamarckianism. Evolutionary Computation 5, 31–60 (1997)
Ishibuchi, H., Kaige, S.: Effects of Repair Procedures on the Performance of EMO Algorithms for Multiobjective 0/1 Knapsack Problems. In: Proc. of 2003 Congress on Evolutionary Computation, pp. 2254–2261 (2003)
Jaszkiewicz, A.: Comparison of Local Search-based Metaheuristics on the Multiple Objective Knapsack Problem. Foundations of Computing and Decision Sciences 26, 99–120 (2001)
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, 402–412 (2002)
Knowles, J.D., Corne, D.W.: A Comparison of Diverse Approaches to Memetic Multiobjective Combinatorial Optimization. In: Proc. of 2000 Genetic and Evolutionary Computation Conference Workshop Program, pp. 103–108 (2000)
Knowles, J.D., Corne, D.W.: On Metrics for Comparing Non-dominated Sets. In: Proc. of 2002 Congress on Evolutionary Computation, pp. 711–716 (2002)
Liu, B., Haftka, R.T., Akgun, M.A., Todoroki, A.: Permutation Genetic Algorithm for Stacking Sequence Design of Composite Laminates. Computer Methods in Applied Mechanics and Engineering 186, 357–372 (2000)
Michalewicz, Z., Nazhiyath, G.: Genocop III: A Co-evolutionary Algorithm for Numerical Optimization Problems with Nonlinear Constraints. In: Proc. of 2nd IEEE International Conference on Evolutionary Computation, vol. 2, pp. 647–651 (1995)
Mumford, C.L.: Comparing Representations and Recombination Operators for the Multi-Objective 0/1 Knapsack Problem. In: Proc. of 2003 Congress on Evolutionary Computation, pp. 854–861 (2003)
Orvosh, D., Davis, L.: Shall We Repair? Genetic Algorithms, Combinatorial Optimization, and Feasibility Constraints. In: Proc. of 5th International Conference on Genetic Algorithms, p. 650 (1993)
Orvosh, D., Davis, L.: Using Genetic Algorithms to Optimize Problems with Feasibility Constraints. In: Proc. of 1st IEEE Conference on Evolutionary Computation, pp. 548–553 (1994)
Skolicki, Z., De Jong, K.: Improving Evolutionary Algorithms with Multi-representation Island Models. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 420–429. Springer, Berlin (2004)
Van Veldhuizen, D.A.: Multiobjective Evolutionary Algorithms: Classifications, Analyses, and New Innovations. Ph. D dissertation, Air Force Institute of Technology (1999)
Zitzler, E., Thiele, L.: Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Trans. on Evolutionary Computation 3, 257–271 (1999)
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., da Fonseca, V.G.: Performance Assessment of Multiobjective Optimizers: An Analysis and Review. IEEE Trans. on Evolutionary Computation 7, 117–132 (2003)
Zydallis, J.B., Lamont, G.B.: Explicit Building-Block Multiobjective Evolutionary Algorithms for NPC Problems. In: Proc. of 2003 Congress on Evolutionary Computation, pp. 2685–2695 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ishibuchi, H., Kaige, S., Narukawa, K. (2005). Comparison Between Lamarckian and Baldwinian Repair on Multiobjective 0/1 Knapsack Problems. In: Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (eds) Evolutionary Multi-Criterion Optimization. EMO 2005. Lecture Notes in Computer Science, vol 3410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31880-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-31880-4_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24983-2
Online ISBN: 978-3-540-31880-4
eBook Packages: Computer ScienceComputer Science (R0)