loading...
A Smoothed Dynamic Tabu Search Embedded GRASP for m-VRPTW
Boca Raton, Florida November 15-November 17
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICTAI.2004.1716th IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Andrew Lim, Hong Kong University of Science and Technology
Fan Wang, Hong Kong University of Science and Technology
Vehicle Routing Problem with Both Time Window and Limited Number of Vehicles (m-VRPTW) is an useful extension of VRPTW problem in real applications. We propose an improved Greedy Randomized Adaptive Search Procedure (GRASP) framework by techniques including multiple initialization and solution reuse. Furthermore, a new technique of smoothed dynamic tabu search is embedded into the GRASP to improve the performance. The experimental results for benchmark data show that the new algorithm can solve the m-VRPTW problem better than the published algorithm in accuracy.
Citation:
Andrew Lim, Fan Wang, "A Smoothed Dynamic Tabu Search Embedded GRASP for m-VRPTW," ictai, pp.704-708, 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.