{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:58:50Z","timestamp":1761807530609,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1109\/coase.2009.5234190","type":"proceedings-article","created":{"date-parts":[[2009,9,11]],"date-time":"2009-09-11T18:10:59Z","timestamp":1252692659000},"page":"543-548","source":"Crossref","is-referenced-by-count":36,"title":["Heuristic for lane reservation problem in time constrained transportation"],"prefix":"10.1109","author":[{"given":"Yingfeng","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengbin","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naiqi","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jtrangeo.2003.12.001"},{"key":"15","first-page":"1","article-title":"transportation problem: a special case for linear programming problems","volume":"8779","author":"reed","year":"2002","journal-title":"Operations Research"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.22.1.1"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00172-0"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00301-4"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00363-6"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.5.835"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1030.0056"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1060.0156"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.06.060"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.5.803"},{"key":"7","first-page":"65","author":"desrochers","year":"1988","journal-title":"Vehicle routing with Time Windows Optimization and Approximation Methods and Studies"},{"key":"6","first-page":"77","article-title":"route elimination heuristic for vehicle routing problem with time windows","volume":"2","author":"csisza?r","year":"2005","journal-title":"Acta Polytechnica Hungarica"},{"key":"5","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1137\/0720013","article-title":"estimation of sparse jacobian matrices and graph coloring problems","volume":"20","author":"coleman","year":"1983","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1030.0057"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00085-9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.10.036"}],"event":{"name":"2009 IEEE International Conference on Automation Science and Engineering (CASE 2009)","start":{"date-parts":[[2009,8,22]]},"location":"Bangalore, India","end":{"date-parts":[[2009,8,25]]}},"container-title":["2009 IEEE International Conference on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5227795\/5234081\/05234190.pdf?arnumber=5234190","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T23:38:44Z","timestamp":1497829124000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5234190\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/coase.2009.5234190","relation":{},"subject":[],"published":{"date-parts":[[2009,8]]}}}