Please use this identifier to cite or link to this item:
|Title:||An assignment-based local search method for solving vehicle routing problems||Authors:||Zeng, L.
Vehicle routing problem
|Issue Date:||Mar-2005||Citation:||Zeng, L., Ong, H.L., Ng, K.M. (2005-03). An assignment-based local search method for solving vehicle routing problems. Asia-Pacific Journal of Operational Research 22 (1) : 85-104. ScholarBank@NUS Repository. https://doi.org/10.1142/S0217595905000479||Abstract:||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. © World Scientific Publishing Co. & Operational Research Society of Singapore.||Source Title:||Asia-Pacific Journal of Operational Research||URI:||http://scholarbank.nus.edu.sg/handle/10635/63000||ISSN:||02175959||DOI:||10.1142/S0217595905000479|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 14, 2019
WEB OF SCIENCETM
checked on Oct 7, 2019
checked on Oct 13, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.