{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T23:20:53Z","timestamp":1784244053526,"version":"3.55.0"},"reference-count":286,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T00:00:00Z","timestamp":1601942400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T00:00:00Z","timestamp":1601942400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10462-020-09906-6","type":"journal-article","created":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T22:03:03Z","timestamp":1602021783000},"page":"2323-2409","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":253,"title":["Performance assessment of the metaheuristic optimization algorithms: an exhaustive review"],"prefix":"10.1007","volume":"54","author":[{"given":"A. Hanif","family":"Halim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"I.","family":"Ismail","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6843-4508","authenticated-orcid":false,"given":"Swagatam","family":"Das","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,10,6]]},"reference":[{"key":"9906_CR1","doi-asserted-by":"crossref","unstructured":"Abouhawwash M, Jameel MA (2019) In: Proceeding on 10th international conference EMO 2019. Springer, East Lansing, Mi, USA, pp 27\u201338","DOI":"10.1007\/978-3-030-12598-1_3"},{"key":"9906_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2015\/936106","volume":"936106","author":"O Adekanmbi","year":"2015","unstructured":"Adekanmbi O, Green P (2015) Conceptual comparison of population-based metaheuristics for engineering problems. Sci World J 936106:1\u20139","journal-title":"Sci World J"},{"key":"9906_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal AP, Kaur A (2016) An empirical evaluation of three popular meta-heuristics for solving travelling salesman problem. In: 6th International conference\u2014cloud system and big data engineering (Confluence). Noida, India, pp 16\u201321","DOI":"10.1109\/CONFLUENCE.2016.7508040"},{"key":"9906_CR4","doi-asserted-by":"crossref","first-page":"105887","DOI":"10.1016\/j.asoc.2019.105887","volume":"86","author":"MAH Akhand","year":"2020","unstructured":"Akhand MAH, Ayon SI, Shahriyar SA, Siddique N, Adeli H (2020) Discrete spider monkey optimization for travelling salesman problem. Appl Soft Comput J 86:105887","journal-title":"Appl Soft Comput J"},{"key":"9906_CR5","doi-asserted-by":"crossref","first-page":"100607","DOI":"10.1016\/j.swevo.2019.100607","volume":"52","author":"IM Ali","year":"2020","unstructured":"Ali IM, Essam D, Kasmarik K (2020) A novel design of differential evolution for solving discrete travelling salesman problems. Swarm Evol Comput 52:100607","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"9906_CR6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF00197287","volume":"65","author":"BK Ambati","year":"1991","unstructured":"Ambati BK, Ambati J, Mokhtar MM (1991) Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial-time algorithm for the traveling salesman problem. Biol Cybern 65(1):31\u201335","journal-title":"Biol Cybern"},{"key":"9906_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2018\/8237925","volume":"8237925","author":"C Araya-Sassi","year":"2018","unstructured":"Araya-Sassi C, Miranda PA, Paredes-Belmar G (2018) Lagrangian relaxation for an inventory location problem with periodic inventory control and stochastic capacity constraints. Math Probl Eng 8237925:1\u201327","journal-title":"Math Probl Eng"},{"key":"9906_CR8","doi-asserted-by":"crossref","unstructured":"Asafuddoula M, Ray T, Singh H (2015) Characterizing Pareto front approximations in many-objective optimization. In: Proceedings of the 2015 annual conference on genetic and evolutionary computation. ACM, pp 607\u2013614","DOI":"10.1145\/2739480.2754701"},{"key":"9906_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.compstruc.2016.03.001","volume":"169","author":"A Askarzadeh","year":"2016","unstructured":"Askarzadeh A (2016) A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm. Comput Struct 169:1\u201312","journal-title":"Comput Struct"},{"key":"9906_CR10","unstructured":"Aspnes J (2017) Notes on computational complexity theory CPSC 468\/568 ch. 9. pp 58\u201359"},{"key":"9906_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2020\/3504642","volume":"3504642","author":"I Attiya","year":"2020","unstructured":"Attiya I, Elaziz MA, Xiong S (2020) Job scheduling in cloud computing using a modified harris hawks optimization and simulated annealing algorithm. Comput Intell Neurosci 3504642:1\u201317","journal-title":"Comput Intell Neurosci"},{"key":"9906_CR12","unstructured":"Audet C, Bigeon J, Cartier D, Le Digabel S, Salomon L (2018) Performance indicators in multiobjective optimization. Optimization Online. Retrieved from http:\/\/www.optimization-online.org\/DB_HTML\/2018\/10\/6887.html"},{"key":"9906_CR13","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/j.engappai.2006.01.010","volume":"19","author":"OB Augusto","year":"2006","unstructured":"Augusto OB, Rabeau S, D\u00e9pince Ph, Bennis F (2006) Multi-objective genetic algorithms: a way to improve the convergence rate. Eng Appl Artif Intell 19:501\u2013510","journal-title":"Eng Appl Artif Intell"},{"key":"9906_CR14","unstructured":"Awad NH, Ali MZ, Suganthan PN, Liang JJ, Qu BY (2016) Problem definitions and evaluation criteria for the CEC 2017 special session and competition on single objective real-parameter numerical optimization. Technical report"},{"issue":"1","key":"9906_CR15","first-page":"232","volume":"3","author":"NAA Aziz","year":"2014","unstructured":"Aziz NAA, Mubin M, Ibrahim Z, Nawawi SW (2014) Performance and diversity of gravitational search algorithm. Adv Appl Converg Lett 3(1):232\u2013235","journal-title":"Adv Appl Converg Lett"},{"key":"9906_CR16","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms","author":"T Back","year":"1996","unstructured":"Back T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, Oxford"},{"issue":"1","key":"9906_CR17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1162\/EVCO_a_00009","volume":"19","author":"J Bader","year":"2011","unstructured":"Bader J, Zitzler E (2011) HypE: an algorithm for fast hypervolume-based many-objective optimization. Evol Comput 19(1):45\u201376","journal-title":"Evol Comput"},{"key":"9906_CR18","unstructured":"Bahameish HA (2014) Finding a cost effective LNG annual delivery program (ADP) using genetic algorithms. Master\u2019s thesis, Qatar University"},{"key":"9906_CR19","doi-asserted-by":"crossref","unstructured":"Balogh J, B\u00e9k\u00e9si J, D\u00f3sa G, Sgall J, Stee R (2015) The optimal absolute ratio for online bin packing. In: SODA\u201915 Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. Philadelphia, USA, pp 1425\u20131438","DOI":"10.1137\/1.9781611973730.94"},{"key":"9906_CR20","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02430363","volume":"1","author":"RS Barr","year":"1995","unstructured":"Barr RS, Golden BL, Kelly JP, Resende MG, Steward WR (1995) Designing and reporting on computational experiments with heuristic methods. J Heuristics 1:9\u201332","journal-title":"J Heuristics"},{"key":"9906_CR21","unstructured":"Bartz-Beielstein T (2005) New experimentalism applied to evolutionary computation. Ph.D. dissertation, Universitaet Dortmund, Fachbereich Informatik"},{"issue":"11","key":"9906_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1590\/1679-78255018","volume":"15","author":"M Bassi","year":"2018","unstructured":"Bassi M, Cursi ES, Pagnacco E, Ellaia R (2018) Statistics of the Pareto front in multi-objective optimization under uncertainties. Latin Am J Solids Struct 15(11):1\u201318","journal-title":"Latin Am J Solids Struct"},{"issue":"4","key":"9906_CR23","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1007\/s11081-017-9366-1","volume":"18","author":"V Beiranvand","year":"2017","unstructured":"Beiranvand V, Hare W, Lucet Y (2017) Best practices for comparing optimization algorithms. Optim Eng 18(4):815\u2013848","journal-title":"Optim Eng"},{"key":"9906_CR24","unstructured":"Benavoli A, Mangili F, Corani G, Zaffalon M, Ruggeri F (2014) A Bayesian Wilcoxon signed-rank test based on the Dirichlet process. In: Proceedings of the 30th international conference on machine learning (ICML 2014). pp 1\u20139"},{"key":"9906_CR25","volume-title":"Interior-point methods for nonconvex nonlinear programming: jamming and comparative numerical testing, technical report ORFE-00-02","author":"HY Benson","year":"2000","unstructured":"Benson HY, Shanno DF, Vanberei RJ (2000) Interior-point methods for nonconvex nonlinear programming: jamming and comparative numerical testing, technical report ORFE-00-02. Princeton University, Princeton"},{"key":"9906_CR26","doi-asserted-by":"crossref","unstructured":"Bezerra LC, Ib\u00e1nez ML, Stuetzel T (2017) An empirical assesment of the properties of inverted generational distance on multi- and many-objective optimization. In: EMO international conferecne on evolutionary multicriterion optimization. Springer, Muenster, Germany, pp 31\u201345","DOI":"10.1007\/978-3-319-54157-0_3"},{"key":"9906_CR27","doi-asserted-by":"crossref","unstructured":"Bhattacharjee KS, Singh HK, Ray T (2016) A study on performance metrics to identify of interest from a trade-off set. In: Proceedings of the second Australasian conference on artificial life and computational intelligence, vol 9592. Springer, pp 66\u201377","DOI":"10.1007\/978-3-319-28270-1_6"},{"issue":"1","key":"9906_CR28","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1023\/A:1008632215341","volume":"7","author":"SC Billups","year":"1997","unstructured":"Billups SC, Dirkse SP, Ferris MC (1997) A comparison of large scale mixed complementary problem solvers. Comput Optim Appl 7(1):3\u201325","journal-title":"Comput Optim Appl"},{"issue":"4","key":"9906_CR29","first-page":"552","volume":"29","author":"MJ Blanca","year":"2017","unstructured":"Blanca MJ, Alarc\u00f3n R, Arnau J, Bono R, Bendayan R (2017) Non-normal data: Is ANOVA still a valid option? Psicothema 29(4):552\u2013557","journal-title":"Psicothema"},{"key":"9906_CR30","first-page":"51","volume":"23","author":"JM Bogoya","year":"2018","unstructured":"Bogoya JM, Vargas A, Cuate O, Sch\u00fctze O (2018) A (p, q)-averaged Hausdorf distance for arbitrary measurable sets. Math Comput Appl 23:51","journal-title":"Math Comput Appl"},{"key":"9906_CR31","unstructured":"Boluf\u00e9 AR, Gonz\u00e1lez SF, Chen S (2015) A minimum population search hybrid for large scale global optimization. In: IEEE congress on evolutionary computation (CEC). Sendai, pp 1958\u20131965"},{"key":"9906_CR32","unstructured":"Bongartz I, Conn AR, Gould NIM, Saunders MA, Toint PL (1997) A numerical comparison between the LANCELOT and MINOS packages for large-scale numerical optimization. Technical report 97\/13, Namur University"},{"key":"9906_CR33","doi-asserted-by":"crossref","unstructured":"Bonyandi MR, Michalewicz Z, Barone L (2013) The travelling thief problem: the first step in the transition from theoretical problems to realistic problems. In: IEEE congress on evolutionary computation. Cancun, pp 1037\u20131044","DOI":"10.1109\/CEC.2013.6557681"},{"key":"9906_CR34","doi-asserted-by":"crossref","unstructured":"Bonyandi MR, Michalewicz Z, Przybylek MR, Wierbicki A (2014) Socially inspired algorithms for the travelling thief problem. In: GECCO\u201914 proceedings of the 2014 annual conference on genetic and evolutionary computation. pp 421\u2013428","DOI":"10.1145\/2576768.2598367"},{"key":"9906_CR35","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.eswa.2018.12.044","volume":"122","author":"U Boryczka","year":"2019","unstructured":"Boryczka U, Szwarc K (2019) The harmony search algorithm with additional improvement of harmony memory for asymmetric travelling salesman problem. Expert Syst Appl 122:43\u201353","journal-title":"Expert Syst Appl"},{"issue":"3","key":"9906_CR36","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1287\/opre.1090.0766","volume":"58","author":"B Bozkurt","year":"2010","unstructured":"Bozkurt B, Fowler JW, Gel ES, Kim B, K\u00f6ksalan M, Wallenius J (2010) Quantitative comparison of approximate solution sets for multicriteria optimization problems with weighted Tchebycheff preference function. Oper Res 58(3):650\u2013659","journal-title":"Oper Res"},{"key":"9906_CR37","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-1-4615-0911-0_2","volume-title":"Evolutionary optimization in dynamic environments","author":"J Branke","year":"2002","unstructured":"Branke J (2002) Evolutionary optimization in dynamic environments. Springer, New York, pp 13\u201329"},{"issue":"6\u20137","key":"9906_CR38","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1016\/j.comgeo.2010.03.004","volume":"43","author":"K Bringmann","year":"2010","unstructured":"Bringmann K, Friedrich T (2010) Approximating the volume of unions and intersections of high-dimensional geometric objects. Comput Geom 43(6\u20137):601\u2013610","journal-title":"Comput Geom"},{"key":"9906_CR39","volume-title":"Evolutionary multi-criterion optimization. EMO 2017 Lecture notes in computer science, 10173","author":"D Brockhoff","year":"2017","unstructured":"Brockhoff D, Auger A, Hansen N, Tu\u0161ar T (2017) Quantitative performance assesment of multiobjective optimizers: the average runtime attainment function. In: Trautman H et al (eds) Evolutionary multi-criterion optimization. EMO 2017 Lecture notes in computer science, 10173. Springer, Cham"},{"key":"9906_CR40","unstructured":"Brownlee J (2011) Clever algorithms: nature-inspired programming recipes. Lulu, pp 404\u2013405"},{"key":"9906_CR41","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/j.ins.2017.11.051","volume":"430","author":"X Cai","year":"2018","unstructured":"Cai X, Sun H, Fan Z (2018) A diversity indicator based on reference vectors for many-objective optimization. Inf Sci 430:467\u2013486","journal-title":"Inf Sci"},{"key":"9906_CR42","doi-asserted-by":"crossref","unstructured":"Calvo B, Shir OM, Ceberio J, Doerr C, Wang H, B\u00e4ck T, Lozano JA (2019) Bayesian performance analysis for black-box optimization benchmarking. In: proceedings of the genetic and evolutionary computation conference companion, GECCO 19, ACM, New York, NY, USA pp 1789\u20131797","DOI":"10.1145\/3319619.3326888"},{"key":"9906_CR43","doi-asserted-by":"crossref","first-page":"113229","DOI":"10.1016\/j.eswa.2020.113229","volume":"148","author":"G Campuzano","year":"2020","unstructured":"Campuzano G, Obreque C, Aguayo MM (2020) Accelerating the Miller\u2013Tucker\u2013Zemlin model for the asymmetric travelling salesman problem. Expert Syst Appl 148:113229","journal-title":"Expert Syst Appl"},{"issue":"2","key":"9906_CR44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3376916","volume":"53","author":"JGF Cardona","year":"2020","unstructured":"Cardona JGF, Coello CAC (2020) Indicator-based multi-objective evolutionary algorithms: a comprehensive survey. ACM Comput Surv 53(2):1\u201335","journal-title":"ACM Comput Surv"},{"issue":"1","key":"9906_CR45","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1111\/1540-5915.02254","volume":"34","author":"WM Carlyle","year":"2003","unstructured":"Carlyle WM, Fowler JW, Gel ES, Kim B (2003) Quantitative comparison of approximation solution sets for bi-criteria optimization problems. Decis Sci 34(1):63\u201382","journal-title":"Decis Sci"},{"key":"9906_CR46","doi-asserted-by":"crossref","unstructured":"Carrasco J, Garc\u00eda S, del Mar Rueda M, Herrera F (2017) rNPBST: an R package covering non-parametric and Bayesian statistical tests. In: International conferecne hybrid artificial intelligent systems. pp 281\u2013292","DOI":"10.1007\/978-3-319-59650-1_24"},{"key":"9906_CR47","doi-asserted-by":"crossref","first-page":"100665","DOI":"10.1016\/j.swevo.2020.100665","volume":"54","author":"J Carrasco","year":"2020","unstructured":"Carrasco J, Garc\u00eda S, Rueda M, Das S, Herrera F (2020) Recent trends in the use of statistical tests for comparing swarm and evolutionary computing algorithms: practical guidelines and a critical review. Swarm Evol Comput 54:100665","journal-title":"Swarm Evol Comput"},{"key":"9906_CR48","doi-asserted-by":"crossref","unstructured":"Chang KH (2015) Design theory and methods using CAD\/CAE. The computer aided engineering design series, Ch. 5\u2014multiobjective optimization and advanced topics. pp 325\u2013406","DOI":"10.1016\/B978-0-12-398512-5.00005-0"},{"issue":"2","key":"9906_CR49","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/TEVC.2009.2030331","volume":"14","author":"WN Chen","year":"2010","unstructured":"Chen WN, Zhang J, Chung HSH, Zhong WL, Wu WG, Shi YH (2010) A novel set-based particle swarm optimization method for discrete optimization problems. IEEE Trans Evol Comput 14(2):278\u2013300","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"9906_CR50","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1515\/jaiscr-2015-0001","volume":"4","author":"S Cheng","year":"2014","unstructured":"Cheng S, Shi Y, Qin Q, Zhang Q, Bai R (2014) Population diversity maintenance in brain storm optimization algorithm. J Artif Intell Soft Comput Res 4(2):83\u201397","journal-title":"J Artif Intell Soft Comput Res"},{"key":"9906_CR51","doi-asserted-by":"crossref","unstructured":"Chi Y, Sun F, Jiang L, Yu C (2012) An efficient population diversity measure for improved particle swarm optimization algorithm. In: 6th IEEE international conference intelligent systems. Sofia, Bulgaria, pp 361\u2013367","DOI":"10.1109\/IS.2012.6335243"},{"key":"9906_CR52","unstructured":"Chiarandini M, Paquete L, Preuss M, Ridge E (2007) Experiments on metaheuristics: methodological overview and open issues. Technical report DMF-2007-03-003, the Danish mathematical society, Denmark"},{"key":"9906_CR53","first-page":"10097","volume":"17","author":"G Chicco","year":"2019","unstructured":"Chicco G, Mazza A (2019) Heuristic optimization of electrical energy systems: refined metrics to compare the solutions. Sustain Energy Grids Netw 17:10097","journal-title":"Sustain Energy Grids Netw"},{"key":"9906_CR54","doi-asserted-by":"crossref","first-page":"1338","DOI":"10.1016\/j.apm.2013.08.009","volume":"38","author":"M Chih","year":"2014","unstructured":"Chih M, Lin CJ, Chern MS, Ou TY (2014) Particle swarm optimization with time-varying acceleration coefficients for the multimodal knapsack problem. Appl Math Mod. 38:1338\u20131350","journal-title":"Appl Math Mod."},{"key":"9906_CR55","doi-asserted-by":"publisher","unstructured":"Chopard B, Tomassini M (2018) Performance and limitations of metaheuristics. In: An introduction to metaheuristics for optimization. Natural computing series. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-93073-2_11","DOI":"10.1007\/978-3-319-93073-2_11"},{"key":"9906_CR56","doi-asserted-by":"crossref","unstructured":"Coello CA, Sierra MR (2004) A study of the parallelization of a coevolutionary multi-objective evolutionary algorithm. In: MICAI 2004: advances in artificial intelligence (LNCS 2972). Springer, Mexico City, pp 688\u2013697","DOI":"10.1007\/978-3-540-24694-7_71"},{"key":"9906_CR57","volume-title":"Evolutionary algorithms for solving multi-objective problems","author":"CA Coello","year":"2008","unstructured":"Coello CA, Lamont GB, Veldhuizen DAV (2008) Evolutionary algorithms for solving multi-objective problems, 2nd edn. Springer, New York","edition":"2"},{"key":"9906_CR58","doi-asserted-by":"crossref","unstructured":"Coello CA, Dhaenens C, Jourdan L (2010) Multi-objective combinatorial optimization: problematic and context. In: Advances in multi-objective nature inspired computing, SCI272. Springer, pp 1\u201321","DOI":"10.1007\/978-3-642-11218-8_1"},{"issue":"4","key":"9906_CR59","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.cor.2003.08.017","volume":"32","author":"Y Collette","year":"2005","unstructured":"Collette Y, Siarry P (2005) Three new metrics to measure the convergence of metaheuristics towards the Pareto frontier and the aesthetic of a set of solutions in biobjective optimization. Comput Oper Res 32(4):773\u2013792","journal-title":"Comput Oper Res"},{"key":"9906_CR60","first-page":"73","volume":"73","author":"AR Conn","year":"1996","unstructured":"Conn AR, Gould NIM, Toint PL (1996) Numerical experiments with the LANCELOT package (release a) for large-scale nonlinear optimization. Math Program 73:73\u2013110","journal-title":"Math Program"},{"key":"9906_CR61","volume-title":"Practical nonparametric statistics","author":"J Conover","year":"1980","unstructured":"Conover J (1980) Practical nonparametric statistics. Wiley, Hoboken"},{"issue":"2\u20133","key":"9906_CR62","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10994-015-5486-z","volume":"100","author":"G Corani","year":"2015","unstructured":"Corani G, Benavoli A (2015) A Bayesian approach for comparing cross-validated algorithms on multiple data sets. Mach Learn 100(2\u20133):285\u2013304","journal-title":"Mach Learn"},{"key":"9906_CR63","first-page":"47","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT Press, Cambridge, p 47"},{"key":"9906_CR64","doi-asserted-by":"crossref","unstructured":"Crainic TG, Mancini S, Perboli G, Tadei R (2011) Multi-start heuristics for the two-echelon vehicle routing problem. In: Merz P, Hao JK (eds) Evolutionary computation in combinatorial optimization. EvoCOP 2011. Lecture notes in computer science, vol 6622. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-20364-0_16"},{"key":"9906_CR65","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1016\/j.promfg.2020.01.348","volume":"39","author":"C Cubukcuoglu","year":"2019","unstructured":"Cubukcuoglu C, Tasgetiren MF, Sariyildiz IS, Gao L, Kucukvar M (2019) A memetic algorithm for the bi-objective quadratic assignment problem. Procedia Manuf 39:1215\u20131222","journal-title":"Procedia Manuf"},{"key":"9906_CR66","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1002\/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6","volume":"7","author":"P Czyzak","year":"1998","unstructured":"Czyzak P, Jaskiewicz A (1998) Pareto simulated annealing\u2014a metaheuristic technique for multiple-objective combinatorial optimization. J Multi-Criteria Decis Anal 7:34\u201347","journal-title":"J Multi-Criteria Decis Anal"},{"key":"9906_CR67","doi-asserted-by":"crossref","first-page":"113224","DOI":"10.1016\/j.eswa.2020.113224","volume":"148","author":"I Dahmani","year":"2020","unstructured":"Dahmani I, Hifi M, Saadi T, Yousef L (2020) A swarm optimization-based search algorithm for the quadratic knapsack problem with conflict graphs. Expert Syst Appl 148:113224","journal-title":"Expert Syst Appl"},{"key":"9906_CR68","unstructured":"Das S (2018) Evaluating the swarm intelligence algorithms for continuous optimization\u2014a (non-parametric) statistical perspective. In: ICSI, Shanghai, China"},{"issue":"3","key":"9906_CR69","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1109\/TEVC.2008.2009457","volume":"13","author":"S Das","year":"2009","unstructured":"Das S, Abraham A, Chakraborty UK, Konar A (2009) Differential evolution using a neighborhood-based mutation operator. IEEE Trans Evol Comput 13(3):526\u2013553","journal-title":"IEEE Trans Evol Comput"},{"key":"9906_CR70","series-title":"River Publishers series in signal, image and speech processing","volume-title":"Digital system design-use of microcontroller","author":"SD Dawoud","year":"2010","unstructured":"Dawoud SD, Peplow R (2010) Digital system design-use of microcontroller. River Publishers series in signal, image and speech processing. River Publishers, Gistrup"},{"key":"9906_CR71","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/j.compchemeng.2018.11.007","volume":"121","author":"L De Sousa Santos","year":"2019","unstructured":"De Sousa Santos L, Secchi AR, Prata DM, Biscaica EC Jr (2019) An adaptive sequential wavelet-based algorithm developed for dynamic optimization problems. Comput Chem Eng 121:465\u2013482","journal-title":"Comput Chem Eng"},{"issue":"11","key":"9906_CR72","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1080\/0305215X.2010.548863","volume":"43","author":"K Deb","year":"2011","unstructured":"Deb K, Gupta S (2011) Understanding knee points in bicriteria problems and their implications as preferred solutions principles. Eng Optim 43(11):1175\u20131204","journal-title":"Eng Optim"},{"key":"9906_CR73","unstructured":"Deb K, Jain S (2002) Running performance metrics for evolutionary multi-objective optimizations. In: Proceedings of the fourth Asia-pacific conference on simulated evolution and learning (SEAL\u201902). Singapore, pp 13\u201320"},{"issue":"2","key":"9906_CR74","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agrawal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"9906_CR75","doi-asserted-by":"crossref","first-page":"4288","DOI":"10.3390\/su11164288","volume":"11","author":"N Deepa","year":"2019","unstructured":"Deepa N, Vincent DR, Kumar SM, Srinivasan K, Chang CY, Bashir AK (2019) An efficient ensemble VTOPES multi-criteria decision-making model for sustainable sugarcane farms. Sustainability 11:4288","journal-title":"Sustainability"},{"issue":"3","key":"9906_CR76","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1590\/1679-78253297","volume":"14","author":"SO Degertekin","year":"2016","unstructured":"Degertekin SO, Lamberti L, Hayalioglu MS (2016) Heat transfer search algorithm for sizing optimization of truss structures. Latin Am J Solids Struct 14(3):373\u2013397","journal-title":"Latin Am J Solids Struct"},{"key":"9906_CR77","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ins.2014.06.009","volume":"289","author":"J Derrac","year":"2014","unstructured":"Derrac J, Garc\u00eda S, Hui S, Suganthan PN, Herrera F (2014) Analysing convergence performance of evolutionary algorithms: a statistical approach. Inf Sci 289:41\u201358","journal-title":"Inf Sci"},{"issue":"7","key":"9906_CR78","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1631\/FITEE.1601553","volume":"19","author":"TT Dhivyaprabha","year":"2018","unstructured":"Dhivyaprabha TT, Subashini P, Krishnaveni M (2018) Synergistic fibroblast optimization: a novel nature-inspired computing algorithm. Front Inform Technol Electron Eng 19(7):825\u2013833","journal-title":"Front Inform Technol Electron Eng"},{"issue":"1","key":"9906_CR79","first-page":"25","volume":"22","author":"E Dilettoso","year":"2017","unstructured":"Dilettoso E, Rizzo SA, Salerno N (2017) A weakly pareto compliant quality indicator. Math Comput Appl 22(1):25","journal-title":"Math Comput Appl"},{"issue":"236","key":"9906_CR80","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1080\/01621459.1946.10501898","volume":"41","author":"WJ Dixon","year":"1946","unstructured":"Dixon WJ, Mood AM (1946) The statistical sign test. J Am Stat Assoc 41(236):557\u2013566","journal-title":"J Am Stat Assoc"},{"key":"9906_CR82","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan E, Mor\u00e9 JJ (2002) Benchmarking optimization software with performance profiles. Math Program 91:201\u2013213","journal-title":"Math Program"},{"key":"9906_CR83","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1002\/nme.2944","volume":"84","author":"JJ Durillo","year":"2010","unstructured":"Durillo JJ, Nebro AJ, Luna F, Coello CSC, Alba E (2010) Convergence speed in multi-objective metaheuristics: efficiency criteria and empirical study. Int J Numer Methods Eng 84:1344\u20131375","journal-title":"Int J Numer Methods Eng"},{"key":"9906_CR84","unstructured":"Eftimov T, Kovec D (2019) Performance measures fusion for experimental comparison of methods for multi-label classification. In: AAAI 2019 Spring symposium on combining machine learning with knowledge engineering. Palo Alto, California, USA"},{"key":"9906_CR85","doi-asserted-by":"crossref","first-page":"105977","DOI":"10.1016\/j.asoc.2019.105977","volume":"87","author":"T Eftimov","year":"2020","unstructured":"Eftimov T, Petelin G, Koro\u0161ec P (2020) DSCTool: a web-service-based framework for statistical comparison of stochastic optimization algorithms. Appl Soft Comput J 87:105977","journal-title":"Appl Soft Comput J"},{"key":"9906_CR86","first-page":"7","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott M (2005) Multicriteria optimization. Springer, Berlin, Heidelberg, pp 7\u20138"},{"issue":"1","key":"9906_CR87","doi-asserted-by":"publisher","first-page":"04017066","DOI":"10.1007\/s00366-019-00718-z","volume":"32","author":"HA El-Ghandour","year":"2018","unstructured":"El-Ghandour HA, Elbeltagi E (2018) Comparison of five evolutionary algorithms for optimization of water distribution networks. J Comput Civ Eng 32(1):04017066. https:\/\/doi.org\/10.1007\/s00366-019-00718-z","journal-title":"J Comput Civ Eng"},{"key":"9906_CR88","series-title":"Chapter 5 outliers in analytical data","first-page":"48","volume-title":"Practical statistics for the analytical scientist a bench guide","author":"SLR Ellison","year":"2009","unstructured":"Ellison SLR, Barwick VJ, Farrant TJD (2009) Practical statistics for the analytical scientist a bench guide, 2nd edn. Chapter 5 outliers in analytical data. RSC Publishing, Cambridge, pp 48\u201358","edition":"2"},{"key":"9906_CR89","unstructured":"Embedded Staff (2011) CoreMark: A realistic way to benchmark CPU performance. Embedded. https:\/\/www.embedded.com\/coremark-a-realistic-way-to-benchmark-cpu-performance\/"},{"key":"9906_CR90","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/s11047-018-9685-y","volume":"17","author":"Emmerich and Deutz","year":"2018","unstructured":"Emmerich and Deutz (2018) A tutorial on multiobjective optimization: fundamentals and evolutionary methods. Nat Comput 17:585\u2013609","journal-title":"Nat Comput"},{"key":"9906_CR91","doi-asserted-by":"crossref","unstructured":"Emmerich M, Deutz A, Kruisselbrink J, Shukla PK (2013) Cone-based hypervolume indicators: construction, properties, and efficient computation. In: Purshouse RC, Flemming PJ, Fonseca CM, Grego S, Shaw J (eds) Evolutionary multi-criterion optimization EMO 2013, lecture notes in computer science, vol 7811. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-37140-0_12"},{"issue":"1","key":"9906_CR92","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/TEVC.2010.2083670","volume":"15","author":"MG Epitropakis","year":"2011","unstructured":"Epitropakis MG, Tasoulis DK, Pavlidis NG, Plagionakos VP, Vrahatis MN (2011) Enhancing differential evolution utilizing proximity-based mutation operators. IEEE Trans Evol Comput 15(1):99\u2013119","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"9906_CR93","doi-asserted-by":"crossref","first-page":"248","DOI":"10.22237\/jmasm\/1036110540","volume":"1","author":"GF Fahoome","year":"2002","unstructured":"Fahoome GF (2002) Twenty nonparametric statistics and their large sample approximations. J Mod Appl Stat Methods 1(2):248\u2013268","journal-title":"J Mod Appl Stat Methods"},{"key":"9906_CR94","unstructured":"Farhang-Mehr A, Azarm S (2002) Diversity assesment of pareto optimal solution sets: an entropy approach. In: Proceedings of IEEE congress on evolutionary computation CEC 2002. pp 723\u2013728"},{"key":"9906_CR95","volume-title":"Applications of evolutionary computing. EvoWorkshops 2003. Lecture notes in computer science","author":"S Fenet","year":"2003","unstructured":"Fenet S, Solnon C (2003) Searching for maximum cliques with ant colony optimization. In: Cagnoni S et al (eds) Applications of evolutionary computing. EvoWorkshops 2003. Lecture notes in computer science, vol 2611. Springer, Berlin, Heidelberg"},{"issue":"11","key":"9906_CR96","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/spe.1135","volume":"42","author":"J Ferrer","year":"2012","unstructured":"Ferrer J, Chicano F, Alba E (2012) Evolutionary algorithms for the multi-objective test data generation problem. Softw Pract Exp 42(11):1\u201331","journal-title":"Softw Pract Exp"},{"key":"9906_CR97","doi-asserted-by":"crossref","unstructured":"Filipi\u010d B, Tu\u0161ar T (2018) A taxonomy of methods for visualizing pareto front approximations. In: Proceedings of the genetic and evolutionary computation conference on\u2014GECCO\u201918. p 649","DOI":"10.1145\/3205455.3205607"},{"key":"9906_CR98","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2020.100579","author":"FD Fomeni","year":"2020","unstructured":"Fomeni FD, Kaparis K, Letchford AN (2020) A cut-and-branch algorithm for the quadratic knapsack problem. Discrete Optim. https:\/\/doi.org\/10.1016\/j.disopt.2020.100579","journal-title":"Discrete Optim"},{"key":"9906_CR99","doi-asserted-by":"crossref","unstructured":"Fonseca CM, Fleming PJ (1996) On the performance assessment and comparison of stochastic multiobjective optimizers. In: Proceeding of the 4th international conference on parallel problem solving from nature PPSN IV. Springer, London, pp 584\u2013593","DOI":"10.1007\/3-540-61723-X_1022"},{"key":"9906_CR100","doi-asserted-by":"crossref","unstructured":"Friedrich T, Bringmann K, Vo\u03b2 T (2011) The logarithmic hypervolume indicator. In: Proceedings of the 11th workshop on foundations of genetic algorithms. pp 81\u201392","DOI":"10.1145\/1967654.1967662"},{"key":"9906_CR101","volume-title":"Hybrid artificial intelligence systems HAIS 2008. Lecture notes in computer science","author":"S Garc\u00eda","year":"2008","unstructured":"Garc\u00eda S, Herrera F (2008) Design of experiments in computational intelligence: on the use of statistical inference. In: Corchado E, Abraham A, Pedrycz W (eds) Hybrid artificial intelligence systems HAIS 2008. Lecture notes in computer science, vol 5271. Springer, Berlin, Heidelberg"},{"key":"9906_CR103","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behavior: a case study on the CEC\u20192005 special session on real parameter optimization. J Heuristics 15:617\u2013644","journal-title":"J Heuristics"},{"issue":"10","key":"9906_CR102","doi-asserted-by":"crossref","first-page":"2044","DOI":"10.1016\/j.ins.2009.12.010","volume":"180","author":"S Garcia","year":"2010","unstructured":"Garcia S, Fern\u00e1ndez A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: experimental analysis of power. Inf Sci 180(10):2044\u20132064","journal-title":"Inf Sci"},{"key":"9906_CR104","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2018\/8395193","volume":"8395193","author":"J Garc\u00eda","year":"2018","unstructured":"Garc\u00eda J, Altimiras F, Pena A, Astorga G, Peredo O (2018) A binary cuckoo search big data algorithm applied to large-scale crew scheduling problems. Complexity 8395193:1\u201315","journal-title":"Complexity"},{"issue":"1","key":"9906_CR105","doi-asserted-by":"crossref","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","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"9906_CR106","doi-asserted-by":"crossref","first-page":"878","DOI":"10.1109\/TEVC.2017.2690446","volume":"21","author":"M Gong","year":"2017","unstructured":"Gong M, Wang Z, Zhu Z, Jiao L (2017) A Similarity-based multiobjective evolutionary algorithm for deployment optimization of near space communication system. IEEE Trans Evol Comput 21(6):878\u2013897","journal-title":"IEEE Trans Evol Comput"},{"key":"9906_CR107","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.cie.2017.10.015","volume":"115","author":"A Grange","year":"2018","unstructured":"Grange A, Kacem I, Martin S (2018) Algorithms for the bin packing problem with overlapping items. Comput Ind Eng 115:331\u2013341","journal-title":"Comput Ind Eng"},{"key":"9906_CR108","first-page":"198","volume":"7","author":"VA Grishagin","year":"1978","unstructured":"Grishagin VA (1978) Operation characteristics of some global optimization algorithms. Prob Stoch Search 7:198\u2013206 (in Russian)","journal-title":"Probl Stoch Search"},{"issue":"1","key":"9906_CR110","doi-asserted-by":"crossref","first-page":"1502242","DOI":"10.1080\/23311916.2018.1502242","volume":"5","author":"N Gunantara","year":"2018","unstructured":"Gunantara N (2018) A review of multi-objective optimization: methods and its applications. Congent Eng 5(1):1502242","journal-title":"Congent Eng"},{"issue":"3","key":"9906_CR111","doi-asserted-by":"crossref","first-page":"170","DOI":"10.24138\/jcomss.v9i3.146","volume":"9","author":"N Gunantara","year":"2013","unstructured":"Gunantara N, Hendrantoro G (2013) Multi-objective cross layer optimization for selection of cooperative path pairs in multihop wireless ad hoc networks. J Commun Softw Syst 9(3):170","journal-title":"J Commun Softw Syst"},{"key":"9906_CR112","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.2019.0948","volume":"32","author":"JG Hale","year":"2020","unstructured":"Hale JG, Zhu H, Zhou E (2020) Domination measure: a new metric for solving multiobjective optimization. INFORMS J Comput 32(3):1\u201317","journal-title":"INFORMS J Comput"},{"issue":"2","key":"9906_CR113","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s11831-017-9247-y","volume":"26","author":"AH Halim","year":"2019","unstructured":"Halim AH, Ismail I (2019) Combinatorial optimization: comparison of heuristic algorithms in travelling salesman problem. Arch Comput Methods Eng 26(2):367\u2013380","journal-title":"Arch Comput Methods Eng"},{"issue":"2","key":"9906_CR114","doi-asserted-by":"crossref","first-page":"1500","DOI":"10.1016\/j.jcp.2007.09.013","volume":"227","author":"K Hamacher","year":"2007","unstructured":"Hamacher K (2007) Adaptive extremal optimization by detrended fluctuation analysis. J Comput Phys 227(2):1500\u20131509","journal-title":"J Comput Phys"},{"key":"9906_CR115","series-title":"Lecture notes in computer science","volume-title":"Online performance measures for metaheuristic optimization, hybrid metaheuristics","author":"K Hamacher","year":"2014","unstructured":"Hamacher K (2014) Online performance measures for metaheuristic optimization, hybrid metaheuristics, vol 8457. Lecture notes in computer science. Springer, Cham"},{"key":"9906_CR116","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1080\/01621459.1974.10482962","volume":"69","author":"FR Hampel","year":"1974","unstructured":"Hampel FR (1974) The influence curve and its role in robust estimation. J Am Stat Assoc 69:383\u2013393","journal-title":"J Am Stat Assoc"},{"key":"9906_CR117","unstructured":"Hansen MP, Jaskiewicz A (1998) Evaluating the quality of approximations to the non-dominated set. Technical report IMM-REP-1998-7. Institute of Mathematical Modelling, Technical University of Denmark, Lyngby"},{"key":"9906_CR118","unstructured":"Hansen N, Auger A, Finck S, Ros R (2012) Real-parameter blackbox optimization benchmarking: experimental setup. Technical report INRIA Futurs, \u00c9quipe TAO, Univ. Paris Sud, Orsay, France"},{"key":"9906_CR119","unstructured":"Hansen N, Auger A, Brockhoff D, Tusar D, Tusar T (2016) COCO: performance assessment. arXiv:1605.03560 Retrieved from https:\/\/arxiv.org\/abs\/1605.03560"},{"issue":"3","key":"9906_CR120","first-page":"545","volume":"2","author":"WL Hare","year":"2006","unstructured":"Hare WL, Sagastiz\u00e1bal C (2006) Benchmark of some nonsmooth optimization solvers for computing nonconvex proximal points. Pac J Optim 2(3):545\u2013573","journal-title":"Pac J Optim"},{"key":"9906_CR121","doi-asserted-by":"crossref","unstructured":"He J (2016) An analytic expression of relative approximation error for a class of evolutionary algorithms. In: Proceedings of IEEE congress on evolutionary computation. pp 4366\u20134373","DOI":"10.1109\/CEC.2016.7744345"},{"issue":"2","key":"9906_CR122","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1109\/TEVC.2015.2444793","volume":"20","author":"J He","year":"2016","unstructured":"He J, Lin G (2016) Average convergence rate of evolutionary algorithms. IEEE Trans Evol Comput 20(2):316\u2013321","journal-title":"IEEE Trans Evol Comput"},{"key":"9906_CR123","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0131-8","volume-title":"Lectures on Analysis on Metric Spaces","author":"J Heinonen","year":"2001","unstructured":"Heinonen J (2001) Lectures on Analysis on Metric Spaces. Springer, New York, USA"},{"key":"9906_CR124","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/9781119136736.ch3","volume-title":"Metaheuristic for intelligent electrical networks, ch: performance evaluation of metaheuristics","author":"F Heliodore","year":"2017","unstructured":"Heliodore F, Nakib A, Ismail B, Ouchraa S, Schmitt L (2017) Metaheuristic for intelligent electrical networks, ch: performance evaluation of metaheuristics. Wiley, Hoboken, pp 43\u201358"},{"key":"9906_CR125","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.swevo.2018.10.002","volume":"44","author":"M Hellwig","year":"2019","unstructured":"Hellwig M, Beyer HG (2019) Benchmarking evolutionary algorithms for single-objective real-valued constrained optimization\u2013a critical review. Swarm Evol Comput 44:927\u2013944","journal-title":"Swarm Evol Comput"},{"key":"9906_CR126","volume-title":"Applied intelligent systems: new direction, studies in fuzziness and soft computing","author":"T Hendtlass","year":"2004","unstructured":"Hendtlass T (2004) An introduction to collective intelligence. In: Fulcher J (ed) Applied intelligent systems: new direction, studies in fuzziness and soft computing, vol 153. Springer, Berlin, Heidelberg"},{"key":"9906_CR127","unstructured":"Hendtlass T, Randall M (2001) A survey of ant colony and particle swarm meta-heuristics and their applications to discrete optimization problems. In: Proceedings of the inaugural workshop on artificial life. pp 15\u201325"},{"key":"9906_CR128","unstructured":"Herring D, Kirley M, Yao X (2020) Dynamic multi-objective optimization of the travelling thief problem. arXiv preprint: https:\/\/arxiv.org\/abs\/2002.02636"},{"key":"9906_CR129","unstructured":"Hoos HH (1998) Stochastic local search\u2014methods, models, applications. Ph.D. dissertation. Technical University Darmstadt, Germany"},{"key":"9906_CR130","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48318-9","volume-title":"Multiple attribute decision making: methods and applications, a state of the art survey","author":"C Hwang","year":"1981","unstructured":"Hwang C, Yoon K (1981) Multiple attribute decision making: methods and applications, a state of the art survey. Springer, New York"},{"key":"9906_CR131","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/978-3-642-02538-9_9","volume-title":"Experimental methods for the analysis of optimization algorithms","author":"ML Ib\u00e1nez","year":"2010","unstructured":"Ib\u00e1nez ML, Paquete L, Stuetzle T (2010) Exploratory analysis of stochastic local search algorithms in biobjective optimization. In: Bielstein TB, Chiarandini M, Paquete L, Preus M (eds) Experimental methods for the analysis of optimization algorithms. Springer, Berlin, pp 209\u2013222"},{"key":"9906_CR132","doi-asserted-by":"crossref","unstructured":"Ibrahim D. 2019. Arm-based microcontroller projects using Mbed, Chapter 3\u2014the arm microcontrollers. Newnes, pp 25\u201341","DOI":"10.1016\/B978-0-08-102969-5.00003-3"},{"key":"9906_CR133","doi-asserted-by":"crossref","unstructured":"Ishibuchi H, Masuda H, Nojima Y (2015) A study on performance evaluation ability of a modified inverted generational distance indicator. In: Proceedings of the 2015 annual conference on genetic and evolutionary computation. ACM, Madrid, Spain, pp 695\u2013702","DOI":"10.1145\/2739480.2754792"},{"issue":"3","key":"9906_CR134","doi-asserted-by":"crossref","first-page":"167","DOI":"10.18178\/ijmlc.2016.6.3.593","volume":"6","author":"N Ivkovic","year":"2016","unstructured":"Ivkovic N, Jakobovic D, Golub M (2016) Measuring performance of optimization algorithms in evolutionary computation. Int J Mach Learn Comput 6(3):167\u2013171","journal-title":"Int J Mach Learn Comput"},{"key":"9906_CR135","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/BF01588801","volume":"49","author":"RHF Jackson","year":"1991","unstructured":"Jackson RHF, Boggs PT, Nash SG, Powell S (1991) Guidelines and reporting results of computational experiments: report of the ad hoc committee. Math Program 49:413\u2013425","journal-title":"Math Program"},{"key":"9906_CR136","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)CP.1943-5487.0000617","author":"S Jalili","year":"2016","unstructured":"Jalili S, Husseinzadeh Kashan A, Hosseinzadeh Y (2016) League championship algorithms for optimum design of pin-jointed structures. J Comput Civ Eng. https:\/\/doi.org\/10.1061\/(ASCE)CP.1943-5487.0000617","journal-title":"J Softcomput Civ Eng"},{"key":"9906_CR137","doi-asserted-by":"crossref","unstructured":"Janssens GK, Pangilinan JM (2010) Multiple criteria performance analysis of non-dominated sets obtained by multi-objective evolutionary algorithm for optimisation. In: 6th IFIP WG 12.5 international conference on artificial intelligence applications and innovations (AIAI). Larnaca, Cyprus, pp 94\u2013103","DOI":"10.1007\/978-3-642-16239-8_15"},{"key":"9906_CR138","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2020.01.012","author":"UK Jena","year":"2020","unstructured":"Jena UK, Das PK, Kabat MR (2020) Hybridization of meta-heuristic algorithm for load balancing in cloud computing environment. J King Saud Univ Comput Inf Sci. https:\/\/doi.org\/10.1016\/j.jksuci.2020.01.012","journal-title":"J King Saud Univ Comput Inf Sci"},{"issue":"12","key":"9906_CR139","doi-asserted-by":"crossref","first-page":"2391","DOI":"10.1109\/TCYB.2014.2307319","volume":"44","author":"S Jiang","year":"2014","unstructured":"Jiang S, Ong YS, Zhang J, Feng L (2014) Consistencies and contradictions of performance metrics in multiobjective optimization. IEEE Trans Cybern 44(12):2391\u20132404","journal-title":"IEEE Trans Cybern"},{"key":"9906_CR140","unstructured":"Jiang S, Yang S, Li M (2016) On the use of hypervolume for diversity measurement of Pareto front approximations. In: 2016 IEEE symposium series on computational intelligence (SSCI). Athens, pp 1\u20138"},{"key":"9906_CR141","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1093\/biomet\/41.1-2.133","volume":"41","author":"AR Jonckheere","year":"1954","unstructured":"Jonckheere AR (1954) A distribution-free k-sample test against ordered alternatives. Biometrika 41:133\u2013145","journal-title":"Biometrika"},{"key":"9906_CR142","doi-asserted-by":"crossref","unstructured":"Kaur D, Murugappan M (2008) Performance enhancement in solving travelling salesman problem using hybrid genetic algorithm. In: Annual meeting of the North American fuzzy information processing society. New York City, NY, pp 1\u20136","DOI":"10.1109\/NAFIPS.2008.4531202"},{"key":"9906_CR143","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0377-2217(88)90197-X","volume":"37","author":"R Khorramshahgol","year":"1988","unstructured":"Khorramshahgol R, Moustakis VS (1988) Delphi hierarchy process (DHP): a methodology for priority setting derived from the Delphi method and analytical hierarchy process. Eur J Oper Res 37:347\u2013354","journal-title":"Eur J Oper Res"},{"key":"9906_CR144","first-page":"673","volume":"22","author":"H Kili\u00e7","year":"2019","unstructured":"Kili\u00e7 H, Y\u00fczge\u00e7 U (2019) Tournament selection based antlion optimization algorithm for solving quadratic assignment problem. Eng Sci Technol Int J 22:673\u2013691","journal-title":"Eng Sci Technol Int J"},{"key":"9906_CR145","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-47926-1","volume-title":"Harmony search algorithm. Advances in intelligent systems and computing","author":"JH Kim","year":"2016","unstructured":"Kim JH, Lee HM, Jung D, Sadollah A (2016) Performance measures of metaheuristic algorithms. In: Kim J, Geem Z (eds) Harmony search algorithm. Advances in intelligent systems and computing, vol 382. Springer, Berlin, Heidelberg"},{"key":"9906_CR146","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1016\/j.asoc.2017.07.050","volume":"60","author":"MS Kiran","year":"2017","unstructured":"Kiran MS (2017) Particle swarm optimization with a new update mechanism. Appl Soft Comput 60:670\u2013678","journal-title":"Appl Soft Comput"},{"key":"9906_CR147","unstructured":"Knowles JD, Corne D (2002) On metrics for comparing nondominated sets. In: Proceeding of the 2002 congress on evolutionary computation (CEC 2002). pp 711\u2013716"},{"key":"9906_CR148","doi-asserted-by":"crossref","unstructured":"Krink T, Vesterstr\u00f8m JS, Riget J (2002) Particle swarm optimisation with spatial particle extension. In: Proceedings of the congress on evolutionary computation, CEC\u201902. Honolulu, USA, pp 1474\u20131479","DOI":"10.1109\/CEC.2002.1004460"},{"key":"9906_CR149","doi-asserted-by":"crossref","unstructured":"Laumanns M, Zitzler E, Thiele L (2000) A unified model for multi-objective evolutionary algorithms with elitism. In: Evolutionary computation proceedings of the 2000 congress on, vol 1. pp 46\u201353","DOI":"10.1109\/CEC.2000.870274"},{"key":"9906_CR150","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.3390\/w11081637","volume":"11","author":"HM Lee","year":"2019","unstructured":"Lee HM, Jung D, Sadollah A, Yoo DG, Kim JH (2019a) Generation of benchmark problems for optimal design of water distribution systems. Water 11:1637","journal-title":"Water"},{"key":"9906_CR151","volume-title":"Harmony search and nature inspired optimization algorithms. Advances in intelligent systems and computing","author":"HM Lee","year":"2019","unstructured":"Lee HM, Jung D, Sadollah A, Lee EH, Kim JH (2019b) Performance comparison of metaheuristic optimization algorithms using water distribution system design benchmarks. In: Yadav N, Yadav A, Bansal J, Deep K, Kim J (eds) Harmony search and nature inspired optimization algorithms. Advances in intelligent systems and computing, vol 741. Springer, Singapore"},{"key":"9906_CR152","unstructured":"Lehre PK, Witt C (2011) Finite first hitting time versus stochastic convergence in particle swarm optimisation. arXiv:1105.5540v1. Retrieved from https:\/\/arxiv.org\/pdf\/1105.5540v1.pdf"},{"issue":"3","key":"9906_CR153","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TSMCA.2003.817059","volume":"33","author":"Y Leung","year":"2003","unstructured":"Leung Y, Wang Y (2003) U-measure: a quality measure for multiobjective programming. IEEE Trans Syst Man Cybern Part A Syst Hum 33(3):337\u2013343","journal-title":"IEEE Trans Syst Man Cybern Part A Syst Hum"},{"key":"9906_CR154","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/978-3-642-01262-4_3","volume-title":"Biologigally-Inspired optimisation methods","author":"A Lewis","year":"2009","unstructured":"Lewis A, Mostaghim S, Scriven I (2009) Asynchronous multi-objective optimisation in unreliable distributed environments. In: Lewis A, Mostaghim S, Randall M (eds) Biologigally-Inspired optimisation methods, vol 210. Springer, Berlin, Heidelberg, pp 51\u201378"},{"key":"9906_CR155","doi-asserted-by":"crossref","unstructured":"Li Z, Hu X (2011) The orienteering problem with compulsory nodes and time window. ICSSSM11, Tianjin, pp 1\u20134","DOI":"10.1109\/ICSSSM.2011.5959526"},{"key":"9906_CR156","unstructured":"Li M, Yao X (2017) Dominance move: a measure of comparing solution sets in multiobjective optimization. arXiv preprint arXiv:1702.00477"},{"issue":"2","key":"9906_CR157","first-page":"26","volume":"52","author":"M Li","year":"2019","unstructured":"Li M, Yao X (2019) Quality evaluation of solution sets in multiobjective optimisation: a survey. ACM Comput Surv 52(2):26","journal-title":"ACM Comput Surv"},{"key":"9906_CR158","unstructured":"Li X, Tang K, Omidvar MN, Yang Z and Qin K (2013) Benchmark functions for the CEC\u20192013 special session and competition on large-scale global optimization. Technical report"},{"issue":"12","key":"9906_CR159","doi-asserted-by":"crossref","first-page":"2568","DOI":"10.1109\/TCYB.2014.2310651","volume":"44","author":"M Li","year":"2014","unstructured":"Li M, Yang S, Liu X (2014) Diversity comparison of Pareto front approximations in many-objective optimization. IEEE Trans Cybern 44(12):2568\u20132584","journal-title":"IEEE Trans Cybern"},{"issue":"8","key":"9906_CR160","first-page":"1","volume":"41","author":"J Liang","year":"2006","unstructured":"Liang J, Runarsson TP, Mezura-Montes E, Clerc M, Suganthan P, Coello CC, Deb K (2006) Problem definitions and evaluation criteria for the CEC 2006 special session on constrained real-parameter optimization. J Appl Mech 41(8):1\u201324","journal-title":"J Appl Mech"},{"key":"9906_CR161","unstructured":"Liang JJ, Qu BY, Suganthan PN (2013) Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization. Technical report 201311, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou, China and Technical Report, Nanyang Technological University, Singapore"},{"issue":"8","key":"9906_CR162","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.3390\/app9081675","volume":"9","author":"X Liu","year":"2019","unstructured":"Liu X, Zhang D (2019) An improved SPEA2 algorithm with local search for multi-objective investment decision-making. Appl Sci 9(8):1675. https:\/\/doi.org\/10.3390\/app9081675","journal-title":"Appl Sci"},{"key":"9906_CR163","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.automatica.2017.06.011","volume":"83","author":"S Liu","year":"2017","unstructured":"Liu S, Qiu Z, Xie L (2017a) Convergence rate analysis of distributed optimization with projected subgradient problem. Automatica 83:162\u2013169","journal-title":"Automatica"},{"issue":"9","key":"9906_CR164","doi-asserted-by":"crossref","first-page":"2924","DOI":"10.1109\/TCYB.2017.2659659","volume":"47","author":"Q Liu","year":"2017","unstructured":"Liu Q, Chen WN, Deng JD, Gu T, Zhang H, Yu Z, Zhang J (2017b) Benchmarking stochastic algorithms for global optimization problems by visualizing confidence intervals. IEEE Trans Cybern 47(9):2924\u20132937","journal-title":"IEEE Trans Cybern"},{"key":"9906_CR165","doi-asserted-by":"crossref","unstructured":"Lo M, Liang Y, Hsieh J (2010) A modified variable neighborhood search algorithm for orienteering problems. In: 40th International conferecne on computers and industrial engineering. Awaji, pp 1\u20136","DOI":"10.1109\/ICCIE.2010.5668224"},{"key":"9906_CR166","doi-asserted-by":"crossref","unstructured":"MacFarland TW, Yates JM (2016) Mann\u2013Whitney U test. In: Introduction to nonparametric statistics for the biological sciences using R. Springer, Cham","DOI":"10.1007\/978-3-319-30634-6"},{"key":"9906_CR167","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1016\/j.ins.2016.07.025","volume":"367","author":"L Mart\u00ed","year":"2016","unstructured":"Mart\u00ed L, Garc\u00eda J, Berlanga A, Molina JM (2016) A stopping criterion for multi-objective optimization evolutionary algorithms. Inf Sci 367:700\u2013718","journal-title":"Inf Sci"},{"key":"9906_CR168","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2016.12.005","volume":"33","author":"M Mavrovouniotis","year":"2017","unstructured":"Mavrovouniotis M, Li C, Yang S (2017) A survey of swarm intelligence for dynamic optimization: algorithms and applications. Swarm Evol Comput 33:1\u201317","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"9906_CR169","first-page":"1","volume":"8","author":"CC McGeoh","year":"1996","unstructured":"McGeoh CC (1996) Toward an experimental method for algorithm simulation INFORMS. J Comput 8(1):1\u201311","journal-title":"J Comput"},{"issue":"6","key":"9906_CR170","first-page":"1","volume":"4","author":"A Memari","year":"2017","unstructured":"Memari A, Ahmad R, Rahim Abdul AR (2017) Metaheuristic algorithms: guidelines for implementation. J Soft Comput Decis Support Syst 4(6):1\u20136","journal-title":"J Soft Comput Decis Support Syst"},{"key":"9906_CR171","volume-title":"Advances in natural computation. ICNC 2005, Lecture notes in computer science","author":"H Meng","year":"2005","unstructured":"Meng H, Zhang X, Liu S (2005) New quality measures for multiobjective programming. In: Wang L, Chen K, Ong YS (eds) Advances in natural computation. ICNC 2005, Lecture notes in computer science, vol 3611. Springer, Berlin, Heidelberg"},{"issue":"4","key":"9906_CR172","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P Merz","year":"2000","unstructured":"Merz P, Freisleben B (2000) Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans Evol Comput 4(4):337\u2013352","journal-title":"IEEE Trans Evol Comput"},{"issue":"10","key":"9906_CR173","doi-asserted-by":"crossref","first-page":"2101","DOI":"10.2514\/1.8977","volume":"42","author":"A Messac","year":"2004","unstructured":"Messac A, Mattson CA (2004) Normal constraint method with guarantee of even representation of complete pareto frontier. AIAA J 42(10):2101\u20132111","journal-title":"AIAA J"},{"key":"9906_CR174","doi-asserted-by":"crossref","first-page":"4223","DOI":"10.1016\/j.ins.2010.07.023","volume":"180","author":"E Mezura-Montes","year":"2010","unstructured":"Mezura-Montes E, Miranda-Varela ME, G\u00f3mez-Ram\u00f3n C (2010) Differential evolution in constrained numerical optimization: an empirical study. Inf Sci 180:4223\u20134262","journal-title":"Inf Sci"},{"key":"9906_CR175","doi-asserted-by":"crossref","first-page":"1521","DOI":"10.1016\/j.cor.2011.01.010","volume":"38","author":"G Minella","year":"2011","unstructured":"Minella G, Ruiz R, Ciavotta M (2011) Restarted Iterated Pareto greedy algorithm for multi-objective flowshop scheduling problems. Comput Oper Res 38:1521\u20131533","journal-title":"Comput Oper Res"},{"key":"9906_CR176","doi-asserted-by":"crossref","unstructured":"Ming L, Wang Y, Cheung YM (2006) On convergence rate of class of genetic algorithms. In: Proceedings of 2006 world automation congress IEEE. Budapest, Hungary, pp 1\u20136","DOI":"10.1109\/WAC.2006.376051"},{"key":"9906_CR177","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2014.10.005","volume":"21","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili S, Lewis A (2015) Novel performance metrics for robust multi-objective optimization algorithms. Swarm Evol Comput 21:1\u201323","journal-title":"Swarm Evol Comput"},{"key":"9906_CR178","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10589-015-9802-0","volume":"64","author":"RDC Monteiro","year":"2016","unstructured":"Monteiro RDC, Ortiz C, Svaiter BF (2016) An adaptive accelerated first-order method for convex optimization. Comput Optim Appl 64:31\u201373. https:\/\/doi.org\/10.1007\/s10589-015-9802-0","journal-title":"Comput Optim Appl"},{"key":"9906_CR179","doi-asserted-by":"crossref","first-page":"4817","DOI":"10.1007\/s11269-015-1092-x","volume":"29","author":"D Mora-Melia","year":"2015","unstructured":"Mora-Melia D, Iglesias-Rey PL, Martinez-Solano FJ, Ballesteros-P\u00e9rez P (2015) Efficiency of evolutionary algorithms in water network pipe sizing. Water Resour Manag 29:4817\u20134831","journal-title":"Water Resour Manag"},{"issue":"1","key":"9906_CR180","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"JJ Mor\u00e9","year":"2009","unstructured":"Mor\u00e9 JJ, Wild SM (2009) Benchmarking derivative-free optimization algorithms. SIAM J Optim 20(1):172\u2013191","journal-title":"SIAM J Optim"},{"key":"9906_CR181","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.advengsoft.2018.11.004","volume":"127","author":"A Mortazavi","year":"2019","unstructured":"Mortazavi A, To\u011fan V, Moloodpoor M (2019) Solution of structural and mathematical optimization problems using a new hybrid swarm intelligence optimization algorithm. Adv Eng Softw 127:106\u2013123","journal-title":"Adv Eng Softw"},{"issue":"4","key":"9906_CR182","first-page":"957","volume":"30","author":"T Murata","year":"1996","unstructured":"Murata T, Ishibuchi H, Tanaka H (1996) Multi-objective genetic algorithm and its application to flow-shop scheduling. Int J Comput Eng 30(4):957\u2013968","journal-title":"Int J Comput Eng"},{"key":"9906_CR183","volume-title":"Evolutionary computation in combinatorial optimization. EvoCOP 2006. Lecture notes in computer science","author":"Y Nagata","year":"2006","unstructured":"Nagata Y (2006) Fast EAX algorithm considering population diversity for traveling salesman problems. In: Gottlieb J, Raidl GR (eds) Evolutionary computation in combinatorial optimization. EvoCOP 2006. Lecture notes in computer science, vol 3906. Springer, Berlin, Heidelberg"},{"key":"9906_CR184","volume-title":"Metaheuristic for dynamic optimization, recent research on metaheuristics for dynamic optimization, studies in computational intelligence","author":"A Nakib","year":"2013","unstructured":"Nakib A, Siarry P (2013) Performance analysis of dynamic optimization algorithms. In: Alba E, Nakib A, Siarry P (eds) Metaheuristic for dynamic optimization, recent research on metaheuristics for dynamic optimization, studies in computational intelligence. Springer, Berlin"},{"key":"9906_CR185","volume-title":"Distribution free tests","author":"HR Neave","year":"1988","unstructured":"Neave HR, Worthington PL (1988) Distribution free tests. Unwin Hyman Inc, Boston"},{"key":"9906_CR186","doi-asserted-by":"crossref","unstructured":"Nebro AJ, Durillo JJ, Nietp JG, Coello CA, Luna F, Alba E (2009) SMPSO: A new PSO-based metaheuristic for multi-objective optimization","DOI":"10.1109\/MCDM.2009.4938830"},{"issue":"4","key":"9906_CR187","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1504\/IJMHEUR.2014.068914","volume":"3","author":"S Nesmachnow","year":"2014","unstructured":"Nesmachnow S (2014) An overview of metaheuristics: accurate and efficient methods for optimization. Int J Metaheuristics 3(4):320\u2013347","journal-title":"Int J Metaheuristics"},{"issue":"4","key":"9906_CR188","doi-asserted-by":"crossref","first-page":"55","DOI":"10.4316\/AECE.2014.04009","volume":"14","author":"R Ngamtawee","year":"2014","unstructured":"Ngamtawee R, Wardkein P (2014) Simplified genetic algorithm: simplify and improve RGA for parameter optimizations. Adv Electr Comput Eng 14(4):55\u201364","journal-title":"Adv Electr Comput Eng"},{"issue":"6","key":"9906_CR189","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/TEVC.2011.2180533","volume":"16","author":"T Nguyen","year":"2012","unstructured":"Nguyen T, Yao X (2012) Continuous dynamic constrained optimization\u2014the challenges. IEEE Trans Evol Comput 16(6):769\u2013786","journal-title":"IEEE Trans Evol Comput"},{"key":"9906_CR190","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2012.05.001","volume":"6","author":"T Nguyen","year":"2012","unstructured":"Nguyen T, Yang S, Branke J (2012) Evolutionary dynamic optimization: a survey of the state of the art. Swarm Evol Comput 6:1\u201324","journal-title":"Swarm Evol Comput"},{"key":"9906_CR191","unstructured":"Nishida K, Aguirre HE, Saito S, Shirakawa S, Akimoto Y (2018) Parameterless stochastic natural gradient method for discrete optimization and its application to hyper-parameter optimization for neural network. arXiv:1809.06517. Retrieved from https:\/\/arxiv.org\/pdf\/1809.06517.pdf"},{"key":"9906_CR192","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/B978-0-12-382196-6.00004-2","volume-title":"Chapter 4\u2014embedded processors, embedded systems architecture","author":"T Noergaard","year":"2013","unstructured":"Noergaard T (2013) Chapter 4\u2014embedded processors, embedded systems architecture, 2nd edn. Elsevier, Waltham, pp 137\u2013229","edition":"2"},{"key":"9906_CR193","doi-asserted-by":"publisher","first-page":"375358","DOI":"10.1155\/2014\/375358","volume":"2014","author":"IC Obagbuwa","year":"2014","unstructured":"Obagbuwa IC, Adewumi AO (2014) An improved cockroach swarm optimization. Sci World J 2014:375358. https:\/\/doi.org\/10.1155\/2014\/375358","journal-title":"Sci World J"},{"key":"9906_CR194","unstructured":"Okabe T, Jin Y, Sendhoff B (2003) A critical survey of performance indices for multi-objective optimisation. In: 2003 Congress on evolutionary computation, CEC\u201903. Canberra, ACT, Australia"},{"issue":"4","key":"9906_CR195","doi-asserted-by":"crossref","first-page":"353","DOI":"10.3844\/jmssp.2011.353.355","volume":"7","author":"NP Olewuezi","year":"2011","unstructured":"Olewuezi NP (2011) Note on the comparison of some outlier labeling techniques. J Math Stat 7(4):353\u2013355","journal-title":"J Math Stat"},{"key":"9906_CR196","doi-asserted-by":"crossref","unstructured":"Olorunda O, Engelbrecht AP (2008) Measuring exploration\/exploitation in particle swarm using swarm diversity. In: IEEE congress on evolutionary computationm. Hong Kong, pp 1128\u20131134","DOI":"10.1109\/CEC.2008.4630938"},{"key":"9906_CR197","first-page":"5","volume":"2","author":"S Opricovic","year":"1998","unstructured":"Opricovic S (1998) Multicriteria optimization of civil engineering systems. Fac Civ Eng Belgrade 2:5\u201321","journal-title":"Fac Civ Eng Belgrade"},{"key":"9906_CR198","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1080\/01621459.1963.10500843","volume":"58","author":"EB Page","year":"1963","unstructured":"Page EB (1963) Ordered hypotheses for multiple treatments: a significance test for linear ranks. J Am Stat Assoc 58:216\u2013230","journal-title":"J Am Stat Assoc"},{"key":"9906_CR199","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.eswa.2019.01.062","volume":"124","author":"QK Pan","year":"2019","unstructured":"Pan QK, Gao L, Wang L, Liang J, Li XY (2019) Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem. Expert Syst Appl 124:309\u2013324","journal-title":"Expert Syst Appl"},{"key":"9906_CR200","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.asoc.2015.03.038","volume":"32","author":"PV Paul","year":"2015","unstructured":"Paul PV, Moganarangan N, Sampath KS, Raju R, Vengattaraman T, Dhavachelvan P (2015) Performance analyses over population seeding techniques of the permutation-coded genetic algorithm: an empirical study based on travelling salesman problems. Appl Soft Comput 32:383\u2013402","journal-title":"Appl Soft Comput"},{"key":"9906_CR201","first-page":"30","volume":"23","author":"S Peitz","year":"2018","unstructured":"Peitz S, Dellnitz M (2018) A survey of recent trends in multiobjective optimal control\u2014surrogate models, feedback control and objective reduction. Math Comput Appl 23:30","journal-title":"Math Comput Appl"},{"key":"9906_CR202","doi-asserted-by":"crossref","first-page":"111932","DOI":"10.1016\/j.enconman.2019.111932","volume":"199","author":"J Pierezan","year":"2019","unstructured":"Pierezan J, Maidl G, Yamao EM, Coelho LDS, Mariani VC (2019) Cultural coyote optimization algorithm applied to a heavy duty gas turbine operation. Energy Convers Manag 199:111932","journal-title":"Energy Convers Manag"},{"issue":"2","key":"9906_CR203","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3390\/app8020293","volume":"8","author":"D Polap","year":"2018","unstructured":"Polap D, Kesik K, Wo\u017aniak M, Dama\u0161evi\u010dius R (2018) Parallel technique for metaheuristic algorithms using devoted local search and manipulating the solutions space. Appl Sci. 8(2):1\u201325","journal-title":"Appl Sci."},{"key":"9906_CR204","unstructured":"Price KV, Awad NH, Ali MZ, Suganthan PN (2018) The 100-digit challenge: problem definitions and evaluation criteria for the 100-digit shallenge special session and competition on single objective numerical optimization. Tech. rep. Nanyang Technological University, Singapore"},{"key":"9906_CR205","first-page":"389","volume-title":"The six sigma handbook","author":"T Pyzdek","year":"2010","unstructured":"Pyzdek T, Keller P (2010) The six sigma handbook, 3rd edn. Tata Mcgraw Hill, New York, pp 389\u2013391","edition":"3"},{"key":"9906_CR206","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.procs.2017.05.109","volume":"108","author":"K Rakesh","year":"2017","unstructured":"Rakesh K, Suganthan PN (2017) An ensemble of kernel ridge regression for multi-class classification. Procedia Comput Sci 108:375\u2013383","journal-title":"Procedia Comput Sci"},{"issue":"3","key":"9906_CR207","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1023\/A:1011319115230","volume":"7","author":"RL Rardin","year":"2018","unstructured":"Rardin RL, Uzsoy R (2018) Experimental evaluation of heuristic optimization algorithm: a tutorial. J Heuristics 7(3):261\u2013304","journal-title":"J Heuristics"},{"key":"9906_CR208","doi-asserted-by":"crossref","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179:2232\u20132248","journal-title":"Inf Sci"},{"issue":"3","key":"9906_CR209","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10489-006-0018-y","volume":"26","author":"SS Ray","year":"2007","unstructured":"Ray SS, Bandyopadhyay S, Pal SK (2007) Genetic operators for combinatorial optimization in TSP and microarray gene ordering. J Appl Intell 26(3):183\u2013195","journal-title":"J Appl Intell"},{"key":"9906_CR210","volume-title":"International encyclopedia of statistical science","author":"D Rey","year":"2011","unstructured":"Rey D, Neuh\u00e4user M (2011) Wilcoxon-signed-rank test. In: Lovric M (ed) International encyclopedia of statistical science. Springer, Berlin, Heidelberg"},{"key":"9906_CR211","doi-asserted-by":"crossref","unstructured":"Ribeiro CC, Rosseti I, Vallejos R (2009) On the use of run time distributions to evaluate and compare stochastic local search algorithms. In: SLS \u201809 Proceedings of the second international workshop on engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Springer, Brussels, Belgium, pp 16\u201330","DOI":"10.1007\/978-3-642-03751-1_2"},{"key":"9906_CR212","unstructured":"Riget J, Vesterstr\u00f8m JS (2002) A diversity-guided particle swarm optimizer\u2014the arpso. EVALife Project Group, technical report 2002-02, Department of Computer Science, Aarhus Universitet"},{"key":"9906_CR213","doi-asserted-by":"crossref","unstructured":"Riquelme N, L\u00fccken CV, Bar\u00e1n B (2015) Performance metrics in multi-objective optimization. In: 2015 XLI Latin American computing conference","DOI":"10.1109\/CLEI.2015.7360024"},{"key":"9906_CR214","first-page":"111","volume":"10","author":"N Rouky","year":"2019","unstructured":"Rouky N, Abourraja MN, Boukachour J, Boudebous D, Alaoui AH, Khoukhi FE (2019) Simulation optimization based ant colony algorithm for the uncertain quay crane scheduling problem. Int J Ind Eng Comput 10:111\u2013132","journal-title":"Int J Ind Eng Comput"},{"key":"9906_CR215","doi-asserted-by":"publisher","unstructured":"Roy B (1991) The outranking approach and the foundations of electre methods. Theor Decis 31:49\u201373. https:\/\/doi.org\/10.1007\/BF00134132","DOI":"10.1007\/BF00134132"},{"issue":"4","key":"9906_CR216","first-page":"1","volume":"10","author":"AEH Saad","year":"2017","unstructured":"Saad AEH, Dong Z, Karimi M (2017) A comparative study on recently-introduced nature-based global optimization methods in complex mechanical system design. Algorithms 10(4):1\u201330","journal-title":"Algorithms"},{"key":"9906_CR217","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11518-006-0151-5","volume":"13","author":"TL Saaty","year":"2004","unstructured":"Saaty TL (2004) Decision making-The analytic hierarchy and network processes (AHP, ANP). J Syst Sci Syst Eng 13:1\u201335","journal-title":"J Syst Sci Syst Eng"},{"key":"9906_CR218","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1016\/j.asoc.2018.04.010","volume":"68","author":"A Sadollah","year":"2018","unstructured":"Sadollah A, Sayyandi H, Yoo DG, Lee HM, Kim JH (2018) Mine blast harmony search: a new hybrid method for improving exploration and exploitaqtion capabilities. Appl Soft Comput 68:548\u2013564","journal-title":"Appl Soft Comput"},{"issue":"2","key":"9906_CR219","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/4235.728207","volume":"2","author":"R Salomon","year":"1998","unstructured":"Salomon R (1998) Evolutionary algorithms and gradient search: similarities and differences. IEEE Trans Evol Comput 2(2):45\u201355","journal-title":"IEEE Trans Evol Comput"},{"key":"9906_CR220","doi-asserted-by":"crossref","unstructured":"Santos G, Chagas JBC (2018) The thief orienteering problem: formulation and heuriatic approaches. In: IEEE congress on evolutionary computation (CEC). Rio de Jeneiro, pp 1\u20139","DOI":"10.1109\/CEC.2018.8477853"},{"issue":"3","key":"9906_CR221","doi-asserted-by":"crossref","first-page":"437","DOI":"10.5540\/tema.2018.019.03.437","volume":"19","author":"T Santos","year":"2018","unstructured":"Santos T, Xavier S (2018) A convergence indiator for multi-objective optimisation algorithms. Tend Math Apli Comput 19(3):437\u2013448","journal-title":"Tend Math Apli Comput"},{"key":"9906_CR222","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.eswa.2019.01.052","volume":"124","author":"LFOM Santos","year":"2019","unstructured":"Santos LFOM, Iwayama RS, Cavalcanti LB, Turi LM, Morais FEdS, Mormilho G, Cunha CB (2019) A variable neighborhood search algorithm for the bin packing problem with compatible categories. Expert Syst Appl 124:209\u2013225","journal-title":"Expert Syst Appl"},{"key":"9906_CR223","unstructured":"Schott JR (1995) Fault tolerant design using single and multicretiria genetic algorithm optimization. Master\u2019s thesis, Massachusetts Institute of Technology"},{"issue":"4","key":"9906_CR224","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TEVC.2011.2161872","volume":"16","author":"O Schutze","year":"2012","unstructured":"Schutze O, Esquivel X, Lara A, Coello CAC (2012) Using the averaged hausdorff distance as a performance measure in evolutionary multiobjective optimization. IEEE Trans Evol Comput 16(4):504\u2013522","journal-title":"IEEE Trans Evol Comput"},{"key":"9906_CR225","volume-title":"Computing and estimating the rate of convergence","author":"JR Senning","year":"2015","unstructured":"Senning JR (2015) Computing and estimating the rate of convergence. Dept. Math. Comput. Sci, Gordon Colledge, Wenham"},{"key":"9906_CR226","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.matcom.2016.05.006","volume":"141","author":"YD Sergeyev","year":"2017","unstructured":"Sergeyev YD, Kvasov DE, Mukhametzhanov MS (2017) Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms. Math Comput Simul 141:96\u2013109","journal-title":"Math Comput Simul"},{"issue":"453","key":"9906_CR227","first-page":"1","volume":"8","author":"YD Sergeyev","year":"2018","unstructured":"Sergeyev YD, Kvasov DE, Mukhametzhanov MS (2018) On the efficiency of nature-inspired metaheuristics in expensive global optimization with limited budget. Sci Rep 8(453):1\u20139","journal-title":"Sci Rep"},{"key":"9906_CR228","volume-title":"Handbook of parametric and nonparametric statistical procedures","author":"D Sheskin","year":"2006","unstructured":"Sheskin D (2006) Handbook of parametric and nonparametric statistical procedures. Chapman & Hall\/CRC, Boca Raton"},{"issue":"4\u20132","key":"9906_CR229","first-page":"1820","volume":"8","author":"SA Shukor","year":"2018","unstructured":"Shukor SA, Shaheed IM, Abdullah S (2018) Population initialisation methods for fuzzy job-shop scheduling problems: issues and future trends. Int J Adv Sci Eng Inf Tech 8(4\u20132):1820\u20131828","journal-title":"Int J Adv Sci Eng Inf Tech"},{"key":"9906_CR230","doi-asserted-by":"crossref","unstructured":"Silva VL, Wanner EF, Cerqueira SA, Takahashi RH (2007) A new performance metric for multiobjective optimization: the integrated sphere counting. In: Proceedings of the 2007 IEEE congress on evolutionary computation. IEEE Press, pp 3625\u20133630","DOI":"10.1109\/CEC.2007.4424942"},{"key":"9906_CR231","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104950","author":"BCH Silva","year":"2020","unstructured":"Silva BCH, Fernandes IFC, Goldbarg MC, Goldbarg EFG (2020) Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms. Comput Oper Res. https:\/\/doi.org\/10.1016\/j.cor.2020.104950","journal-title":"Comput Oper Res"},{"key":"9906_CR232","unstructured":"Skidmore GS (2006) Metaheuristics and combinatorial optimization problems. Master\u2019s thesis. Rochester Institute of Technology"},{"key":"9906_CR233","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10472-011-9230-5","volume":"61","author":"Smith-Miles","year":"2011","unstructured":"Smith-Miles, Van Hemert J (2011) Discovering the suitability of optimisation algorithms by learning from evolved instances. Ann Math Artif Intell 61:87\u2013104","journal-title":"Ann Math Artif Intell"},{"key":"9906_CR234","volume-title":"Learning and intelligent optimization. LION 2010. Lecture notes in computer science","author":"K Smith-Miles","year":"2010","unstructured":"Smith-Miles K, Van Hemert J, Lim XY (2010) Understanding TSP Difficulty by Learning from Evolved Instances. In: Blum C, Battiti R (eds) Learning and intelligent optimization. LION 2010. Lecture notes in computer science, vol 6073. Springer, Berlin\u00b8Heidelberg"},{"key":"9906_CR235","volume-title":"Statistical methods","author":"GW Snedecor","year":"1989","unstructured":"Snedecor GW, Cochran WG (1989) Statistical methods, 8th edn. Iowa State University Press, Iowa","edition":"8"},{"key":"9906_CR236","unstructured":"Suganthan PN, Hansen N, Liang JJ, Deb K, Chen YP, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Technical report"},{"issue":"2","key":"9906_CR237","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/TEVC.2018.2791283","volume":"23","author":"Y Sun","year":"2018","unstructured":"Sun Y, Yen GG, Yi Z (2018) IGD indicator-based evolutionary algorithm for many-objective optimization problems. IEEE Trans Evol Comput 23(2):173\u2013187","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"9906_CR238","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1109\/21.370197","volume":"25","author":"J Suzuki","year":"1995","unstructured":"Suzuki J (1995) A Markov chain analysis on simple genetic algorithm. IEEE Trans Syst Man Cybern 25(4):655\u2013659","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"9906_CR239","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.engappai.2014.08.002","volume":"37","author":"L Tang","year":"2015","unstructured":"Tang L, Li Z, Luo L, Liu B (2015) Multi-strategy adaptive particle swarm optimization for numerical optimization. Eng Appl Artif Intell 37:9\u201319","journal-title":"Eng Appl Artif Intell"},{"key":"9906_CR240","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/S1385-7258(52)50043-X","volume":"14","author":"TJ Terpstra","year":"1952","unstructured":"Terpstra TJ (1952) The asymptotic normality and consistency of Kendall\u2019s test against trend, when ties are present in one ranking. Indag Math 14:327\u2013333","journal-title":"Indag Math"},{"issue":"1","key":"9906_CR241","first-page":"65","volume":"35","author":"N Trefethen","year":"2002","unstructured":"Trefethen N (2002) A hundred-dollar, hundred-digit challenge. SIAM News 35(1):65","journal-title":"SIAM News"},{"key":"9906_CR242","unstructured":"Trojanowski K, Michalewicz Z (1999) Searching for optima in non-stationary environments, In: Proceedings of the 1999 congress on evolutionary computation-CEC99 (Cat. No. 99TH8406), vol 3. pp 1843\u20131850"},{"issue":"3","key":"9906_CR243","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1080\/0305215031000109622","volume":"35","author":"HK Tsai","year":"2003","unstructured":"Tsai HK, Yang JM, Tsai YF, Kao CY (2003) Heterogeneous selection genetic algorithms for travelling salesman problems. Eng Optim 35(3):297\u2013311","journal-title":"Eng Optim"},{"issue":"4","key":"9906_CR244","doi-asserted-by":"crossref","first-page":"1718","DOI":"10.1109\/TSMCB.2004.828283","volume":"34","author":"HK Tsai","year":"2004","unstructured":"Tsai HK, Yang JM, Tsai YF, Kao CY (2004) An evolutionary algorithm for large travelling salesman problems. IEEE Trans Syst Man Cybern Part B Cybern 34(4):1718\u20131729","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"9906_CR245","first-page":"1","volume":"2014","author":"CW Tsai","year":"2014","unstructured":"Tsai CW, Tseng SP, Chiang MC, Yang CS, Hong TP (2014) A high-performance genetic algorithms: using traveling salesman problem as a case. Sci World J 2014:1\u201314","journal-title":"Sci World J"},{"issue":"2","key":"9906_CR246","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0031-3203(00)00005-4","volume":"34","author":"LY Tseng","year":"2001","unstructured":"Tseng LY, Yang SB (2001) A genetic approach to the automatic clustering problem. Pattern Recognit 34(2):415\u2013424","journal-title":"Pattern Recognit"},{"key":"9906_CR247","volume-title":"Exploratory data analysis","author":"JW Tukey","year":"1977","unstructured":"Tukey JW (1977) Exploratory data analysis. Addison-Wesley, Philippines"},{"key":"9906_CR248","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2014\/569346","volume":"569346","author":"T Tu\u0161ar","year":"2014","unstructured":"Tu\u0161ar T, Filipi\u010d B (2014) Visualizing exact and approximated 3d empirical attainment functions. Math Probl Eng 569346:1\u201318","journal-title":"Math Probl Eng"},{"key":"9906_CR249","volume-title":"Dictionary of statistics","author":"G Upton","year":"2014","unstructured":"Upton G, Cook I (2014) Dictionary of statistics. Oxford University Press, Oxford"},{"key":"9906_CR250","volume-title":"Evolutionary computation in combinatorial optimization. EvoCOP 2005. Lecture notes in computer science","author":"J Van Hemert","year":"2005","unstructured":"Van Hemert J (2005) Property analysis of symmetric travelling salesman problem instances acquired through evolution. In: Raidl GR, Gottlieb J (eds) Evolutionary computation in combinatorial optimization. EvoCOP 2005. Lecture notes in computer science, vol 3448. Springer, Berlin, Heidelberg"},{"key":"9906_CR251","doi-asserted-by":"crossref","unstructured":"Van Veldhuizen DA, Lamont GB (1999) Multiobjective evolutionary algorithm test suites. In Proceedings of the ACM symposium on applied computing. pp 351\u2013357","DOI":"10.1145\/298151.298382"},{"key":"9906_CR252","doi-asserted-by":"crossref","unstructured":"Van Veldhuizen DA, Lamont GB (2000) On measuring multiobjective evolutionary algorithm performance. In: Proceedings of the IEEE congress on evolutionary computation. pp 204\u2013211","DOI":"10.1109\/CEC.2000.870296"},{"issue":"2","key":"9906_CR253","first-page":"331","volume":"22","author":"A Vargas","year":"2018","unstructured":"Vargas A, Bogoya J (2018) A generalization of the averaged hausdorff distance. Comput Sist 22(2):331\u2013345","journal-title":"Comput Sist"},{"issue":"4\u20135","key":"9906_CR254","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1080\/10556780902909948","volume":"24","author":"AIF Vaz","year":"2009","unstructured":"Vaz AIF, Vicente LN (2009) PSwarm: a hybrid solver for linearly constrained global derivative-free optimization. Optim Methods Softw 24(4\u20135):669\u2013685","journal-title":"Optim Methods Softw"},{"issue":"3","key":"9906_CR255","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10732-017-9328-y","volume":"24","author":"M Wagner","year":"2018","unstructured":"Wagner M, Lindauer M, Misir M, Nallaperuma S, Hutter F (2018) A case study of algorithm selection for the travelling thief problem. J Heuristics 24(3):295\u2013320","journal-title":"J Heuristics"},{"key":"9906_CR256","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.neucom.2019.02.054","volume":"341","author":"WL Wang","year":"2019","unstructured":"Wang WL, Li WK, Wang Z, Li L (2019) Opposition-based multi-objective whale optimization algorithm with global grid ranking. Neurocomputing 341:41\u201359","journal-title":"Neurocomputing"},{"key":"9906_CR257","doi-asserted-by":"crossref","unstructured":"Wanner EF, Guimar\u00e3es FG, Takahashi RH, Fleming PJ (2006) A quadratic approximation-based local search procedure for multiobjective genetic algorithms. In: Procedings of the IEEE congress on evolutionary computation. pp 938\u2013945","DOI":"10.1109\/CEC.2006.1688411"},{"key":"9906_CR258","unstructured":"Weck OLD (2004) Multiobjective optimization: history and promise. In: Proceedings of 3rd China\u2013Japan\u2013Korea joint symposium on optimization of structural and mechanical systems. Kanazawa, Japan"},{"key":"9906_CR259","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0004-3702(95)00124-7","volume":"85","author":"D Whitley","year":"1996","unstructured":"Whitley D, Rana S, Dzubera J, Mathias KE (1996) Evaluating evolutionary algorithms. Artif Intell 85:245\u2013276","journal-title":"Artif Intell"},{"key":"9906_CR260","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.compchemeng.2019.04.022","volume":"126","author":"M Woolway","year":"2019","unstructured":"Woolway M, Majozi T (2019) On the application of a metaheuristic suite with parallel implementations for the scheduling of multipurpose batch plants. Comput Chem Eng 126:371\u2013390","journal-title":"Comput Chem Eng"},{"key":"9906_CR261","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1115\/1.1329875","volume":"123","author":"J Wu","year":"2001","unstructured":"Wu J, Azarm S (2001) Metrics for quality assessment of a multiobjective optimization solution set, transactions of the ASME. J Mech Des 123:18\u201325","journal-title":"J Mech Des"},{"key":"9906_CR262","volume-title":"Handbook of approximation algorithms and metaheuristics, methodologies and traditional applications","author":"W Wu","year":"2018","unstructured":"Wu W, Yagiura M, Ibaraki T (2018) Generalized assignment problem. In: Gonzalez TF (ed) Handbook of approximation algorithms and metaheuristics, methodologies and traditional applications, vol 1, 2nd edn. Chapman and Hall\/CRC, New York","edition":"2"},{"key":"9906_CR263","doi-asserted-by":"crossref","first-page":"124854","DOI":"10.1016\/j.amc.2019.124854","volume":"369","author":"Z Wu","year":"2020","unstructured":"Wu Z, Jiang B, Karimi HR (2020) A logarithmic descent direction algorithm for the quadratic knapsack problem. Appl Math Comput 369:124854","journal-title":"Appl Math Comput"},{"issue":"2","key":"9906_CR264","doi-asserted-by":"crossref","first-page":"74","DOI":"10.4018\/jamc.2011040104","volume":"2","author":"M Yaghini","year":"2011","unstructured":"Yaghini M, Momeni M, Sarmadi M (2011) DIMMA-implemented metaheuristics for finding shortest hamiltonian path between Iranian cities using sequential DOE approach for parameters tuning. Int J Appl Metaheuristic Comput 2(2):74\u201392","journal-title":"Int J Appl Metaheuristic Comput"},{"key":"9906_CR265","volume-title":"Nature-inspired metaheuristic algorithms","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) Nature-inspired metaheuristic algorithms, 2nd edn. Luniver Press, Bristol","edition":"2"},{"key":"9906_CR266","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-642-20662-7_2","volume":"6630","author":"XS Yang","year":"2011","unstructured":"Yang XS (2011) Metaheuristics optimization: algorithm analysis and open problems. Lect Notes Comput Sci 6630:21\u201332","journal-title":"Lect Notes Comput Sci"},{"issue":"6","key":"9906_CR267","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1109\/TEVC.2010.2046667","volume":"14","author":"S Yang","year":"2010","unstructured":"Yang S, Li C (2010) A Clustering particle swarm optimizer for locating and tracking multiple optima in dynamic environments. IEEE Trans Evol Comput 14(6):959\u2013974","journal-title":"IEEE Trans Evol Comput"},{"key":"9906_CR268","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/978-3-642-38416-5","volume-title":"Evolutionary computation for dynamic optimization problems, ch. 8","author":"S Yang","year":"2013","unstructured":"Yang S, Yao X (2013) Evolutionary computation for dynamic optimization problems, ch. 8. Springer, Berlin, pp 203\u2013205"},{"key":"9906_CR269","doi-asserted-by":"crossref","unstructured":"Yang XS, Deb S, Fong S (2011) Accelerated particle swarm optimization and support vector machine for business optimization and applications. In: Networked digital technologies (NDT2011), communications in computer and information science, vol 136. Springer, pp 53\u201366","DOI":"10.1007\/978-3-642-22185-9_6"},{"issue":"1","key":"9906_CR270","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1109\/TEVC.2013.2240687","volume":"18","author":"GG Yen","year":"2014","unstructured":"Yen GG, He Z (2014) Performance metric ensemble for multiobjective evolutionary algorithms. IEEE Trans Evol Comput 18(1):131\u2013144","journal-title":"IEEE Trans Evol Comput"},{"key":"9906_CR271","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.ijepes.2014.03.061","volume":"61","author":"X Yu","year":"2014","unstructured":"Yu X, Zhang X (2014) Unit commitment using Lagrangian relaxation and particle swarm optimization. Electr Power Energy Syst 61:510\u2013522","journal-title":"Electr Power Energy Syst"},{"issue":"9","key":"9906_CR272","first-page":"1286","volume":"39","author":"HJ Yu","year":"2005","unstructured":"Yu HJ, Zhang LP, Chen DZ, Hu SX (2005) Adaptive particle swarm optimization algorithm based on feedback mechanism. J Zhejiang Univ (Eng Sci Ed) 39(9):1286\u20131291","journal-title":"J Zhejiang Univ (Eng Sci Ed)"},{"key":"9906_CR273","first-page":"1","volume":"9751783","author":"X Yu","year":"2018","unstructured":"Yu X, Lu Y, Yu X (2018) Evaluating multiobjective evolutionary algorithms using MCDM methods. Math Probl Eng 9751783:1\u201313","journal-title":"Math Probl Eng"},{"key":"9906_CR274","first-page":"1","volume":"99","author":"G Yu","year":"2019","unstructured":"Yu G, Jin Y, Olhofer M (2019) Benchmark problems and performance indicators for search of knee points in multiobjective optimization. IEEE Trans Cybern 99:1\u201314","journal-title":"IEEE Trans Cybern"},{"key":"9906_CR275","unstructured":"Zehmakan AN (2015) Bin packing problem: two approximation algorithms. arXiv:1508.01376. Retrieved from https:\/\/arxiv.org\/pdf\/1508.01376v1.pdf"},{"key":"9906_CR276","volume-title":"Automatic reasoning. IJCAR. Lecture notes in computer science","author":"B Zhan","year":"2018","unstructured":"Zhan B, Haslbeck MPL (2018) Verifying asymptotic time complexity of imperative programs in Isabelle. In: Galmiche D, Schulz S, Sebastiani R (eds) Automatic reasoning. IJCAR. Lecture notes in computer science, vol 10900. Springer, Cham"},{"key":"9906_CR277","unstructured":"Zhang X, Hu H, Wang L, Sun Z, Zhang Y, Han K, Xu Y (2018) A novel bin design problem and high performance algorithm for e-commerce logistics system. arXiv:1812.02565v1. Retrieved from: https:\/\/arxiv.org\/pdf\/1812.02565v1.pdf"},{"key":"9906_CR278","doi-asserted-by":"crossref","first-page":"103517","DOI":"10.1016\/j.engappai.2020.103517","volume":"90","author":"HG Zhang","year":"2020","unstructured":"Zhang HG, Liang ZH, Liu HJ, Wang R, Liu YA (2020) Ensemble framework by using nature inspired algorithms for the early-stage forest fire rescue\u2014a case study of dynamic optimization problems. Eng Appl Artif Intell 90:103517","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"9906_CR279","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s00158-016-1469-3","volume":"55","author":"K Zheng","year":"2017","unstructured":"Zheng K, Yang R, Xu H, Hu J (2017) A new distribution metric for comparing pareto optimal solutions. Struct Multidiscip Optim 55(1):53\u201362","journal-title":"Struct Multidiscip Optim"},{"key":"9906_CR280","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.swevo.2019.04.002","volume":"48","author":"Y Zhong","year":"2019","unstructured":"Zhong Y, Wang L, Lin M, Zhang H (2019) Discrete pigeon-inspired optimization algorithm with metropolis acceptance criterion for large-scale travelling salesman problem. Swarm Evol Comput 48:134\u2013144","journal-title":"Swarm Evol Comput"},{"key":"9906_CR281","doi-asserted-by":"crossref","unstructured":"Zhou A, Jin Y, Zhang Q, Sendhoff B, Tsang E (2006) Combining model-based and genetics-based offspring generation for multi-objective optimization using a convergence criterion. In: Evolutionary computation CEC 2006. IEEE congress on evolutionary computation. pp 892\u2013899","DOI":"10.1109\/CEC.2006.1688406"},{"issue":"7","key":"9906_CR282","first-page":"1","volume":"10","author":"AH Zhou","year":"2019","unstructured":"Zhou AH, Zhu LP, Hu B, Deng S, Song Y, Qiu H, Pan S (2019) Traveling-salesman-problem algorithm based on simulated annealing and gene-expression programming. Information 10(7):1\u201315","journal-title":"Information"},{"key":"9906_CR283","unstructured":"Zitzler E (1999) Evolutionary algorithms for multiobjective optimization: methods and appliations. Doctor of technical sciences dissertation, Swiss Federal Institute of Technology Zurich"},{"key":"9906_CR284","doi-asserted-by":"crossref","unstructured":"Zitzler E, Thiele L (1998) Multiobjective optimization using evolutionary algorithms\u2014a comparative case study. In: Proceedings of the international conference on parallel problem solving from nature. Armsterdam, Netherlands, pp 292\u2013301","DOI":"10.1007\/BFb0056872"},{"issue":"4","key":"9906_CR285","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"9906_CR286","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput 8(2):173\u2013195","journal-title":"Evol Comput"},{"issue":"2","key":"9906_CR287","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler E, Thiele L, Laumanns M, Foncesca CM, Foncesca VG (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7(2):117\u2013132","journal-title":"IEEE Trans Evol Comput"},{"key":"9906_CR288","doi-asserted-by":"crossref","unstructured":"Zitzler E, Brockhoff D, Thiele L (2007) The hypervolume indicator revisited: on the design of pareto-compliant indicators via weighted integration. In: Proceedings of the 4th international conference on evolutionary multi-criterion optimization (EMO\u201907). pp 862\u2013876","DOI":"10.1007\/978-3-540-70928-2_64"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-020-09906-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10462-020-09906-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-020-09906-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T09:48:34Z","timestamp":1698227314000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10462-020-09906-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,6]]},"references-count":286,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["9906"],"URL":"https:\/\/doi.org\/10.1007\/s10462-020-09906-6","relation":{},"ISSN":["0269-2821","1573-7462"],"issn-type":[{"value":"0269-2821","type":"print"},{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,6]]},"assertion":[{"value":"6 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}