{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:24:27Z","timestamp":1760707467159},"reference-count":17,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2005,3]]},"abstract":"<jats:p> In this paper, we propose an assignment-based local search method for solving vehicle routing problems. This method is a multi-route improvement algorithm that can operate on several routes at a time. To evaluate the performance of the proposed method, extensive computational experiments on the proposed method applied to a set of benchmark problems are carried out. The results show that the proposed method, when coupled with metaheuristics such as simulated annealing, is comparable with other efficient heuristic methods proposed in the literature. <\/jats:p>","DOI":"10.1142\/s0217595905000479","type":"journal-article","created":{"date-parts":[[2005,3,4]],"date-time":"2005-03-04T05:27:59Z","timestamp":1109914079000},"page":"85-104","source":"Crossref","is-referenced-by-count":8,"title":["AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS"],"prefix":"10.1142","volume":"22","author":[{"given":"L.","family":"ZENG","sequence":"first","affiliation":[{"name":"Department of Industrial and Systems Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260, Singapore"}]},{"given":"H. L.","family":"ONG","sequence":"additional","affiliation":[{"name":"Department of Industrial and Systems Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260, Singapore"}]},{"given":"K. M.","family":"NG","sequence":"additional","affiliation":[{"name":"Department of Industrial and Systems Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260, Singapore"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","first-page":"63","volume":"10","author":"Bodin L. D.","journal-title":"Computers and Operations Research"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600595"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00064-J"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1969.75"},{"key":"rf5","unstructured":"N.\u00a0Christofides, A.\u00a0Mingozzi and P.\u00a0Toth, Combinational Optimization, eds. N.\u00a0Christofides (Wiley, Chichester UK, 1979)\u00a0pp. 315\u2013338."},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02278710"},{"key":"rf8","unstructured":"G. A. P.\u00a0Kinderwater and M. W. P.\u00a0Savelsbergh, Local Search in Combinatorial Optimization, eds. E. H. L.\u00a0Aarts and J. K.\u00a0Lenstra (Wiley, Chichester, UK, 1997)\u00a0pp. 337\u2013360."},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1965.tb04146.x"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515.ch5"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02023004"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1137\/0206041"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230170405"},{"key":"rf16","first-page":"103","volume":"20","author":"Teng S. Y.","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.5.935"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595905000479","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T18:42:59Z","timestamp":1565116979000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0217595905000479"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":17,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2005,3]]}},"alternative-id":["10.1142\/S0217595905000479"],"URL":"https:\/\/doi.org\/10.1142\/s0217595905000479","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,3]]}}}