{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T22:35:00Z","timestamp":1768516500254,"version":"3.49.0"},"reference-count":44,"publisher":"MIT Press","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Evolutionary Computation"],"published-print":{"date-parts":[[2020,6]]},"abstract":"<jats:p> The uncertain capacitated arc routing problem is of great significance for its wide applications in the real world. In the uncertain capacitated arc routing problem, variables such as task demands and travel costs are realised in real time. This may cause the predefined solution to become ineffective and\/or infeasible. There are two main challenges in solving this problem. One is to obtain a high-quality and robust baseline task sequence, and the other is to design an effective recourse policy to adjust the baseline task sequence when it becomes infeasible and\/or ineffective during the execution. Existing studies typically only tackle one challenge (the other being addressed using a naive strategy). No existing work optimises the baseline task sequence and recourse policy simultaneously. To fill this gap, we propose a novel proactive-reactive approach, which represents a solution as a baseline task sequence and a recourse policy. The two components are optimised under a cooperative coevolution framework, in which the baseline task sequence is evolved by an estimation of distribution algorithm, and the recourse policy is evolved by genetic programming. The experimental results show that the proposed algorithm, called Solution-Policy Coevolver, significantly outperforms the state-of-the-art algorithms to the uncertain capacitated arc routing problem for the ugdb and uval benchmark instances. Through further analysis, we discovered that route failure is not always detrimental. Instead, in certain cases (e.g., when the vehicle is on the way back to the depot) allowing route failure can lead to better solutions. <\/jats:p>","DOI":"10.1162\/evco_a_00256","type":"journal-article","created":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T15:08:16Z","timestamp":1556032096000},"page":"289-316","source":"Crossref","is-referenced-by-count":42,"title":["A Predictive-Reactive Approach with Genetic Programming and Cooperative Coevolution for the Uncertain Capacitated Arc Routing Problem"],"prefix":"10.1162","volume":"28","author":[{"given":"Yuxin","family":"Liu","sequence":"first","affiliation":[{"name":"College of Information Engineering, Shanghai Maritime University, Shanghai 201306, China; College of Computer & Information Science, Southwest University, Chongqing 400715, China; School of Engineering and Computer Science, Victoria University of Wellington, PO Box 600, Wellington 6140, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Mei","sequence":"additional","affiliation":[{"name":"School of Engineering and Computer Science, Victoria University of Wellington, PO Box 600, Wellington 6140, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Engineering and Computer Science, Victoria University of Wellington, PO Box 600, Wellington 6140, New Zealand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zili","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Computer & Information Science, Southwest University, Chongqing 400715, China; School of Information Technology, Deakin University, Locked Bag 20000, Geelong VIC 3220, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"281","reference":[{"key":"B1","doi-asserted-by":"publisher","DOI":"10.1016\/j.wasman.2004.01.008"},{"key":"B2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.02.013"},{"key":"B3","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-014-9719-z"},{"key":"B4","first-page":"64:88","author":"Chen L.","year":"2014","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"B5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.02.015"},{"key":"B6","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2009.05.008"},{"key":"B7","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2006.12.009"},{"key":"B8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011253011638"},{"key":"B9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4495-1"},{"key":"B10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cirpj.2009.10.001"},{"key":"B11","first-page":"501","author":"Fleury G.","year":"2004","journal-title":"Evolutionary algorithms for stochastic arc routing problems"},{"key":"B12","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601822"},{"key":"B13","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2016.0709"},{"key":"B14","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110308"},{"key":"B15","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2006.1597056"},{"key":"B16","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-006-0033-z"},{"key":"B17","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810067"},{"key":"B18","volume-title":"Stochastic programming","author":"Kall P.","year":"1994"},{"key":"B19","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1057625"},{"key":"B20","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000039517.35989.6d"},{"key":"B21","doi-asserted-by":"publisher","DOI":"10.1080\/07408179408966626"},{"key":"B22","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071185"},{"key":"B23","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281503"},{"key":"B24","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5586031"},{"key":"B25","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2051446"},{"key":"B26","author":"Montemanni R.","year":"2002","journal-title":"A new algorithm for a dynamic vehicle routing problem based on ant colony system"},{"key":"B27","first-page":"3053","volume-title":"IEEE Congress on Evolutionary Computation","author":"Nguyen S.","year":"2016"},{"key":"B28","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-017-0036-x"},{"key":"B29","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2227326"},{"key":"B30","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-008-0090-8"},{"key":"B31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.08.015"},{"key":"B32","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568086"},{"key":"B33","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1090.0295"},{"key":"B34","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1043403"},{"key":"B35","author":"Salavati-Khoshghalb M.","year":"2017","journal-title":"A hybrid recourse policy for the vehicle routing problem with stochastic demands"},{"key":"B36","author":"Salavati-Khoshghalb M.","year":"2017","journal-title":"A rule-based recourse for the vehicle routing problem with stochastic demands"},{"key":"B37","doi-asserted-by":"publisher","DOI":"10.1287\/opre.49.5.796.10608"},{"key":"B38","first-page":"298:198","author":"Shen X.-N.","year":"2015","journal-title":"Information Sciences"},{"key":"B39","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2010.02.003"},{"key":"B40","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2023449"},{"key":"B41","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2428616"},{"key":"B42","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2013.6608210"},{"key":"B43","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330278"},{"key":"B44","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2033578"}],"container-title":["Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mitpressjournals.org\/doi\/pdf\/10.1162\/evco_a_00256","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T21:59:10Z","timestamp":1615586350000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/evco\/article\/28\/2\/289-316\/94987"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["10.1162\/evco_a_00256"],"URL":"https:\/\/doi.org\/10.1162\/evco_a_00256","relation":{},"ISSN":["1063-6560","1530-9304"],"issn-type":[{"value":"1063-6560","type":"print"},{"value":"1530-9304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6]]}}}