×

An enhanced differential evolution based algorithm with simulated annealing for solving multiobjective optimization problems. (English) Zbl 1442.90175

Summary: An enhanced differential evolution based algorithm, named multi-objective differential evolution with simulated annealing algorithm (MODESA), is presented for solving multiobjective optimization problems (MOPs). The proposed algorithm utilizes the advantage of simulated annealing for guiding the algorithm to explore more regions of the search space for a better convergence to the true Pareto-optimal front. In the proposed simulated annealing approach, a new acceptance probability computation function based on domination is proposed and some potential solutions are assigned a life cycle to have a priority to be selected entering the next generation. Moreover, it incorporates an efficient diversity maintenance approach, which is used to prune the obtained nondominated solutions for a good distributed Pareto front. The feasibility of the proposed algorithm is investigated on a set of five biobjective and two triobjective optimization problems and the results are compared with three other algorithms. The experimental results illustrate the effectiveness of the proposed algorithm.

MSC:

90C29 Multi-objective and goal programming
90C59 Approximation methods and heuristics in mathematical programming

Software:

GDE3; MOEA/D; SPEA2
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Knowles, J. D.; Corne, D. W., Approximating the nondominated front using the Pareto Archived Evolution Strategy, Evolutionary Computation, 8, 2, 149-172 (2000)
[2] Deb, K.; Pratap, A.; Agarwal, S.; Meyarivan, T., A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation, 6, 2, 182-197 (2002)
[3] Zitzler, E.; Laumanns, M.; Thiele, L., SPEA2: improving the strength pareto evolutionary algorithm (2003), Lausanne, Switzerland: Swiss Federal Institute of Technology, Lausanne, Switzerland
[4] Zhang, Q.; Li, H., MOEA/D: a multiobjective evolutionary algorithm based on decomposition, IEEE Transactions on Evolutionary Computation, 11, 6, 712-731 (2007)
[5] Coello Coello, C. A., An updated survey of GA-based multiobjective optimization techniques, ACM Computing Surveys, 32, 2, 109-143 (2000)
[6] Coello Coello, C. A.; van Veldhuizen, D. A.; Lamont, G. B., Evolutionary Algorithms for Solving Multi-Objective Problems, xxii+800 (2007), New York, NY, USA: Springer, New York, NY, USA
[7] Zhou, A.; Qu, B.-Y.; Li, H.; Zhao, S.-Z.; Suganthan, P. N.; Zhangd, Q., Multiobjective evolutionary algorithms: a survey of the state of the art, Swarm and Evolutionary Computation, 1, 1, 32-49 (2011)
[8] Storn, R.; Price, K., Differential evolution-a simple and efficient adaptive scheme for global optimization over continuous spaces, TR-95-012 (1995), Berkeley, Calif, USA
[9] Storn, R.; Price, K., Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces, Journal of Global Optimization, 11, 4, 341-359 (1997) · Zbl 0888.90135
[10] Price, K. V., Differential evolution vs. the functions of the 2nd ICEO, Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC ’97)
[11] Abbass, H. A.; Sarker, R.; Newton, C., PDE: a Pareto-frontier differential evolution approach for multi-objective optimization problems, Proceedings of the IEEE Congress on Evolutionary Computation (CEC ’01)
[12] Abbass, H. A., The self-adaptive Pareto differential evolution algorithm, Proceedings of the IEEE Congress on Evolutionary Computation
[13] Madavan, N. K., Multiobjective optimization using a Pareto differential evolution approach, Proceedings of the Congress on Evolutionary Computation
[14] Xue, F.; Sanderson, A. C.; Graves, R. J., Multi-objective differential evolution and its application to enterprise planning, Proceedings of the IEEE International Conference on Robotics and Automation
[15] Parsopoulos, K. E.; Tasoulis, D. K.; Pavlidis, N. G.; Plagianakos, V. P.; Vrahatis, M. N., Vector evaluated differential evolution for multiobjective optimization, Proceedings of the Congress on Evolutionary Computation (CEC ’04)
[16] Kukkonen, S.; Lampinen, J., An extension of generalized differential evolution for multi-objective optimization with constraints, Parallel Problem Solving From Nature (PPSN2004), 752-761 (2004)
[17] Kukkonen, S.; Lampinen, J., GDE3: the third evolution step of generalized differential evolution, Proceedings of the IEEE Congress on Evolutionary Computation (CEC ’05)
[18] Hernández-Díaz, A. G.; Santana-Quintero, L. V.; Coello, C.; Caballero, R.; Molina, J., A new proposal for multi-objective optimization using differential evolution and rough sets theory, Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation
[19] Wang, Y.-N.; Wu, L.-H.; Yuan, X.-F., Multi-objective self-adaptive differential evolution with elitist archive and crowding entropy-based diversity measure, Soft Computing, 14, 3, 193-209 (2010)
[20] Huang, V. L.; Qin, A. K.; Suganthan, P. N.; Tasgetiren, M. F., Multi-objective optimization based on self-adaptive differential evolution algorithm, Proceedings of the IEEE Congress on Evolutionary Computation (CEC ’07)
[21] Huang, V. L.; Zhao, S. Z.; Mallipeddi, R.; Suganthan, P. N., Multi-objective optimization using self-adaptive differential evolution algorithm, Proceedings of the IEEE Congress on Evolutionary Computation (CEC ’09)
[22] Ali, M.; Pant, M.; Abraham, A., A modified differential evolution algorithm and its application to engineering problems, Proceedings of the International Conference on Soft Computing and Pattern Recognition (SoCPaR ’09)
[23] Ali, M.; Siarry, P.; Pant, M., An efficient Differential Evolution based algorithm for solving multi-objective optimization problems, European Journal of Operational Research, 217, 2, 404-416 (2012) · Zbl 1244.90203
[24] Tizhoosh, H. R., Opposition-based learning: a new scheme for machine intelligence, Proceedings of the International Conference on Computational Intelligence for Modelling Control and Automation (CIMCA ’05)
[25] Kirkpatrick, S.; Gelatt,, C. D.; Vecchi, M. P., Optimization by simulated annealing, Science, 220, 4598, 671-680 (1983) · Zbl 1225.90162
[26] Geman, S.; Geman, D., Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images, IEEE Transactions on Pattern Analysis and Machine Intelligence, 6, 6, 721-741 (1984)
[27] Suman, B.; Kumar, P., A survey of simulated annealing as a tool for single and multiobjective optimization, Journal of the Operational Research Society, 57, 10, 1143-1160 (2006) · Zbl 1121.90065
[28] Bandyopadhyay, S.; Saha, S.; Maulik, U.; Deb, K., A simulated annealing-based multiobjective optimization algorithm: AMOSA, IEEE Transactions on Evolutionary Computation, 12, 3, 269-283 (2008)
[29] Miettinen, K., Nonlinear Multiobjective Optimization, xxii+298 (1999), Kluwer Academic Publishers
[30] Kukkonen, S.; Deb, K., A fast and effective method for pruning of non-dominated solutions in many-objective problems, Parallel Problem Solving from Nature—PPSN IX. Parallel Problem Solving from Nature—PPSN IX, Lecture Notes in Computer Science, 4193, 553-562 (2006)
[31] Zitzler, E.; Deb, K.; Thiele, L., Comparison of multiobjective evolutionary algorithms: empirical results, Evolutionary Computation, 8, 2, 173-195 (2000)
[32] Deb, K., Multi-Objective Optimization Using Evolutionary Algorithms, xx+497 (2001), Chichester, UK: John Wiley & Sons, Chichester, UK
[33] Li, H.; Zhang, Q., Multiobjective optimization problems with complicated pareto sets, MOEA/ D and NSGA-II, IEEE Transactions on Evolutionary Computation, 13, 2, 284-302 (2009)
[34] Coello, C. A. C.; Cortés, N. C., Solving multiobjective optimization problems using an artificial immune system, Genetic Programming and Evolvable Machines, 6, 2, 163-190 (2005)
[35] van Veldhuizen, D. A.; Lamont, G. B., Multiobjective evolutionary algorithm research: a history and analysis, TR-98-03 (1998), Wright Patterson, Ohio, USA: Department of Electrical and Computer Engineering, Graduate School of Engineering, Air Force Inst Technol, Wright Patterson, Ohio, USA
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.