Please use this identifier to cite or link to this item:
|Title:||A generalized crossing local search method for solving vehicle routing problems||Authors:||Zeng, L.
Vehicle routing problem
|Issue Date:||Apr-2007||Citation:||Zeng, L., Ong, H.L., Ng, K.M. (2007-04). A generalized crossing local search method for solving vehicle routing problems. Journal of the Operational Research Society 58 (4) : 528-532. ScholarBank@NUS Repository. https://doi.org/10.1057/palgrave.jors.2602171||Abstract:||In this paper, we propose a generalized crossing local search method for solving vehicle routing problems. This method is a generalization of the string crossing method described in the literature. 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.||Source Title:||Journal of the Operational Research Society||URI:||http://scholarbank.nus.edu.sg/handle/10635/54201||ISSN:||01605682||DOI:||10.1057/palgrave.jors.2602171|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.