{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T01:41:32Z","timestamp":1730252492615,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1109\/icnsc.2018.8361368","type":"proceedings-article","created":{"date-parts":[[2018,5,21]],"date-time":"2018-05-21T20:07:01Z","timestamp":1526933221000},"page":"1-6","source":"Crossref","is-referenced-by-count":3,"title":["A hybrid algorithm for the vehicle routing problem with compatibility constraints"],"prefix":"10.1109","author":[{"given":"Can","family":"Liu","sequence":"first","affiliation":[]},{"given":"Zizhen","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xinxin","family":"Su","sequence":"additional","affiliation":[]},{"given":"Hu","family":"Qin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1120.0499"},{"key":"ref11","first-page":"1","article-title":"Optimization algorithms for the disjunctively constrained knapsack problem","author":"ben salem","year":"2016","journal-title":"Soft Computing"},{"key":"ref12","article-title":"Max-min ant system and local search for the traveling salesman problem","author":"st\u00fctzle","year":"1997","journal-title":"IEEE International Conference on Evolutionary Computation (ICEC)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59776-8_20"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3182\/20110828-6-IT-1002.01565"},{"key":"ref3","article-title":"An iterated local search for the vehicle routing problem with conflicts","author":"hamdi","year":"2010","journal-title":"8th International Conference of Modeling and Simulation (MOSIM 2010)"},{"key":"ref6","first-page":"485","article-title":"A memetic algorithm for waste collection vehicle routing problem with time windows and conflicts","author":"tieu minh","year":"2013","journal-title":"International Conference on Computational Science and its Applications"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90192-C"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00186"},{"journal-title":"Augerat P Vrp problem instances","year":"1995","key":"ref7"},{"key":"ref2","volume":"57","author":"glover","year":"2006","journal-title":"Handbook of Metaheuristics"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00195-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IEEM.2009.5373342"}],"event":{"name":"2018 IEEE 15th International Conference on Networking, Sensing and Control (ICNSC)","start":{"date-parts":[[2018,3,27]]},"location":"Zhuhai","end":{"date-parts":[[2018,3,29]]}},"container-title":["2018 IEEE 15th International Conference on Networking, Sensing and Control (ICNSC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8358983\/8361215\/08361368.pdf?arnumber=8361368","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T23:58:12Z","timestamp":1643155092000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8361368\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/icnsc.2018.8361368","relation":{},"subject":[],"published":{"date-parts":[[2018,3]]}}}