论文信息 - A smoothed dynamic tabu search embedded GRASP for m-VRPTW

A smoothed dynamic tabu search embedded GRASP for m-VRPTW

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.

Andrew Lim | Fan Wang | A. Lim | Fan Wang

[1] Hoong Chuin Lau,et al. Vehicle routing problem with time windows and a limited number of vehicles , 2003, Eur. J. Oper. Res..

[2] Jean-Yves Potvin,et al. An Exchange Heuristic for Routeing Problems with Time Windows , 1995 .

[3] Joris van de Klundert,et al. Lifting valid inequalities for the precedence constrained knapsack problem , 1999, Math. Program..

[4] Ibrahim H. Osman,et al. Hybrid Genetic Algorithm, Simulated Annealing and Tabu Search Methods for Vehicle Routing Problems with Time Windows , 1997 .

[5] Patrick Prosser,et al. Guided Local Search for the Vehicle Routing Problem , 1997 .

[6] Wen-Chyuan Chiang,et al. A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows , 1997, INFORMS J. Comput..

[7] Andrew Lim,et al. Improved GRASP with Tabu Search for Vehicle Routing with Both Time Window and Limited Number of Vehicles , 2004, IEA/AIE.

[8] M. Resende,et al. GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES (GRASP) , 1999 .

[9] M. Savelsbergh. An efficient implementation of local search algorithms for constrained routing problems , 1990 .

[10] Yves Rochat,et al. Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.