{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:15:59Z","timestamp":1729660559206,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1109\/nabic.2010.5716362","type":"proceedings-article","created":{"date-parts":[[2011,2,18]],"date-time":"2011-02-18T14:03:54Z","timestamp":1298037834000},"page":"534-539","source":"Crossref","is-referenced-by-count":1,"title":["Two-phase heuristic for Capacitated Vehicle Routing Problem"],"prefix":"10.1109","author":[{"family":"Hai Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Yunlong Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Li Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Wenping Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","article-title":"Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem","author":"augerat","year":"1995","journal-title":"Research report 949-M"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSA.2007.11"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2005.09.040"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2005.12.002"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85072-4_19"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-008-0185-2"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.01.072"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1007\/3-540-45105-6_80","article-title":"A Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem","author":"berger","year":"2003","journal-title":"Proceedings of the 2003 international conference on Genetic and evolutionary computation PartI"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2008.06.012"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1631\/jzus.2006.A0607","article-title":"Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem","volume":"7","author":"chen","year":"2006","journal-title":"Journal of Zhejiang University SCIENCE A"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-008-0136-9"},{"journal-title":"Adaptation in Natural and Artificial Systems","year":"1975","author":"holland","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90192-C"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICIME.2009.46"},{"journal-title":"The Vehicle Routing Problem SIAM Monographs on Discrete Mathematics and Applications","year":"2001","author":"toth","key":"ref3"},{"key":"ref6","first-page":"109","article-title":"Classical Heuristics for the Capacitated VRP","author":"laporte","year":"2001","journal-title":"The Vehicle Routing Problem SIAM Monographs on Discrete Mathematics and Applications"},{"key":"ref29","first-page":"235","article-title":"Genetic algorithm for vehicle scheduling problem with non-full load","volume":"20","author":"li","year":"2000","journal-title":"System Engineering - Theory Methodology Applications Institute of Systems Engineering of Shanghai Jiaotong University"},{"key":"ref5","first-page":"205","article-title":"Vehicle routing problem: Models and solutions","volume":"4","author":"liong","year":"2008","journal-title":"Journal of Quality Measurement and Analysis"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.11.060"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2000.tb00200.x"},{"journal-title":"Analysis of Heuristics for Vehicle Routing Problems In Vehicle routing methods and studies","year":"1988","author":"haimovich","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-008-0236-7"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.80"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28646-2_42"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.06.047"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-540-24652-7_8","article-title":"Parallel Ant Systems for the Capacitated Vehicle Routing Problem","volume":"3004","author":"doerner","year":"2004","journal-title":"Lecture Notes in Computer Science"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10100-008-0062-2"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85984-0_31"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-88843-9_17"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71615-0_9"}],"event":{"name":"2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC 2010)","start":{"date-parts":[[2010,12,15]]},"location":"Fukuoka","end":{"date-parts":[[2010,12,17]]}},"container-title":["2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5710537\/5716265\/05716362.pdf?arnumber=5716362","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T15:57:36Z","timestamp":1497887856000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5716362\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/nabic.2010.5716362","relation":{},"subject":[],"published":{"date-parts":[[2010,12]]}}}