Ramya Ravichandran
ABSTRACT
The importance of dynamic multi-objective optimization problems (DMOPs) is on the rise, in complex systems. DMOPs have several objective functions and constraints that vary over time to be considered simultaneously. As a result, the Pareto optimal solutions (POS) and Pareto front (PF) will also vary with time. The desired algorithm should not only locate the optima but also track the moving optima efficiently. In this paper, we propose a new Cultural Algorithm (CA) based on decomposition (CA/D). The primary objective of the CA/D algorithm is to decompose DMOP into several scalar optimization subproblems and solve simultaneously. The subproblems are optimized utilizing the information shared only by its neighboring problems. The proposed CA/D is evaluated using CEC 2015 optimization benchmark functions. The results show that CA/D outperforms CA, Multi-population CA (MPCA), and MPCA incorporating game strategies (MPCA-GS), particularly in hybrid and composite benchmark problems.
- Abraham Charnes, William W Cooper, and Robert O Ferguson. 1955. Optimal estimation of executive compensation by linear programming. Management science 1, 2 (1955), 138--151.Google Scholar
- Aimin Zhou, Yaochu Jin, Qingfu Zhang, Bernhard Sendhoff, and Edward Tsang. 2007. Prediction-based population reinitialization for evolutionary dynamic multi-objective optimization. In International Conference on Evolutionary MultiCriterion Optimization. Springer, 832--846.Google Scholar
- Andries P Engelbrecht. 2007. Computational intelligence: an introduction. John Wiley & Sons.Google Scholar
- Dilpreet Singh et al 2018. A Multilevel Cooperative Multi-Population Cultural Algorithm. In 2018 IEEE Innovations in Intelligent Systems and Applications (INISTA). IEEE, 1--5Google Scholar
- Jingxuan Wei and Liping Jia. 2013. A novel particle swarm optimization algorithm with local search for dynamic constrained multi-objective optimization problems. In 2013 IEEE Congress on Evolutionary Computation. IEEE, 2436--2443.Google ScholarCross Ref
- Kaisa Miettinen. 1999. Nonlinear Multiobjective Optimization. Vol. 12. Springer Science & Business Media.Google Scholar
- Kalyanmoy Deb. 1995. Optimization methods for engineering design. (1995).Google Scholar
- Kalyanmoy Deb. 2001. Multi-Objective Optimization Using Evolutionary Algorithms. Vol. 16. John Wiley & Sons.Google Scholar
- Leilei Cao, Lihong Xu, Erik D Goodman, Shuwei Zhu, and Hui Li. 2018. A differential prediction model for evolutionary dynamic multiobjective optimization. In Proceedings of the Genetic and Evolutionary Computation Conference. ACM, 601--608.Google ScholarDigital Library
- Leilei Cao, Lihong Xu, Erik D Goodman, and Hui Li. 2019. Decomposition-based evolutionary dynamic multiobjective optimization using a difference model. Applied Soft Computing 76 (2019), 473--490.Google ScholarDigital Library
- Marde Helbig and Andries P Engelbrecht. 2014. Benchmarks for dynamic multiobjective optimisation algorithms. ACM Computing Surveys (CSUR) 46, 3 (2014), 37.Google ScholarDigital Library
- Panth Parikh and Ziad Kobti. 2017. Comparative strategies for knowledge migration in Multi Objective Optimization Problems. In 2017 IEEE 30th Canadian Conference on Electrical and Computer Engineering (CCECE). IEEE, 1--5Google ScholarCross Ref
- Qingfu Zhang and Hui Li. 2007. MOEA/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Transactions on evolutionary computation 11, 6 (2007), 712--731.Google ScholarDigital Library
- Radhia Azzouz, Slim Bechikh, and Lamjed Ben Said. 2015. Multi-objective optimization with dynamic constraints and objectives: new challenges for evolutionary algorithms. In Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation. ACM, 615--622.Google ScholarDigital Library
- Renzhi Chen, Ke Li, and Xin Yao. 2018. Dynamic multiobjectives optimization with a changing number of objectives. IEEE Transactions on Evolutionary Computation 22, 1 (2018), 157--171.Google ScholarCross Ref
- Robert G Reynolds. 1994. An introduction to cultural algorithms. In Proceedings of the third annual conference on evolutionary programming. World Scientific, 131--139.Google Scholar
- Shouyong Jiang and Shengxiang Yang. 2017. A steady-state and generational evolutionary algorithm for dynamic multiobjective optimization. IEEE Transactions on Evolutionary Computation 21, 1 (2017), 65--82.Google ScholarDigital Library
- Tim Blackwell and Jürgen Branke. 2006. Multiswarms, exclusion, and anticonvergence in dynamic environments. IEEE transactions on evolutionary computation 10, 4 (2006), 459--472.Google Scholar
- Ziad Kobti et al. 2013. Heterogeneous multi-population cultural algorithm. In 2013 IEEE Congress on Evolutionary Computation. IEEE, 292--299.Google Scholar
Index Terms
- Solving Dynamic Multi-Objective Optimization Problems Using Cultural Algorithm based on Decomposition
Recommendations
Adaptive weights generation for decomposition-based multi-objective optimization using Gaussian process regression
GECCO '17: Proceedings of the Genetic and Evolutionary Computation ConferenceBy transforming a multi-objective optimization problem into a number of single-objective optimization problems and optimizing them simultaneously, decomposition-based evolutionary multi-objective optimization algorithms have attracted much attention in ...
A pareto-based evolutionary algorithm using decomposition and truncation for dynamic multi-objective optimization
AbstractMaintaining a balance between convergence and diversity of the population in the objective space has been widely recognized as the main challenge when solving problems with two or more conflicting objectives. This is added by another ...
Highlights- A novel mating selection strategy based decomposition was proposed for producing two promising solutions with good diversity and convergence.
Cellular teaching-learning-based optimization approach for dynamic multi-objective problems
Many real-world optimization problems involve several conflicting objectives that must be optimized simultaneously. Furthermore, most optimization problems have a dynamic structure and change over time. In addition to trying to establish trade-offs ...
Comments