×

IT-CEMOP: an iterative co-evolutionary algorithm for multiobjective optimization problem with nonlinear constraints. (English) Zbl 1105.65331

Summary: Over the past few years, researchers have developed a number of multiobjective evolutionary algorithms (MOEAs). Although most studies concentrate on solving unconstrained optimization problems, there exit a few studies where MOEAs have been extended to solve constrained optimization problems. Most of them were based on penalty functions for handling nonlinear constraints by genetic algorithms. However the performance of these methods is highly problem-dependent, many methods require additional tuning of several parameters.
In this paper, we present a new optimization algorithm, which is based on concept of co-evolution and repair algorithm for handling nonlinear constraints. The algorithm maintains a finite-sized archive of nondominated solutions which gets iteratively updated in the presence of new solutions based on the concept of \(\varepsilon\)-dominance. The use of \(\varepsilon\)-dominance also makes the algorithms practical by allowing a decision maker to control the resolution of the Pareto set approximation by choosing an appropriate \(\varepsilon\) value, which guarantees convergence and diversity.
The results, provided by the proposed algorithm for six benchmark problems, are promising when compared with exiting well-known algorithms. Also, our results suggest that our algorithm is better applicable for solving real-world application problems.

MSC:

65K05 Numerical mathematical programming methods
90C29 Multi-objective and goal programming

Software:

IT-CEMOP; SPEA2; PAES
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] T. Binh, U. Korn, MOBES: A multi-objective Evolution Strategy for constrained optimization problems. In: Proceedings of the 3rd International Conference on Genetic algorithm MENDEL, Brno, Czech Republic, 1997, pp. 176-182.; T. Binh, U. Korn, MOBES: A multi-objective Evolution Strategy for constrained optimization problems. In: Proceedings of the 3rd International Conference on Genetic algorithm MENDEL, Brno, Czech Republic, 1997, pp. 176-182.
[2] Deb, K., Optimal design of a welded beam via genetic algorithms, AIAA Journal, 29, 11, 2013-2015 (1991)
[3] K. Deb, S. Agrawal, A. Pratab, T. Meyarivan, A fast elitist non-dominated sorting genetic algorithms for multiobjective optimization: NSGA II, KanGAL Report 200001, Indian Institute of Technology, Kanpur, India, (2000).; K. Deb, S. Agrawal, A. Pratab, T. Meyarivan, A fast elitist non-dominated sorting genetic algorithms for multiobjective optimization: NSGA II, KanGAL Report 200001, Indian Institute of Technology, Kanpur, India, (2000).
[4] Deb, K., Multi-objective optimization using evolutionary algorithms (2001), Wiley: Wiley NY, USA · Zbl 0970.90091
[5] Deb, K.; Mohan, M.; Mishra, S., A fast multiobjective evolutionary algorithm for finding well spread Pareto-optimal solutions, (Fonesca, C. M.; etal., In: Proceedings of the evolutionary multi-criterion optimization. Second International Conference. EMO 2003, Faro, Portugal. In: Proceedings of the evolutionary multi-criterion optimization. Second International Conference. EMO 2003, Faro, Portugal, Lecture Notes in Computer Science, vol. 2632 (2003), Springer), 222-236 · Zbl 1036.90525
[6] Chafekar, Deepti; Xuan, Jiang; Rasheed, Khaleed, Constrained multi-objective optimization using steady state genetic algorithms, (Cantú-Paz, Erick; etal., In: Proceedings of Genetic and Evolutionary Computation-GECCO 2003, Part I. In: Proceedings of Genetic and Evolutionary Computation-GECCO 2003, Part I, Lecture Notes in Computer Science, vol. 2723 (2003), Springer), 813-824 · Zbl 1028.68702
[7] T. Erlebach, H. Kellerer, U. Pferschy, Approximating multiobjective knapsack problems. In: Proceedings of the Seventh International Workshop on Algorithms and Data Structures (WADS 2001), Lecture Notes in Computer Science, vol. 2125, 2001, pp. 210-221.; T. Erlebach, H. Kellerer, U. Pferschy, Approximating multiobjective knapsack problems. In: Proceedings of the Seventh International Workshop on Algorithms and Data Structures (WADS 2001), Lecture Notes in Computer Science, vol. 2125, 2001, pp. 210-221. · Zbl 1018.90034
[8] Fonseca, C. M.; Fleming, P. J., An overview of evolutionary algorithms in multiobjective optimization, Evolutionary Computation, 3, 1, 1-16 (1995)
[9] Golinski, J., Optimal synthesis problems solved by means of nonlinear programming and random methods, Journal of Mechanisms, 5, 287-309 (1970)
[10] Golinski, J., An adaptive optimization system applied to machine synthesis, Mechanism and Machine Theory, 8, 419-436 (1973)
[11] Helbig, S.; Pateva, D., On several concepts for &z.epsiv;-efficiency, OR Spektrum, 16, 3, 179-186 (1994) · Zbl 0822.90116
[12] Horn, J.; Nafpliotis, N.; Goldberg, D. E., A niched Pareto genetic algorithm for multiobjective optimization, (Grefenstette, J. J.; etal., IEEE World Congress on Computational Intelligence. IEEE World Congress on Computational Intelligence, In: Proceedings of the 1st IEEE Conference on Evolutionary Computation (1994), IEEE Press: IEEE Press Piscataway, NJ), 82-87
[13] F. Jimenez, J.L. Verdegay, Constrained multiobjective optimization by evolutionary algorithm. In: Proceeding of the International ICSC Symposium on Engineering of intelligent systems (EIS’98), 1998, pp. 266-271.; F. Jimenez, J.L. Verdegay, Constrained multiobjective optimization by evolutionary algorithm. In: Proceeding of the International ICSC Symposium on Engineering of intelligent systems (EIS’98), 1998, pp. 266-271.
[14] Knowles, J. D.; Corne, D. W., The Pareto archived evolution strategy: a new baseline algorithm for multiobjective optimization, (In: Proceedings of the 1999 Congress on Evolutionary Computation (1999), IEEE Press: IEEE Press Piscataway, NJ), 98-105
[15] Knowles, J. D.; Corne, D. W., M-PAES: A memetic algorithm for multiobjective optimization, (In: Proceedings of the 2000 Congress on Evolutionary Computation (2000), IEEE Press: IEEE Press Piscataway, NJ), 325-332
[16] Kurpati, A.; Azarm, S.; Wu, J., Constraint handling improvements for multiobjective genetic algorithms, Structured Multiobjective Optimization, 23, 204-213 (2002)
[17] Laumanns, M.; Thiele, L.; Deb, K.; Zitzler, E., Archiving with guaranteed convergence and diversity in multi-objective optimization, (In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002) (2002), Morgan Kaufman Publishers: Morgan Kaufman Publishers New York, NY, USA), 439-447
[18] Michalewiz, Z., Genetic algorithms+Data structures=Evolution programs (1996), Springer-Verlag
[19] Michalewicz, Z.; Schoenauer, M., Evolutionary algorithms for constrained parameter optimization problems, Evolutionary Computation, 4, 1, 1-32 (1996)
[20] Miettinen, K., Non-linear multiobjective optimization (2002), Kluwer Academic Publisher: Kluwer Academic Publisher Dordrecht
[21] Murata, T.; Ishibuchi, H.; Tanaka, H., Multiobjective genetic algorithm and its application to flowshop scheduling, Computers and Industrial Engineering, 30, 4, 957-968 (1996)
[22] Osman, M. S.; Abo-Sinna, M. A.; Mousa, A. A., A solution to the optimal power flow using genetic algorithm, Journal of Applied Mathematics and Computation, 155, 391-405 (2004) · Zbl 1062.78012
[23] Osman, M. S.; Abo-Sinna, M. A.; Mousa, A. A., An effective genetic algorithm approach to multiobjective resource allocation problems (MORAPs), Journal of Applied Mathematics and Computation, 163, 755-768 (2005) · Zbl 1060.65605
[24] A. Osyczka, S. Kundu, A new method to solve generalized multicriteria optimization problems (10) (1995) 98-105.; A. Osyczka, S. Kundu, A new method to solve generalized multicriteria optimization problems (10) (1995) 98-105.
[25] Schaffer, J. D., Multiple objective optimization with vector evaluated genetic algorithms, (Grefenstette, J. J.; etal., Genetic algorithms and their applications. Genetic algorithms and their applications, In: Proceedings of the 1st International Conference on Genetic Algorithms (1985), Lawrence Erlbaum: Lawrence Erlbaum Mahwah, NJ), 93-100
[26] Srinivas, N.; Deb, K., Multiobjective optimization using nondominated sorting in genetic algorithms, Evolutionary Computation, 2, 3, 221-248 (1999)
[27] M. Tanaka, GA- based decision support system for multi-criteria optimization. In: Proceedings of the International Conference on systems, Man and Cybernetics 2, 1995, pp. 1556-1561.; M. Tanaka, GA- based decision support system for multi-criteria optimization. In: Proceedings of the International Conference on systems, Man and Cybernetics 2, 1995, pp. 1556-1561.
[28] E. Zitzler, L. Thiele, Multiobjective optimization using evolutionary algorithms: A comparative case study, in: A.E. Eiben, T. Back, M. Schoenauer, H.P. Schwefel, (Eds.), Fifth International Conference on Parallel Problem Solving from Nature (PPSN-V), Berlin, Germany, 1998, pp. 292-301.; E. Zitzler, L. Thiele, Multiobjective optimization using evolutionary algorithms: A comparative case study, in: A.E. Eiben, T. Back, M. Schoenauer, H.P. Schwefel, (Eds.), Fifth International Conference on Parallel Problem Solving from Nature (PPSN-V), Berlin, Germany, 1998, pp. 292-301.
[29] E. Zitzler, M. Laumanns, L. Thiele, SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization. In: Proceedings of Evolutionary methods for design, optimization and control with applications to industrial problems, EUROGEN 2001, Athens, Greece, (2001).; E. Zitzler, M. Laumanns, L. Thiele, SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization. In: Proceedings of Evolutionary methods for design, optimization and control with applications to industrial problems, EUROGEN 2001, Athens, Greece, (2001).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.