{"type":"ScholarlyArticle","title":"A General Approach to Running Time Analysis of Multi-objective Evolutionary Algorithms","authors":[{"name":"Chao Bian","slug":"chao-bian","given":"Chao","family":"Bian","affiliation":"Anhui Province Key Lab of Big Data Analysis and Application , University of Science and Technology of China , Hefei 230027 , China"},{"name":"Chao Qian","slug":"chao-qian","given":"Chao","family":"Qian","affiliation":"Anhui Province Key Lab of Big Data Analysis and Application , University of Science and Technology of China , Hefei 230027 , China"},{"name":"Ke Tang","slug":"ke-tang","given":"Ke","family":"Tang","affiliation":"Shenzhen Key Lab of Computational Intelligence , Department of Computer Science and Engineering , Southern University of Science and Technology , Shenzhen 518055 , China"}],"abstract":"Evolutionary algorithms (EAs) have been widely applied to solve multi-objective optimization problems. In contrast to great practical successes, their theoretical foundations are much less developed, even for the essential theoretical aspect, i.e., running time analysis. In this paper, we propose a general approach to estimating upper bounds on the expected running time of multi-objective EAs (MOEAs), and then apply it to diverse situations, including bi-objective and many-objective optimization as well as exact and approximate analysis. For some known asymptotic bounds, our analysis not only provides their leading constants, but also improves them asymptotically. Moreover, our results provide some theoretical justification for the good empirical performance of MOEAs in solving multi-objective combinatorial problems.","doi":"10.24963/ijcai.2018/195","url":"https://ijcai.org/proceedings/2018/195","pdf":"https://ijcai.org/proceedings/2018/0195.pdf","markdown":"https://ijcai.org/proceedings/2018/195.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/195","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Heuristic Search and Game Playing","track":"Main track","number":195,"pages":{"first":1405,"last":1411},"keywords":["Heuristic Search and Game Playing: Combinatorial Search and Optimisation","Heuristic Search and Game Playing: Heuristic Search"],"videos":[],"references":[{"position":1,"raw":"[Auger and Doerr, 2011] A. Auger and B. Doerr. Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific, Singapore, 2011.","title":"Theory of Randomized Search Heuristics: Foundations and Recent Developments","authors":"A Auger, B Doerr","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bäck, 1996] T. Bäck. Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Pro- gramming, Genetic Algorithms. Oxford University Press, Oxford, UK, 1996.","title":"Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms","authors":"T Bäck","year":"1996","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Coello Coello and Lamont, 2004] C. A. Coello Coello and G. B. Lamont. Applications of Multi-Objective Evolution- ary Algorithms. World Scientific, Singapore, 2004.","title":"Applications of Multi-Objective Evolutionary Algorithms","authors":"C A Coello Coello, G B Lamont","year":"2004","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Doerr et al., 2013] B. Doerr, B. Kodric, and M. Voigt. Lower bounds for the runtime of a global multi-objective evolutionary algorithm. In CEC, pages 432-439, 2013.","title":"Lower bounds for the runtime of a global multi-objective evolutionary algorithm","authors":"B Doerr, B Kodric, M Voigt","year":"2013","venue":"CEC","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Doerr et al., 2016] B. Doerr, W. Gao, and F. Neumann. Runtime analysis of evolutionary diversity maximization for ONEMINMAX. In GECCO, pages 557-564, 2016.","title":"Runtime analysis of evolutionary diversity maximization for ONEMINMAX","authors":"B Doerr, W Gao, F Neumann","year":"2016","venue":"GECCO","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Droste et al., 2002] S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoret- ical Computer Science, 276(1-2):51-81, 2002.","title":"On the analysis of the (1+1) evolutionary algorithm","authors":"S Droste, T Jansen, I Wegener","year":"2002","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Friedrich et al., 2010] T. Friedrich, N. Hebbinghaus, and F. Neumann. Plateaus can be harder in multi-objective optimization. Theoretical Computer Science, 411(6):854- 864, 2010.","title":"Plateaus can be harder in multi-objective optimization","authors":"T Friedrich, N Hebbinghaus, F Neumann","year":"2010","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Friedrich et al., 2011] T. Friedrich, C. Horoba, and F. Neu- mann. Illustration of fairness in evolutionary multi- objective optimization. Theoretical Computer Science, 412(17):1546-1556, 2011.","title":"Illustration of fairness in evolutionary multiobjective optimization","authors":"T Friedrich, C Horoba, F Neumann","year":"2011","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Giel and Lehre, 2010] O. Giel and P. K. Lehre. On the ef- fect of populations in evolutionary multi-objective optimi- sation. Evolutionary Computation, 18(3):335-356, 2010.","title":"On the effect of populations in evolutionary multi-objective optimisation","authors":"O Giel, P K Lehre","year":"2010","venue":"Evolutionary Computation","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Giel, 2003] O. Giel. Expected runtimes of a simple multi- objective evolutionary algorithm. In CEC, pages 1918- 1925, 2003.","title":"Expected runtimes of a simple multiobjective evolutionary algorithm","authors":"O Giel","year":"2003","venue":"CEC","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Horoba, 2009] C. Horoba. Analysis of a simple evolution- ary algorithm for the multiobjective shortest path problem. In FOGA, pages 113-120, 2009.","title":"Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem","authors":"C Horoba","year":"2009","venue":"FOGA","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Ishibuchi et al., 2015] H. Ishibuchi, N. Akedo, and Y. No- jima. Behavior of multiobjective evolutionary algorithms on many-objective knapsack problems. IEEE Transactions on Evolutionary Computation, 19(2):264-283, 2015.","title":"Behavior of multiobjective evolutionary algorithms on many-objective knapsack problems","authors":"H Ishibuchi, N Akedo, Y Nojima","year":"2015","venue":"IEEE Transactions on Evolutionary Computation","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Laumanns et al., 2004] M. Laumanns, L. Thiele, and E. Zit- zler. Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions. IEEE Transac- tions on Evolutionary Computation, 8(2):170-182, 2004.","title":"Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions","authors":"M Laumanns, L Thiele, E Zitzler","year":"2004","venue":"IEEE Transactions on Evolutionary Computation","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Neumann and Theile, 2010] F. Neumann and M. Theile. How crossover speeds up evolutionary algorithms for the multi-criteria all-pairs-shortest-path problem. In PPSN, pages 667-676, 2010.","title":"How crossover speeds up evolutionary algorithms for the multi-criteria all-pairs-shortest-path problem","authors":"F Neumann, M Theile","year":"2010","venue":"PPSN","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Neumann and Witt, 2010] F. Neumann and C. Witt. Bioin- spired Computation in Combinatorial Optimization: Al- gorithms and Their Computational Complexity. Springer- Verlag, Berlin, Germany, 2010.","title":"Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity","authors":"F Neumann, C Witt","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Neumann, 2007] F. Neumann. Expected runtimes of a sim- ple evolutionary algorithm for the multi-objective mini- mum spanning tree problem. European Journal of Op- erational Research, 181(3):1620-1629, 2007.","title":"Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem","authors":"F Neumann","year":"2007","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Neumann, 2012] F. Neumann. Computational complex- ity analysis of multi-objective genetic programming. In GECCO, pages 799-806, 2012.","title":"Computational complexity analysis of multi-objective genetic programming","authors":"F Neumann","year":"2012","venue":"GECCO","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Osuna et al., 2017] E. C. Osuna, W. Gao, F. Neumann, and D. Sudholt. Speeding up evolutionary multi-objective op- timisation through diversity-based parent selection. In GECCO, pages 553-560, 2017.","title":"Speeding up evolutionary multi-objective optimisation through diversity-based parent selection","authors":"E C Osuna, W Gao, F Neumann, D Sudholt","year":"2017","venue":"GECCO","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Qian et al., 2013] C. Qian, Y. Yu, and Z.-H. Zhou. An anal- ysis on recombination in multi-objective evolutionary op- timization. Artificial Intelligence, 204:99-119, 2013.","title":"An analysis on recombination in multi-objective evolutionary optimization","authors":"C Qian, Y Yu, Z.-H Zhou","year":"2013","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Qian et al., 2016] C. Qian, K. Tang, and Z.-H. Zhou. Se- lection hyper-heuristics can provably be helpful in evolu- tionary multi-objective optimization. In PPSN, pages 835- 846, 2016.","title":"Selection hyper-heuristics can provably be helpful in evolutionary multi-objective optimization","authors":"C Qian, K Tang, Z.-H Zhou","year":"2016","venue":"PPSN","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Yu et al., 2015] Y. Yu, C. Qian, and Z.-H. Zhou. Switch analysis for running time analysis of evolutionary algo- rithms. IEEE Transactions on Evolutionary Computation, 19(6):777-792, 2015.","title":"Switch analysis for running time analysis of evolutionary algorithms","authors":"Y Yu, C Qian, Z.-H Zhou","year":"2015","venue":"IEEE Transactions on Evolutionary Computation","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Zhou and Gen, 1999] G. Zhou and M. Gen. Genetic algo- rithm approach on multi-criteria minimum spanning tree problem. European Journal of Operational Research, 114(1):141-152, 1999.","title":"Genetic algorithm approach on multi-criteria minimum spanning tree problem","authors":"G Zhou, M Gen","year":"1999","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}