Please use this identifier to cite or link to this item:
|Title:||A comparative study of metaheuristics for vehicle routing problem with stochastic demands||Authors:||Teng, S.
Vehicle routing problem
|Issue Date:||May-2003||Citation:||Teng, S.,Ong, H.L.,Huang, H.C. (2003-05). A comparative study of metaheuristics for vehicle routing problem with stochastic demands. Asia-Pacific Journal of Operational Research 20 (1) : 103-119. ScholarBank@NUS Repository.||Abstract:||The vehicle routing problem with stochastic demands (VRPSD) is usually modeled as a stochastic program with recourse (SPR). In this paper, we present three metaheuristics, simulated annealing (SA), threshold accepting (TA) and tabu search (TS) for this problem. Based on the same neighborhood structure, a comparative study is carried out to compare the performance of these three metaheuristics. Computational results show that the solution quality of the TS outperforms the other heuristics for all the problems tested. With respect to computational time, metaheuristics are much more time consuming as compared to other local search heuristics. However, when comparing TS with SA, it takes less computational time. Though TA is the least time consuming one, its solution quality is not as good.||Source Title:||Asia-Pacific Journal of Operational Research||URI:||http://scholarbank.nus.edu.sg/handle/10635/53975||ISSN:||02175959|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 9, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.