{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T09:47:56Z","timestamp":1724665676473},"reference-count":38,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T00:00:00Z","timestamp":1550448000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Networks"],"published-print":{"date-parts":[[2019,6]]},"abstract":"Abstract<\/jats:title>After decades of intensive research on the vehicle routing problem (VRP), many highly efficient single\u2010objective heuristics exist for a multitude of VRP variants. But when new side\u2010objectives emerge\u2014such as service quality, workload balance, pollution reduction, consistency\u2014the prevailing approach has been to develop new, problem\u2010specific, and increasingly complex multiobjective (MO) methods. Yet in principle, MO problems can be efficiently solved with existing single\u2010objective solvers. This is the fundamental idea behind the well\u2010known \u03f5<\/jats:italic>\u2010constraint method (ECM). Despite its generality and conceptual simplicity, the ECM has been largely ignored in the domain of heuristics and remains associated mostly with exact algorithms.<\/jats:p>In this article, we dispel these preconceptions and demonstrate that \u03f5<\/jats:italic>\u2010constraint\u2010based frameworks can be a highly effective way to directly leverage the decades of research on single\u2010objective VRP heuristics in emerging MO settings.<\/jats:p>","DOI":"10.1002\/net.21876","type":"journal-article","created":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T14:45:52Z","timestamp":1550501152000},"page":"382-400","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Leveraging single\u2010objective heuristics to solve bi\u2010objective problems: Heuristic box splitting and its application to vehicle routing"],"prefix":"10.1002","volume":"73","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-8584-3140","authenticated-orcid":false,"given":"Piotr","family":"Matl","sequence":"first","affiliation":[{"name":"Department of Business Decisions and Analytics, University of Vienna Wien Austria"}]},{"given":"Richard F.","family":"Hartl","sequence":"additional","affiliation":[{"name":"Department of Business Decisions and Analytics, University of Vienna Wien Austria"}]},{"given":"Thibaut","family":"Vidal","sequence":"additional","affiliation":[{"name":"Pontifical Catholic University of Rio de Janeiro Rio de Janeiro Brazil"}]}],"member":"311","published-online":{"date-parts":[[2019,2,18]]},"reference":[{"key":"e_1_2_7_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2015.0657"},{"key":"e_1_2_7_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10100-008-0062-2"},{"key":"e_1_2_7_4_1","doi-asserted-by":"crossref","unstructured":"M.Boudia C.Prins andM.Reghioui An effective memetic algorithm with population management for the split delivery vehicle routing problem International Workshop on Hybrid Metaheuristics Springer 2007 pp. 16\u201330.","DOI":"10.1007\/978-3-540-75514-2_2"},{"key":"e_1_2_7_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.07.028"},{"key":"e_1_2_7_6_1","first-page":"315","volume-title":"Combinatorial Optimization","author":"Christofides N.","year":"1979"},{"key":"e_1_2_7_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21748"},{"key":"e_1_2_7_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2006.03.019"},{"key":"e_1_2_7_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/13658810410001705307"},{"key":"e_1_2_7_10_1","doi-asserted-by":"crossref","unstructured":"N.Jozefowiez F.Semet andE.\u2010G.Talbi Parallel and hybrid models for multi\u2010objective optimization: Application to the vehicle routing problem Parallel Problem Solving from Nature\u00a0\u2013\u00a0PPSN VII Springer 2002 pp. 271\u2013280.","DOI":"10.1007\/3-540-45712-7_26"},{"key":"e_1_2_7_11_1","doi-asserted-by":"crossref","unstructured":"N.Jozefowiez F.Semet andE.\u2010G.Talbi Enhancements of NSGA II and its application to the vehicle routing problem with route balancing Artificial Evolution Springer 2006 pp. 131\u2013142.","DOI":"10.1007\/11740698_12"},{"key":"e_1_2_7_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-007-9022-6"},{"key":"e_1_2_7_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.05.055"},{"key":"e_1_2_7_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.06.065"},{"key":"e_1_2_7_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21565"},{"key":"e_1_2_7_16_1","doi-asserted-by":"crossref","unstructured":"N.LabadieandC.Prodhon A survey on multi\u2010criteria analysis in logistics: Focus on vehicle routing problems Applications of Multi\u2010Criteria and Game Theory Approaches Springer 2014 pp. 3\u201329.","DOI":"10.1007\/978-1-4471-5295-8_1"},{"key":"e_1_2_7_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2014.10.024"},{"key":"e_1_2_7_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.08.029"},{"key":"e_1_2_7_19_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2013.17"},{"key":"e_1_2_7_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.07.107"},{"key":"e_1_2_7_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48056-5_11"},{"key":"e_1_2_7_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21730"},{"key":"e_1_2_7_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2017.0744"},{"key":"e_1_2_7_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-014-9251-4"},{"key":"e_1_2_7_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.05.017"},{"key":"e_1_2_7_26_1","doi-asserted-by":"crossref","unstructured":"J.M.Pasia K.F.Doerner R.F.Hartl andM.Reimann A population\u2010based local search for solving a bi\u2010objective vehicle routing problem Evolutionary Computation in Combinatorial Optimization Springer 2007 pp. 166\u2013175.","DOI":"10.1007\/978-3-540-71615-0_15"},{"key":"e_1_2_7_27_1","doi-asserted-by":"crossref","unstructured":"J.M.Pasia K.F.Doerner R.F.Hartl andM.Reimann.Solving a bi\u2010objective vehicle routing problem by Pareto\u2010ant colony optimization Engineering Stochastic Local Search Algorithms. Designing Implementing and Analyzing Effective Heuristics Springer 2007 pp. 187\u2013191.","DOI":"10.1007\/978-3-540-74446-7_15"},{"key":"e_1_2_7_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(03)00158-8"},{"key":"e_1_2_7_29_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207540802426599"},{"key":"e_1_2_7_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.11.019"},{"key":"e_1_2_7_31_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1120.0407"},{"key":"e_1_2_7_32_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.4.333.24890"},{"key":"e_1_2_7_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594"},{"key":"e_1_2_7_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.08.012"},{"key":"e_1_2_7_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.11.012"},{"key":"e_1_2_7_36_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2017.1595"},{"key":"e_1_2_7_37_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1048"},{"key":"e_1_2_7_38_1","doi-asserted-by":"crossref","unstructured":"E.Zitzler D.Brockhoff andL.Thiele The hypervolume indicator revisited: On the design of Pareto\u2010compliant indicators via weighted integration International Conference on Evolutionary Multi\u2010Criterion Optimization Springer 2007 pp. 862\u2013876.","DOI":"10.1007\/978-3-540-70928-2_64"},{"key":"e_1_2_7_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810758"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.21876","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.21876","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/net.21876","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.21876","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,10]],"date-time":"2023-09-10T10:57:19Z","timestamp":1694343439000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.21876"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,18]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["10.1002\/net.21876"],"URL":"https:\/\/doi.org\/10.1002\/net.21876","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,18]]},"assertion":[{"value":"2019-01-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-01-24","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-02-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}