{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:30:33Z","timestamp":1759177833019},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642371394"},{"type":"electronic","value":"9783642371400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37140-0_17","type":"book-chapter","created":{"date-parts":[[2013,3,12]],"date-time":"2013-03-12T11:18:19Z","timestamp":1363087099000},"page":"185-199","source":"Crossref","is-referenced-by-count":1,"title":["Hypervolume-Based Multi-Objective Path Relinking Algorithm"],"prefix":"10.1007","author":[{"given":"Rong-Qiang","family":"Zeng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthieu","family":"Basseur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10732-011-9178-y","volume":"18","author":"M. Basseur","year":"2012","unstructured":"Basseur, M., Liefooghe, A., Le, K., Burke, E.: The efficiency of indicator-based local search for multi-objective combinatorial optimisation problems. Journal of Heuristics\u00a018(2), 263\u2013296 (2012)","journal-title":"Journal of Heuristics"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-540-31880-4_9","volume-title":"Evolutionary Multi-Criterion Optimization","author":"M. Basseur","year":"2005","unstructured":"Basseur, M., Seynhaeve, F., Talbi, E.-G.: Path Relinking in Pareto Multi-objective Genetic Algorithms. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol.\u00a03410, pp. 120\u2013134. Springer, Heidelberg (2005)"},{"issue":"8","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1007\/s00521-011-0588-4","volume":"21","author":"M. Basseur","year":"2012","unstructured":"Basseur, M., Zeng, R.Q., Hao, J.K.: Hypervolume-based multi-objective local search. Neural Computing and Applications\u00a021(8), 1917\u20131929 (2012)","journal-title":"Neural Computing and Applications"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/3-540-36970-8_41","volume-title":"Evolutionary Multi-Criterion Optimization","author":"C. Brizuela","year":"2003","unstructured":"Brizuela, C., Aceves, R.: Experimental Genetic Operators Analysis for the Multi-objective Permutation Flowshop. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol.\u00a02632, pp. 578\u2013592. Springer, Heidelberg (2003)"},{"key":"17_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press, Cambrige (1990)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-642-15844-5_49","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"M.M. Drugan","year":"2010","unstructured":"Drugan, M.M., Thierens, D.: Path-Guided Mutation for Stochastic Pareto Local Search Algorithms. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol.\u00a06238, pp. 485\u2013495. Springer, Heidelberg (2010)"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J. Du","year":"1990","unstructured":"Du, J., Leung, J.Y.-T.: Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research\u00a015, 483\u2013495 (1990)","journal-title":"Mathematics of Operations Research"},{"key":"17_CR8","first-page":"653","volume":"29","author":"F. Glover","year":"1999","unstructured":"Glover, F., Laguna, M.: Fundamentals of scatter search and path relinking. Control and Cybernetics\u00a029, 653\u2013684 (1999)","journal-title":"Control and Cybernetics"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.ejor.2007.07.035","volume":"199","author":"L. Jourdan","year":"2009","unstructured":"Jourdan, L., Basseur, M., Talbi, E.: Hybridizing exact methods and metaheuristics: A taxonomy. European Journal of Operational Research\u00a0199(3), 620\u2013629 (2009)","journal-title":"European Journal of Operational Research"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"E.M. Loiola","year":"2007","unstructured":"Loiola, E.M., de Abreu, N.M.M., Boaventura-Netto, P.O., Querido, P., Querido, T.: A survey for the quadratic assignment problem. European Journal of Operational Reasearch\u00a0176, 657\u2013690 (2007)","journal-title":"European Journal of Operational Reasearch"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Pardalos, P., Rendl, F., Wolkowicz, H.: The quadratic assignment problem: A survey and recent developments. In: Proceedings of the DIMACS Workshop on Quadratic Assignment Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a016, pp. 1\u201342 (1994)","DOI":"10.1090\/dimacs\/016\/01"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-540-70928-2_39","volume-title":"Evolutionary Multi-Criterion Optimization","author":"J.M. Pasia","year":"2007","unstructured":"Pasia, J.M., Gandibleux, X., Doerner, K.F., Hartl, R.F.: Local Search Guided by Path Relinking and Heuristic Bounds. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol.\u00a04403, pp. 501\u2013515. Springer, Heidelberg (2007)"},{"issue":"10","key":"17_CR14","doi-asserted-by":"publisher","first-page":"3143","DOI":"10.1016\/j.cor.2005.11.022","volume":"34","author":"T. Schiavinotto","year":"2011","unstructured":"Schiavinotto, T., St\u00fctzle, T.: A review of metrics on permutations for search landscape analysis. Computers and Operations Research\u00a034(10), 3143\u20133153 (2011)","journal-title":"Computers and Operations Research"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"E. Taillard","year":"1990","unstructured":"Taillard, E.: Some efficient heuristic methods for flow-shop sequencing. European Journal of Operational Research\u00a047, 65\u201374 (1990)","journal-title":"European Journal of Operational Research"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E. Taillard","year":"1991","unstructured":"Taillard, E.: Robust taboo search for the quadratic assignment problem. Parallel Computing\u00a017, 443\u2013455 (1991)","journal-title":"Parallel Computing"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research\u00a064, 278\u2013285 (1993)","journal-title":"European Journal of Operational Research"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1007\/11844297_104","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"D. Thierens","year":"2006","unstructured":"Thierens, D.: Exploration and Exploitation Bias of Crossover and Path Relinking for Permutation Problems. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) PPSN IX. LNCS, vol.\u00a04193, pp. 1028\u20131037. Springer, Heidelberg (2006)"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E. Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. Evolutionary Computation\u00a03, 257\u2013271 (1999)","journal-title":"Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37140-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T14:21:53Z","timestamp":1557584513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37140-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642371394","9783642371400"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37140-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}