Bernard van Tonder
ABSTRACT
A core goal of research in dynamic multi-objective optimisation (DMOO) is to develop algorithms that can find the best possible trade-off solutions for real-world DMOO problems (RWPs). A useful comparison of DMOO algorithms for RWPs require benchmark functions that are representative of RWPs. However, only a few standard DMOO benchmark functions contain complex intertemporal dependencies found in RWPs.
This study evaluates the performance of two DMOO algorithms on two benchmark functions (BFs) with various combinations of frequency and severity of change, as well as extended versions of these BFs that include intertemporal dependencies. The results indicate that the performance of the algorithms was significantly worse on the BFs with intertemporal dependencies.
- R. Azzouz, S. Bechikh, and L.B. Said. 2016. Recent Advances in Evolutionary Multi-objective Optimization. Springer, Cham, Chapter Dynamic Multi-objective Optimization Using Evolutionary Algorithms: A Survey, 31--70.Google Scholar
- S. Bandari, R. Tiwari, and N. Roberts. 2016. Multi Objective optimization based Path Planning in robotics using nature inspired algorithms: A survey. In Proceedings of the International Conference on Power Electronics, Intelligent Control and Energy Systems. Delhi, India, 1--6.Google Scholar
- K. Deb, N.U.B. Rao, and S. Karthik. 2007. Dynamic Multi-objective Optimization and Decision-Making Using Modified NSGA-II. In Proceedings of the International Conference on Evolutionary Multi-Criterion Optimization. Lecture Notes in Computer Science, Vol. 4403. Springer, Berlin, Heidelberg, 803--817.Google Scholar
- M. Farina, K. Deb, and P. Amato. 2004. Dynamic Multiobjective Optimization Problems: Test Cases, Approximations, and Applications. IEEE Transactions on Evolutionary Computation 8, 5 (2004), 425--442.Google ScholarDigital Library
- C. Goh and K. Tan. 2009. "A Competitive-Cooperative Coevolutionary Paradigm for Dynamic Multiobjective Optimization. IEEE Transactions on Evolutionary Computation 13, 1 (2009), 103--127.Google ScholarDigital Library
- M. Helbig and A.P. Engelbrecht. 2013. Population-based metaheuristics for continuous boundary-constrained dynamic multi-objective optimisation problems. Swarm and Evolutionary Computation 14 (2013), 31--47.Google ScholarCross Ref
- S. Kukkonen. 2007. Performance assessment of Generalized Differential Evolution 3 (GDE3) with a given set of problems. In Proceedings of the Congress on Evolutionary Computation. Singapore, 3593--3600.Google ScholarCross Ref
- G. Lowenstein, D. Read, and R.F. Baumeister (Eds.). 2003. Time and decision: economic, psychological perspectives of intertemporal choice. Russell Sage Foundation.Google Scholar
- M. Mavrovouniotis, C. Li, and S. Yang. 2017. A survey of swarm intelligence for dynamic optimization: Algorithms and applications. Swarm and Evolutionary Computation 33 (2017).Google Scholar
- T. Niknam, R. Azizipanah-Abarghooee, and A. Roosta. 2012. Reserve Constrained Dynamic Economic Dispatch: A New Fast Self-Adaptive Modified Firefly Algorithm. IEEE Systems Journal 6, 4 (2012), 635--646.Google ScholarCross Ref
Index Terms
- Dynamic Multi-objective Optimisation Problems with Intertemporal Dependencies
Recommendations
Benchmarks for dynamic multi-objective optimisation algorithms
Algorithms that solve Dynamic Multi-Objective Optimisation Problems (DMOOPs) should be tested on benchmark functions to determine whether the algorithm can overcome specific difficulties that can occur in real-world problems. However, for Dynamic Multi-...
High performance computing for dynamic multi-objective optimisation
In this paper a generic parallel procedure for dynamic problems using evolutionary algorithms is presented. In dynamic multi-objective problems, the objective functions, the constraints and hence, also the solutions, can change over time and usually ...
Multi-Objective Optimisation Problems: A Symbolic Algorithm for Performance Measurement of Evolutionary Computing Techniques
EMO '09: Proceedings of the 5th International Conference on Evolutionary Multi-Criterion OptimizationIn this paper, a symbolic algorithm for solving constrained multi-objective optimisation problems is proposed. It is used to get the Pareto optimal solutions as functions of KKT multipliers $\overrightarrow{\lambda}$ for multi-objective problems with ...
Comments