{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:51Z","timestamp":1740122751219,"version":"3.37.3"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:00:00Z","timestamp":1568937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:00:00Z","timestamp":1568937600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Science Fondation Ireland","award":["13\/IA\/1850","10\/CE\/I1855"],"award-info":[{"award-number":["13\/IA\/1850","10\/CE\/I1855"]}]},{"name":"Science Fondation Ireland","award":["13\/RC\/2094"],"award-info":[{"award-number":["13\/RC\/2094"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s10732-019-09427-8","type":"journal-article","created":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T06:34:02Z","timestamp":1568961242000},"page":"119-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A comparative study of multi-objective machine reassignment algorithms for data centres"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2958-7979","authenticated-orcid":false,"given":"Takfarinas","family":"Saber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Gandibleux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"O\u2019Neill","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liam","family":"Murphy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony","family":"Ventresque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,20]]},"reference":[{"key":"9427_CR1","doi-asserted-by":"crossref","unstructured":"Alsheddy, A., Tsang, E.E.P.K.: Guided pareto local search based frameworks for biobjective optimization. In: CEC, pp. 1\u20138 (2010)","DOI":"10.1109\/CEC.2010.5585983"},{"key":"9427_CR2","first-page":"153","volume-title":"Lecture Notes in Economics and Mathematical Systems","author":"Eric Angel","year":"2004","unstructured":"Angel, E., Bampis, E., Gourves, L.: A dynasearch neighborhood for the bicriteria traveling salesman problem. In: Metaheuristics for Multiobjective Optimisation, pp. 153\u2013176 (2004)"},{"key":"9427_CR3","doi-asserted-by":"crossref","unstructured":"Arcuri, A., Briand, L.: A practical guide for using statistical tests to assess randomized algorithms in software engineering. In: ICSE, pp. 1\u201310 (2011)","DOI":"10.1145\/1985793.1985795"},{"issue":"3","key":"9427_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10288-006-0002-8","volume":"4","author":"Matthieu Basseur","year":"2006","unstructured":"Basseur, M.: Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. 4OR, pp. 255\u2013258 (2006)","journal-title":"4OR"},{"key":"9427_CR5","unstructured":"Beck, J., Siewiorek, D.: Modeling multicomputer task allocation as a vector packing problem. In: ISSS, p. 115 (1996)"},{"key":"9427_CR6","doi-asserted-by":"crossref","unstructured":"Beloglazov, A., Abawajy, J., Buyya, R.: Energy-aware resource allocation heuristics for efficient management of data centers for cloud computing. In: FGCS, pp. 755\u2013768 (2012)","DOI":"10.1016\/j.future.2011.04.017"},{"key":"9427_CR7","doi-asserted-by":"crossref","unstructured":"Bin, E., Biran, O., Boni, O., Hadad, E., Kolodner, E.K., Moatti, Y., Lorenz, D.H.: Guaranteeing high availability goals for virtual machine placement. In: ICDCS, pp. 700\u2013709 (2011)","DOI":"10.1109\/ICDCS.2011.72"},{"key":"9427_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10479-014-1772-6","volume":"242","author":"F Brandt","year":"2016","unstructured":"Brandt, F., Speck, J., V\u00f6lker, M.: Constraint-based large neighborhood search for machine reassignment. Ann. Oper. Res. 242, 63\u201391 (2016)","journal-title":"Ann. Oper. Res."},{"key":"9427_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-015-2082-3","author":"F Butelle","year":"2016","unstructured":"Butelle, F., Alfandari, L., Coti, C., Finta, L., L\u00e9tocart, L., Plateau, G., Roupin, F., Rozenknop, A., Calvo, R.W.: Fast machine reassignment. Ann. Oper. Res. (2016). \nhttps:\/\/doi.org\/10.1007\/s10479-015-2082-3","journal-title":"Ann. Oper. Res."},{"key":"9427_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0166-218X(00)00267-5","volume":"111","author":"A Caprara","year":"2001","unstructured":"Caprara, A., Toth, P.: Lower bounds and algorithms for the 2-dimensional vector packing problem. Discrete Appl. Math. 111, 231\u2013262 (2001)","journal-title":"Discrete Appl. Math."},{"key":"9427_CR11","first-page":"182","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.A.M.T.: A fast and elitist multiobjective genetic algorithm: Nsga-ii. TEVC 6, 182\u2013197 (2002)","journal-title":"TEVC"},{"key":"9427_CR12","doi-asserted-by":"crossref","unstructured":"Doddavula, S.K., Kaushik, M., Jain, A.: Implementation of a fast vector packing algorithm and its application for server consolidation. In: CloudCom, pp. 332\u2013339 (2011)","DOI":"10.1109\/CloudCom.2011.52"},{"key":"9427_CR13","doi-asserted-by":"publisher","first-page":"e4068","DOI":"10.1002\/dac.4068","volume":"32","author":"N Donyagard Vahed","year":"2019","unstructured":"Donyagard Vahed, N., Ghobaei-Arani, M., Souri, A.: Multiobjective virtual machine placement mechanisms using nature-inspired metaheuristic algorithms in cloud environments: a comprehensive review. Int. J. Commun. Syst. 32, e4068 (2019)","journal-title":"Int. J. Commun. Syst."},{"key":"9427_CR14","unstructured":"European Commission. Datacentre energy efficiency (2007). \nhttp:\/\/re.jrc.ec.europa.eu"},{"key":"9427_CR15","volume-title":"Genetic Algorithms and Grouping Problems","author":"E Falkenauer","year":"1998","unstructured":"Falkenauer, E.: Genetic Algorithms and Grouping Problems. Wiley, New York (1998)"},{"key":"9427_CR16","first-page":"109","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. JGO 6, 109\u2013133 (1995)","journal-title":"JGO"},{"issue":"1","key":"9427_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1535\/itj.1201.06","volume":"12","author":"D Filani","year":"2008","unstructured":"Filani, D., He, J., Gao, S., Rajappa, M., Kumar, A., Shah, P., Nagappan, R.: Dynamic data center power management: trends, issues, and solutions. Intel Technol. J. 12(1), 59\u201367 (2008)","journal-title":"Intel Technol. J."},{"key":"9427_CR18","first-page":"519","volume-title":"Lecture Notes in Computer Science","author":"M. Fleischer","year":"2003","unstructured":"Fleischer, M.: The measure of pareto optima applications to multi-objective metaheuristics. In: EMO, pp. 519\u2013533 (2003)"},{"key":"9427_CR19","unstructured":"Gabay, M., Zaourar, S.: A GRASP approach for the machine reassignment problem. In: EURO (2012)"},{"key":"9427_CR20","first-page":"221","volume-title":"Lecture Notes in Computer Science","author":"Xavier Gandibleux","year":"2017","unstructured":"Gandibleux, X.: Peek\u2013shape\u2013grab: a methodology in three stages for approximating the non-dominated points of multiobjective discrete\/combinatorial optimization problems with a multiobjective metaheuristic. In: EMO, pp. 221\u2013235 (2017)"},{"key":"9427_CR21","first-page":"209","volume":"39","author":"H Gavranovi\u0107","year":"2012","unstructured":"Gavranovi\u0107, H., Buljuba\u0161i\u0107, M., Demirovi\u0107, E.: Variable neighborhood search for google machine reassignment problem. ENDM 39, 209\u2013216 (2012)","journal-title":"ENDM"},{"key":"9427_CR22","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0305-0548(02)00195-8","volume":"31","author":"M Gendreau","year":"2004","unstructured":"Gendreau, M., Laporte, G., Semet, F.: Heuristics and lower bounds for the bin packing problem with conflicts. Comput. Oper. Res. 31, 347\u2013358 (2004)","journal-title":"Comput. Oper. Res."},{"key":"9427_CR23","unstructured":"Google\/ROADEF\/EURO CHALLENGE 2012. Google\/roadef\/euro challenge (2012). \nhttp:\/\/challenge.roadef.org\/2012\/en\/"},{"key":"9427_CR24","unstructured":"Graham, R.L: Bounds on multiprocessing anomalies and related packing algorithms. In: SJCC, pp. 205\u2013217 (1972)"},{"key":"9427_CR25","doi-asserted-by":"crossref","unstructured":"Hoffmann, R., Riff, M.C., Montero, E., Rojas, N.: Google challenge: a hyperheuristic for the machine reassignment problem. In: CEC, pp. 846\u2013853 (2015)","DOI":"10.1109\/CEC.2015.7256979"},{"key":"9427_CR26","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/inco.1996.2616","volume":"132","author":"K Jansen","year":"1997","unstructured":"Jansen, K., \u00d6hring, S.: Approximation algorithms for time constrained scheduling. Inform. Comput. 132, 85\u2013108 (1997)","journal-title":"Inform. Comput."},{"key":"9427_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2014.08.043","volume":"242","author":"W Ja\u015bkowski","year":"2015","unstructured":"Ja\u015bkowski, W., Szubert, M., Gawron, P.: A hybrid mip-based large neighborhood search heuristic for solving the machine reassignment problem. Ann. Oper. Res. 242, 1\u201330 (2015)","journal-title":"Ann. Oper. Res."},{"key":"9427_CR28","doi-asserted-by":"crossref","unstructured":"Jung, G., Hiltunen, M., Joshi, K.R., Schlichting, R.D., Pu, C., et\u00a0al.: Mistral: dynamically managing power, performance, and adaptation cost in cloud infrastructures. In: ICDCS, pp. 62\u201373 (2010)","DOI":"10.1109\/ICDCS.2010.88"},{"key":"9427_CR29","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0167-6377(02)00173-6","volume":"31","author":"H Kellerer","year":"2003","unstructured":"Kellerer, H., Kotov, V.: An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing. Oper. Res. Lett. 31, 35\u201341 (2003)","journal-title":"Oper. Res. Lett."},{"key":"9427_CR30","unstructured":"Leinberger, W., Karypis, G., Kumar, V.: Multi-capacity bin packing algorithms with applications to job scheduling under multiple constraints. In: ICPP, pp. 404\u2013412 (1999)"},{"key":"9427_CR31","doi-asserted-by":"crossref","unstructured":"Li, X., Ventresque, A., Stokes, N., Thorburn, J., Murphy, J.: ivmp: an interactive VM placement algorithm for agile capital allocation. In: CLOUD, pp. 950\u2013951 (2013)","DOI":"10.1109\/CLOUD.2013.4"},{"key":"9427_CR32","doi-asserted-by":"crossref","unstructured":"Li, X., Ventresque, A., Murphy, J., Thorburn, J.: A fair comparison of VM placement heuristics and a more effective solution. In: IEEE 13th International Symposium on Parallel and Distributed Computing, ISPDC, pp. 35\u201342 (2014)","DOI":"10.1109\/ISPDC.2014.8"},{"key":"9427_CR33","first-page":"1859","volume":"56","author":"C-H Lien","year":"2007","unstructured":"Lien, C.-H., Bai, Y.-W., Lin, M.-B.: Estimation by software for the power consumption of streaming-media servers. TIM 56, 1859\u20131870 (2007)","journal-title":"TIM"},{"key":"9427_CR34","first-page":"77","volume":"22","author":"R Lopes","year":"2015","unstructured":"Lopes, R., Morais, V.W.C., Noronha, T.F., Souza, V.A.A.: Heuristics and matheuristics for a real-life machine reassignment problem. ITOR 22, 77\u201395 (2015)","journal-title":"ITOR"},{"key":"9427_CR35","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-38171-3_12","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"Yuri Malitsky","year":"2013","unstructured":"Malitsky, Y., Mehta, D., O\u2019Sullivan, B., Simonis, H.: Tuning parameters of large neighborhood search for the machine reassignment problem. In: CPAIOR, pp. 176\u2013192 (2013)"},{"key":"9427_CR36","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/2797211","volume":"48","author":"ZA Mann","year":"2015","unstructured":"Mann, Z.A.: Allocation of virtual machines in cloud data centers-a survey of problem models and optimization algorithms. CSUR 48, 11 (2015)","journal-title":"CSUR"},{"key":"9427_CR37","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s00158-003-0368-6","volume":"26","author":"RT Marler","year":"2004","unstructured":"Marler, R.T., Arora, J.S.: Survey of multi-objective optimization methods for engineering. Struct. Multidisc. Optim. 26, 369\u2013395 (2004)","journal-title":"Struct. Multidisc. Optim."},{"key":"9427_CR38","doi-asserted-by":"publisher","first-page":"5266","DOI":"10.1016\/j.eswa.2013.03.037","volume":"40","author":"R Masson","year":"2013","unstructured":"Masson, R., Vidal, T., Michallet, J., Penna, P.H.V., Petrucci, V., Subramanian, A., Dubedout, H.: An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems. Expert Syst. Appl. 40, 5266\u20135275 (2013)","journal-title":"Expert Syst. Appl."},{"key":"9427_CR39","first-page":"455","volume":"213","author":"G Mavrotas","year":"2009","unstructured":"Mavrotas, G.: Effective implementation of the $$\\varepsilon $$-constraint method in multi-objective mathematical programming problems. Appl. Math. Comput. 213, 455\u2013465 (2009)","journal-title":"Appl. Math. Comput."},{"key":"9427_CR40","doi-asserted-by":"crossref","unstructured":"Mehta, D., O\u2019Sullivan, B., Simonis, H.: Comparing solution methods for the machine reassignment problem. In: CP, pp. 782\u2013797 (2011)","DOI":"10.1007\/978-3-642-33558-7_56"},{"key":"9427_CR41","doi-asserted-by":"crossref","unstructured":"Mills, K., Filliben, J., Dabrowski, C.: Comparing VM-placement algorithms for on-demand clouds. In: CloudCom, pp. 91\u201398 (2011)","DOI":"10.1109\/CloudCom.2011.22"},{"key":"9427_CR42","unstructured":"Panigrahy, R., Talwar, K., Uyeda, L., Wieder, U.: Heuristics for vector bin packing. research. microsoft. com (2011)"},{"key":"9427_CR43","first-page":"1","volume":"242","author":"Gabriel M Portal","year":"2012","unstructured":"Portal, Gabriel M., Ritt, Marcus, Borba, Leonardo M., Buriol, Luciana S.: Simulated annealing for the machine reassignment problem. Ann. Oper. Res. 242, 1\u201322 (2012)","journal-title":"Ann. Oper. Res."},{"key":"9427_CR44","first-page":"770","volume":"11","author":"RC Purshouse","year":"2007","unstructured":"Purshouse, R.C., Fleming, P.J.: On the evolutionary optimization of many conflicting objectives. TEVC 11, 770\u2013784 (2007)","journal-title":"TEVC"},{"key":"9427_CR45","unstructured":"Saber, T.: Multi-objective Virtual Machine Reassignment for Large Data Centres. PhD thesis, University College Dublin (2017)"},{"key":"9427_CR46","doi-asserted-by":"crossref","unstructured":"Saber, T., Ventresque, A., Gandibleux, X., Murphy, L.: Genepi: A multi-objective machine reassignment algorithm for data centres. In: HM, pp. 115\u2013129 (2014a)","DOI":"10.1007\/978-3-319-07644-7_9"},{"key":"9427_CR47","doi-asserted-by":"crossref","unstructured":"Saber, T., Ventresque, A., Murphy, L., Talbi, E.: Multi-objective VM reassignment for the enterprise. In: Meta (2014b)","DOI":"10.1109\/ICTAI.2015.20"},{"key":"9427_CR48","doi-asserted-by":"crossref","unstructured":"Saber, T., Ventresque, A., Brandic, I., Thorburn, J., Murphy, L.: Towards a multi-objective VM reassignment for large decentralised data centres. In: UCC (2015a)","DOI":"10.1109\/ICTAI.2015.20"},{"key":"9427_CR49","doi-asserted-by":"crossref","unstructured":"Saber, T., Ventresque, A., Marques-Silva, J., Thorburn, J., Murphy, L.: Milp for the multi-objective VM reassignment problem. In: ICTAI, pp. 41\u201348 (2015b)","DOI":"10.1109\/ICTAI.2015.20"},{"key":"9427_CR50","first-page":"1760004","volume":"26","author":"T Saber","year":"2017","unstructured":"Saber, T., Marques-Silva, J., Thorburn, J., Ventresque, A.: Exact and hybrid solutions for the multi-objective VM reassignment problem. IJAIT 26, 1760004 (2017)","journal-title":"IJAIT"},{"key":"9427_CR51","doi-asserted-by":"crossref","unstructured":"Saber, T., Florian, D., Mike, P., Michael, O., Ventresque, A.: A hybrid algorithm for multi-objective test case selection. In: CEC (2018a)","DOI":"10.1109\/CEC.2018.8477875"},{"key":"9427_CR52","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1016\/j.future.2017.06.015","volume":"79","author":"T Saber","year":"2018","unstructured":"Saber, T., Thorburn, J., Murphy, L., Ventresque, A.: VM reassignment in hybrid clouds for large decentralised companies: a multi-objective challenge. Future Gener. Comput. Syst. 79, 751\u2013764 (2018b)","journal-title":"Future Gener. Comput. Syst."},{"key":"9427_CR53","first-page":"337","volume":"7","author":"B Schroeder","year":"2010","unstructured":"Schroeder, B., Gibson, G.A.: A large-scale study of failures in high-performance computing systems. TDSC 7, 337\u2013351 (2010)","journal-title":"TDSC"},{"key":"9427_CR54","first-page":"35","volume":"10","author":"H Shachnai","year":"2012","unstructured":"Shachnai, H., Tamir, T.: Approximation schemes for generalized two-dimensional vector packing with application to data placement. JDA 10, 35\u201348 (2012)","journal-title":"JDA"},{"key":"9427_CR55","doi-asserted-by":"crossref","unstructured":"Stillwell, M., Vivien, F., Casanova, H.: Virtual machine resource allocation for service hosting on heterogeneous distributed platforms. In: IPDPS, pp. 786\u2013797 (2012)","DOI":"10.1109\/IPDPS.2012.75"},{"key":"9427_CR56","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-50127-7_13","volume-title":"AI 2016: Advances in Artificial Intelligence","author":"Ayad Turky","year":"2016","unstructured":"Turky, A., Sabar, N.R., Sattar, A., Song, A.: Parallel late acceptance hill-climbing algorithm for the google machine reassignment problem. In: Australasian Joint Conference on Artificial Intelligence, pp. 163\u2013174 (2016)"},{"key":"9427_CR57","first-page":"409","volume-title":"Lecture Notes in Computer Science","author":"Ayad Turky","year":"2017","unstructured":"Turky, A., Sabar, N.R., Sattar, A., Song, A.: Evolutionary learning based iterated local search for google machine reassignment problems. In: Asia-Pacific Conference on Simulated Evolution and Learning, pp. 409\u2013421 (2017a)"},{"key":"9427_CR58","first-page":"228","volume-title":"Lecture Notes in Computer Science","author":"Ayad Turky","year":"2016","unstructured":"Turky, A., Sabar, N.R., Song, A.: Neighbourhood analysis: a case study on google machine reassignment problem. In: Australasian Conference on Artificial Life and Computational Intelligence, pp. 228\u2013237 (2017b)"},{"key":"9427_CR59","first-page":"183","volume":"19","author":"A Turky","year":"2018","unstructured":"Turky, A., Sabar, N.R., Song, A.: Cooperative evolutionary heterogeneous simulated annealing algorithm for google machine reassignment problem. GPEM 19, 183\u2013210 (2018)","journal-title":"GPEM"},{"key":"9427_CR60","first-page":"101","volume":"25","author":"A Vargha","year":"2000","unstructured":"Vargha, A., Delaney, H.D.: A critique and improvement of the cl common language effect size statistics of mcgraw and wong. J. Educ. Behav. Stat. 25, 101\u2013132 (2000)","journal-title":"J. Educ. Behav. Stat."},{"key":"9427_CR61","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1008258310679","volume":"12","author":"M Vis\u00e9e","year":"1998","unstructured":"Vis\u00e9e, M., Teghem, J., Pirlot, M., Ulungu, E.L.: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem. J. Global Optim. 12, 139\u2013155 (1998)","journal-title":"J. Global Optim."},{"key":"9427_CR62","doi-asserted-by":"crossref","unstructured":"Voorsluys, W., Broberg, J., Venugopal, S., Buyya, R.: Cost of virtual machine live migration in clouds: a performance evaluation. In: CloudCom, pp. 254\u2013265 (2009)","DOI":"10.1007\/978-3-642-10665-1_23"},{"key":"9427_CR63","doi-asserted-by":"crossref","unstructured":"Xu, J., Fortes, J.: A multi-objective approach to virtual machine management in datacenters. In: ICAC, pp. 225\u2013234 (2011)","DOI":"10.1145\/1998582.1998636"},{"key":"9427_CR64","doi-asserted-by":"crossref","unstructured":"Xu, J., Fortes, J.A.B.: Multi-objective virtual machine placement in virtualized data center environments. In: GreenCom, pp. 179\u2013188 (2010)","DOI":"10.1109\/GreenCom-CPSCom.2010.137"},{"key":"9427_CR65","doi-asserted-by":"crossref","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms: a comparative case study. In: PPSN, pp. 292\u2013301 (1998)","DOI":"10.1007\/BFb0056872"},{"key":"9427_CR66","unstructured":"Zitzler, E., Laumanns, M., Thiele, L., Fonseca, C.M., da\u00a0Fonseca, V.G.: Why quality assessment of multiobjective optimizers is difficult. In: GECCO, pp. 666\u2013673 (2002)"},{"key":"9427_CR67","first-page":"117","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. TEVC 7, 117\u2013132 (2003)","journal-title":"TEVC"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-019-09427-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-019-09427-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-019-09427-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T23:13:16Z","timestamp":1600470796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-019-09427-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,20]]},"references-count":67,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["9427"],"URL":"https:\/\/doi.org\/10.1007\/s10732-019-09427-8","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2019,9,20]]},"assertion":[{"value":"24 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}