{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:08:40Z","timestamp":1740136120233,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T00:00:00Z","timestamp":1595376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T00:00:00Z","timestamp":1595376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100008885","name":"Lloyd\u2019s Register Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008885","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2022,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The growing interest in dynamic optimisation has accelerated the development of genetic algorithms with specific mechanisms for these problems. To ensure that these developed mechanisms are capable of solving a wide range of practical problems it is important to have a diverse set of benchmarking functions to ensure the selection of the most appropriate Genetic Algorithm. However, the currently available benchmarking sets are limited to unconstrained problems with predominantly continuous characteristics. In this paper, the existing range of dynamic problems is extended with 15 novel constrained multi-objective functions. To determine how genetic algorithms perform on these constrained problems, and how this behaviour relates to unconstrained dynamic optimisation, 6 top-performing dynamic genetic algorithms are compared alongside 4 re-initialization strategies on the proposed test set, as well as the currently existing unconstrained cases. The results show that there are no differences between constrained\/unconstrained optimisation, in contrast to the static problems. Therefore, dynamicity is the prevalent characteristic of these problems, which is shown to be more important than the discontinuous nature of the search and objective spaces. The best performing algorithm overall is MOEA\/D, and VP is the best re-initialisation strategy. It is demonstrated that there is a need for more dynamic specific methodologies with high convergence, as it is more important to performance on dynamic problems than diversity.<\/jats:p>","DOI":"10.1007\/s11047-020-09799-y","type":"journal-article","created":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T08:09:31Z","timestamp":1595405371000},"page":"109-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Benchmarking the performance of genetic algorithms on constrained dynamic problems"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0635-3125","authenticated-orcid":false,"given":"P. A.","family":"Grudniewski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. J.","family":"Sobey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,22]]},"reference":[{"key":"9799_CR1","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.swevo.2017.10.005","volume":"39","author":"R Azzouz","year":"2018","unstructured":"Azzouz R, Bechikh S, Said LB, Trabelsi W (2018) Handling time-varying constraints and objectives in dynamic evolutionary multi-objective optimization. Swarm Evol Comput 39:222\u2013248. https:\/\/doi.org\/10.1016\/j.swevo.2017.10.005","journal-title":"Swarm Evol Comput"},{"issue":"14","key":"9799_CR2","doi-asserted-by":"publisher","first-page":"6235","DOI":"10.1016\/j.eswa.2014.04.003","volume":"41","author":"A Bagheri","year":"2014","unstructured":"Bagheri A, Mohammadi Peyhani H, Akbari M (2014) Financial forecasting using ANFIS networks with quantum-behaved particle swarm optimization. Expert Syst Appl 41(14):6235\u20136250. https:\/\/doi.org\/10.1016\/j.eswa.2014.04.003","journal-title":"Expert Syst Appl"},{"key":"9799_CR3","doi-asserted-by":"crossref","unstructured":"Biswas S, Das S, Suganthan PN, Coello Coello CA (2014) Evolutionary multiobjective optimization in dynamic environments: a set of novel benchmark functions. In: 2014 IEEE congress on evolutionary computation (CEC 2014), vol 1, pp 3192\u20133199. https:\/\/doi.org\/10.1109\/CEC.2014.6900487","DOI":"10.1109\/CEC.2014.6900487"},{"issue":"2","key":"9799_CR4","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/TEVC.2003.810761","volume":"7","author":"PA Bosman","year":"2003","unstructured":"Bosman PA, Thierens D (2003) The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Trans Evol Comput 7(2):174\u2013188. https:\/\/doi.org\/10.1109\/TEVC.2003.810761","journal-title":"IEEE Trans Evol Comput"},{"key":"9799_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0911-0","volume-title":"Evolutionary optimization in dynamic environments","author":"J Branke","year":"2002","unstructured":"Branke J (2002) Evolutionary optimization in dynamic environments. Kluwer Academic Publishers, Norwell. https:\/\/doi.org\/10.1007\/978-1-4615-0911-0"},{"issue":"2","key":"9799_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evol Comput"},{"key":"9799_CR7","doi-asserted-by":"crossref","unstructured":"Deb K, Rao N UB, Karthik S (2007) Dynamic multi-objective optimization and decision-making using modified NSGA-II: a case study on hydro-thermal power scheduling. In: Evolutionary multi-criterion optimization, pp 803\u2013817. https:\/\/doi.org\/10.1007\/978-3-540-70928-2","DOI":"10.1007\/978-3-540-70928-2_60"},{"key":"9799_CR8","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.compchemeng.2017.01.012","volume":"99","author":"S Effendy","year":"2017","unstructured":"Effendy S, Khan MS, Farooq S, Karimi IA (2017) Dynamic modelling and optimization of an LNG storage tank in a regasification terminal with semi-analytical solutions for N2-free LNG. Comput Chem Eng 99:40\u201350. https:\/\/doi.org\/10.1016\/j.compchemeng.2017.01.012","journal-title":"Comput Chem Eng"},{"issue":"5","key":"9799_CR9","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/TEVC.2004.831456","volume":"8","author":"M Farina","year":"2004","unstructured":"Farina M, Deb K, Amato P (2004) Dynamic multiobjective optimization problems: test cases, approximations, and applications. IEEE Trans Evol Comput 8(5):425\u2013442. https:\/\/doi.org\/10.1109\/TEVC.2004.831456","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"9799_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1109\/TEVC.2008.920671","volume":"13","author":"CK Goh","year":"2009","unstructured":"Goh CK, Tan KC (2009) A competitive-cooperative coevolutionary paradigm for dynamic multiobjective optimization. IEEE Trans Evol Comput 13(1):103\u2013127. https:\/\/doi.org\/10.1109\/TEVC.2008.920671","journal-title":"IEEE Trans Evol Comput"},{"key":"9799_CR11","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1016\/j.swevo.2018.09.005","volume":"44","author":"PA Grudniewski","year":"2018","unstructured":"Grudniewski PA, Sobey AJ (2018) Behaviour of multi-level selection genetic algorithm (MLSGA) using different individual-level selection mechanisms. Swarm Evol Comput 44:852\u2013862. https:\/\/doi.org\/10.1016\/j.swevo.2018.09.005","journal-title":"Swarm Evol Comput"},{"key":"9799_CR12","doi-asserted-by":"crossref","unstructured":"Hatzakis I, Wallace D (2006) Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach. In: Proceedings of the 8th annual conference on genetic and evolutionary computation, pp 1201\u20131208. https:\/\/doi.org\/10.1145\/1143997.1144187","DOI":"10.1145\/1143997.1144187"},{"issue":"3","key":"9799_CR13","doi-asserted-by":"publisher","first-page":"37:1","DOI":"10.1145\/2517649","volume":"46","author":"M Helbig","year":"2014","unstructured":"Helbig M, Engelbrecht AP (2014) Benchmarks for dynamic multi-objective optimisation algorithms. ACM Comput Surv 46(3):37:1\u201337:39. https:\/\/doi.org\/10.1145\/2517649","journal-title":"ACM Comput Surv"},{"key":"9799_CR14","unstructured":"Helbig M, Engelbrecht AP (2015) Benchmark functions for CEC 2015 special session and competition on dynamic multi-objective optimization. Technical report"},{"issue":"1","key":"9799_CR15","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TCYB.2015.2510698","volume":"47","author":"S Jiang","year":"2017","unstructured":"Jiang S, Yang S (2017) Evolutionary dynamic multiobjective optimization: benchmarks and algorithm comparisons. IEEE Trans Cybern 47(1):198\u2013211. https:\/\/doi.org\/10.1109\/TCYB.2015.2510698","journal-title":"IEEE Trans Cybern"},{"key":"9799_CR16","unstructured":"Li C, Yang S, Pelta DA (2011) Benchmark generator for the IEEE WCCI-2012 competition on evolutionary computation for dynamic optimization problems. Technical report. https:\/\/doi.org\/10.13140\/RG.2.1.3298.1842"},{"issue":"5","key":"9799_CR17","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TEVC.2015.2504730","volume":"20","author":"M Li","year":"2016","unstructured":"Li M, Yang S, Liu X (2016) Pareto or non-Pareto: bi-criterion evolution in multiobjective optimization. IEEE Trans Evol Comput 20(5):645\u2013665. https:\/\/doi.org\/10.1109\/TEVC.2015.2504730","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"9799_CR18","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1109\/TEVC.2015.2512930","volume":"20","author":"Q Lin","year":"2016","unstructured":"Lin Q, Chen J, Zhan ZH, Chen WN, Coello Coello CA, Yin Y, Lin CM, Zhang J (2016) A hybrid evolutionary immune algorithm for multiobjective optimization problems. IEEE Trans Evol Comput 20(5):711\u2013729. https:\/\/doi.org\/10.1109\/TEVC.2015.2512930","journal-title":"IEEE Trans Evol Comput"},{"key":"9799_CR19","unstructured":"Mehnen J, Wagner T, Rudolph G (2006) Evolutionary optimization of dynamic multi-objective test functions. Technical report. https:\/\/doi.org\/10.17877\/DE290R-631, http:\/\/laral.istc.cnr.it\/wiva3\/atti\/gsice2\/papers\/GSICE06_09_Wagner.pdf, arXiv:1310.2674"},{"key":"9799_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.05.001","volume":"6","author":"TT Nguyen","year":"2012","unstructured":"Nguyen TT, Yang S, Branke J (2012) Evolutionary dynamic optimization: a survey of the state of the art. Swarm Evol Comput 6:1\u201324. https:\/\/doi.org\/10.1016\/j.swevo.2012.05.001","journal-title":"Swarm Evol Comput"},{"issue":"5","key":"9799_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1088\/1748-3190\/aad2e8","volume":"13","author":"AJ Sobey","year":"2018","unstructured":"Sobey AJ, Grudniewski PA (2018) Re-inspiring the genetic algorithm with multi-level selection theory: multi-level selection genetic algorithm. Bioinspir. Biomim. 13(5):1\u201313. https:\/\/doi.org\/10.1088\/1748-3190\/aad2e8","journal-title":"Bioinspir. Biomim."},{"key":"9799_CR22","doi-asserted-by":"crossref","unstructured":"Tseng LY, Chen C (2009) Multiple trajectory search for unconstrained\/constrained multi-objective optimization. In: 2009 IEEE congress on evolutionary computation (CEC 2009), pp 1951\u20131958. https:\/\/doi.org\/10.1109\/CEC.2009.4983179","DOI":"10.1109\/CEC.2009.4983179"},{"issue":"1","key":"9799_CR23","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/TEVC.2010.2077298","volume":"16","author":"L While","year":"2012","unstructured":"While L, Bradstreet L, Barone L (2012) A fast way of calculating exact hypervolumes. IEEE Trans Evol Comput 16(1):86\u201395. https:\/\/doi.org\/10.1109\/TEVC.2010.2077298","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"9799_CR24","first-page":"159","volume":"14","author":"L Wismans","year":"2014","unstructured":"Wismans L, Van Berkum E, Bliemer M (2014) Handling multiple objectives in optimization of externalities as objectives for dynamic traffic management. Eur J Transp Infrastruct Res 14(2):159\u2013177","journal-title":"Eur J Transp Infrastruct Res"},{"issue":"2","key":"9799_CR28","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1016\/j.asoc.2007.07.005","volume":"8","author":"Z Zhang","year":"2008","unstructured":"Zhang Z (2008) Multiobjective optimization immune algorithm in dynamic environments and its application to greenhouse control. Appl Soft Comput J 8(2):959\u2013971. https:\/\/doi.org\/10.1016\/j.asoc.2007.07.005","journal-title":"Appl Soft Comput J"},{"issue":"6","key":"9799_CR25","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731. https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Trans Evol Comput"},{"key":"9799_CR26","unstructured":"Zhang Q, Suganthan PN (2009) Final report on CEC \u2019 09 MOEA competition. Technical report. http:\/\/dces.essex.ac.uk\/staff\/zhang\/moeacompetition09.htm"},{"key":"9799_CR27","unstructured":"Zhang Q, Zhou A, Zhao S, Suganthan PN, Liu W (2009) Multiobjective optimization test instances for the CEC 2009 special session and competition. Technical report"},{"key":"9799_CR29","doi-asserted-by":"crossref","unstructured":"Zhou A, Jin Y, Zhang Q, Sendhoff B, Tsang E (2007) Prediction-based population re-initialization for evolutionary dynamic multi-objective optimization. In: Evolutionary multi-criterion optimization. Springer, Berlin, pp 832\u2013846. https:\/\/doi.org\/10.1007\/978-3-540-70928-2_62","DOI":"10.1007\/978-3-540-70928-2_62"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-020-09799-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-020-09799-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-020-09799-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T10:27:35Z","timestamp":1647426455000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-020-09799-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,22]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["9799"],"URL":"https:\/\/doi.org\/10.1007\/s11047-020-09799-y","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2020,7,22]]},"assertion":[{"value":"3 July 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}