{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T19:03:37Z","timestamp":1767899017033,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2011,4,19]],"date-time":"2011-04-19T00:00:00Z","timestamp":1303171200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1007\/s00521-011-0588-4","type":"journal-article","created":{"date-parts":[[2011,4,18]],"date-time":"2011-04-18T07:54:07Z","timestamp":1303113247000},"page":"1917-1929","source":"Crossref","is-referenced-by-count":34,"title":["Hypervolume-based multi-objective local search"],"prefix":"10.1007","volume":"21","author":[{"given":"Matthieu","family":"Basseur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong-Qiang","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,4,19]]},"reference":[{"issue":"3","key":"588_CR1","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/j.ejor.2004.07.017","volume":"167","author":"J Arroyo","year":"2005","unstructured":"Arroyo J, Armentano V (2005) Genetic local search for multi-objective flowshop scheduling problems. Eur J Oper Res 167(3):717\u2013738","journal-title":"Eur J Oper Res"},{"key":"588_CR2","unstructured":"Bader J, Deb K, Zitzler E (2008) Faster hypervolume-based search using monte carlo sampling. In: Conference on multiple criteria decision making (MCDM 2008). Springer, New York, pp 313\u2013326"},{"key":"588_CR3","doi-asserted-by":"crossref","unstructured":"Basseur M, Burke EK (2007) Indicator-based multiobjective local search. In: Proceedings of the IEEE congress on evolutionary computation (CEC 2007). Singapore, September, pp 3100\u20133107","DOI":"10.1109\/CEC.2007.4424867"},{"key":"588_CR4","doi-asserted-by":"crossref","unstructured":"Basseur M, Seynhaeve F, Talbi E-G (2002) Design of multi-objective evolutionary algorithms: application to the flow-shop scheduling problem. In: Congress on evolutionary computation, vol 2. Honolulu, USA, pp 1151\u20131156","DOI":"10.1109\/CEC.2002.1004405"},{"issue":"4","key":"588_CR5","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1162\/evco.2009.17.4.17402","volume":"17","author":"N Beume","year":"2009","unstructured":"Beume N (2009) S-metric calculation by considering dominated hypervolume as klee\u2019s measure problem. Evol Comput 17(4):477\u2013492","journal-title":"Evol Comput"},{"key":"588_CR6","doi-asserted-by":"crossref","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","volume":"181","author":"N Beume","year":"2007","unstructured":"Beume N, Naujoks B, Emmerich M (2007) SMS-EMOA: multiobjective selection based on dominated hypervolume. Eur J Oper Res 181:1653\u20131669","journal-title":"Eur J Oper Res"},{"issue":"6","key":"588_CR7","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1109\/TEVC.2008.919001","volume":"12","author":"L Bradstreet","year":"2008","unstructured":"Bradstreet L, While L, Barone L (2008) A fast incremental hypervolume algorithm. IEEE Trans Evol Comput 12(6):714\u2013723","journal-title":"IEEE Trans Evol Comput"},{"key":"588_CR8","doi-asserted-by":"crossref","unstructured":"Bringmann K, Friedrich T (2008) Approximating the volume of unions and intersections of high-dimensional geometric objects. In: ISAAC\u201908: proceedings of the 19th international symposium on algorithms and computation, Berlin, Heidelberg. Springer, pp 436\u2013447","DOI":"10.1007\/978-3-540-92182-0_40"},{"key":"588_CR9","doi-asserted-by":"crossref","unstructured":"Bringmann K, Friedrich T (2009) Don\u2019t be greedy when calculating hypervolume contributions. In: FOGA\u201909: proceedings of the tenth ACM SIGEVO workshop on foundations of genetic algorithms. New York, NY, USA, ACM, pp 103\u2013112","DOI":"10.1145\/1527125.1527139"},{"key":"588_CR10","unstructured":"Coello Coello CA, Lamont GB, Van Veldhuizen DA (2006) Evolutionary algorithms for solving multi-objective problems (genetic and evolutionary computation). Springer, New York, Inc., Secaucus, NJ, USA"},{"key":"588_CR11","doi-asserted-by":"crossref","unstructured":"Day O, Lamont B (2005) Multiobjective quadratic assignment problem solved by an explicit building block search algorithm\u2014momga-iia. In: EvoCOP, volume 3448 of lecture notes in computer science. Springer, New York, pp 91\u2013100","DOI":"10.1007\/978-3-540-31996-2_9"},{"key":"588_CR12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.ejor.2008.12.034","volume":"1","author":"C Dhaenens","year":"2010","unstructured":"Dhaenens C, Lemesre J, Talbi E (2010) K-ppm: A new exact method to solve multiobjective combinatorial optimization problems. Eur J Oper Res 1:45\u201353","journal-title":"Eur J Oper Res"},{"key":"588_CR13","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J Du","year":"1990","unstructured":"Du J, Leung JY-T (1990) Minimizing total tardiness on one machine is NP-hard. Math Oper Res 15:483\u2013495","journal-title":"Math Oper Res"},{"issue":"2","key":"588_CR14","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.ejor.2009.12.027","volume":"205","author":"J Figueira","year":"2010","unstructured":"Figueira J, Liefooghe A, Talbi E-G, Wierzbicki A (2010) A parallel multiple reference point approach for multi-objective optimization. Eur J Oper Res 205(2):390\u2013400","journal-title":"Eur J Oper Res"},{"issue":"2","key":"588_CR15","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"JD Knowles","year":"2000","unstructured":"Knowles JD, Corne DW (2000) Approximating the nondominated front using the pareto archived evolution strategy. Evol Comput 8(2):149\u2013172","journal-title":"Evol Comput"},{"key":"588_CR16","unstructured":"Knowles JD, Thiele L, Zitzler E (2005) A tutorial on the performance assessment of stochastive multiobjective optimizers. Technical report TIK-Report No. 214, Computer Engineering and Networks Laboratory, ETH Zurich, July"},{"key":"588_CR17","unstructured":"Landa-Silva D, Burke EK, Petrovic S (2004) Metaheuristic for multiobjective optimisation, chapter an introduction to multiobjective metaheuristics for scheduling and timetabling. Springer, New York, pp 91\u2013129"},{"key":"588_CR18","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discrete Math 1:343\u2013362","journal-title":"Ann Discrete Math"},{"key":"588_CR19","unstructured":"Liefooghe A, Mesmoudi S, Humeau J, Jourdan L, Talbi E-G (2009) Designing, implementing and analyzing effective heuristics. In: Engineering stochastic local search algorithms, volume 5752 of lecture notes in computer science. Springer, New York, pp 120\u2013124"},{"key":"588_CR20","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0377-2217(93)E0140-S","volume":"81","author":"A Nagar","year":"1995","unstructured":"Nagar A, Haddock J, Heragu S (1995) Multiple and bicriteria scheduling: a litterature survey. Eur J Oper Res 81:88\u2013104","journal-title":"Eur J Oper Res"},{"issue":"3","key":"588_CR21","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1016\/j.ejor.2004.08.024","volume":"169","author":"L Paquete","year":"2006","unstructured":"Paquete L, Stuetzle T (2006) A study of local search algorithms for the biobjective QAP with correlated flow matrices. Eur J Oper Res 169(3):943\u2013959","journal-title":"Eur J Oper Res"},{"key":"588_CR22","doi-asserted-by":"crossref","unstructured":"Pardalos P, Rendl F, Wolkowicz H (1994) The quadratic assignment problem: a survey and recent developments. In: Proceedings of the DIMACS workshop on quadratic assignment problems, volume 16 of DIMACS series in discrete mathematics and theoretical computer science, pp 1\u201342","DOI":"10.1090\/dimacs\/016\/01"},{"issue":"3","key":"588_CR23","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni S, Gonzalez T (1976) P-complete approximation problems. J ACM 23(3):555\u2013565","journal-title":"J ACM"},{"key":"588_CR24","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64:278\u2013285","journal-title":"Eur J Oper Res"},{"key":"588_CR25","unstructured":"Zhang Q, Li H (2006) A multiobjective evolutionary algorithm based on decomposition. Technical report TIK-report CSM-450, Department of Computer Science, University of Essex"},{"key":"588_CR26","doi-asserted-by":"crossref","unstructured":"Zitzler E, K\u00fcnzli S (2004) Indicator-based selection in multiobjective search. In 8th international conference on parallel problem solving from nature (PPSN VIII), pp 832\u2013842, Birmingham, UK, September","DOI":"10.1007\/978-3-540-30217-9_84"},{"key":"588_CR27","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. Evol Comput 3:257\u2013271","journal-title":"Evol Comput"},{"issue":"2","key":"588_CR28","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, Foneseca CM, Grunert da Fonseca V (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7(2):117\u2013132","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-011-0588-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-011-0588-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-011-0588-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T03:37:44Z","timestamp":1560137864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-011-0588-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,19]]},"references-count":28,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["588"],"URL":"https:\/\/doi.org\/10.1007\/s00521-011-0588-4","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,19]]}}}