Abstract
The NP-Hard Vehicle Routing Problem with Time Windows (VRPTW) is one of the major transportation problems. In this paper, a Greedy Randomized Adaptive Search Procedure (GRASP) for VRPTW is discussed for minimizing the fleet size and the travel distance. There are two phases within each GRASP iteration: construction phase and local search phase. In the construction phase, the initial solution is computed by applying an adaptive randomized greedy function. In the local search phase, the search procedure is applied to the constructed initial solution obtained by the construction phase for an improvement. In this paper, we propose an improved solution technique by using new local search ideas and new lower bounding procedures. In addition, we report computational results and address some practical issues in this area.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E.K. Baker and J.R. Schaffer, “Solution improvement heuristics for the vehicle routing problem with time window constraints,” American Journal of Mathematical and Management Sciences, vol. 6, pp. 261–300, 1988.
J.E. Beasley, A. Lucena, and M.P. de Araqão, “The vehicle routing problem,” in P.M. Pardalos and M.G.C. Resende (Eds.), Handbook of Applied Optimization, Part Two: Applications, Oxford University Press, 2002.
W. Chiang and R. Russell, “A reactive tabu search methaheuristic for the vehicle routing problem with time windows,” INFORMS Journal on Computing, vol. 9, pp. 417–430, 1997.
N. Christofides, A. Mingozzi, and P. Toth, “State space relaxation procedures for the computation of bounds to routing problems,” Networks, vol. 11, pp. 145–164, 1981.
M. Desrochers, J. Desrosiers, and M.M. Solomon, “A new optimization algorithm for the vehicle routing problem with time windows,” Operations Research, vol. 40, pp. 342–354, 1992.
J. Desrosiers, Y. Dumas, M. Solomon, and F. Soumis, “Time constrained routing and scheduling,” in M. Ball, T. Magnanti, M. Monma, and G. Nemhauser (Eds.), Handbooks in Operations Research and Management Science, Network Routing, vol. 8, North-Holland, Amsterdam, pp. 35–139, 1995.
M. Desrochers, J.K. Lenstra, M.W.P. Savelsbergh, and F. Soumis, “Vehicle routing with time windows: Optimization and approximation,” in B.L. Golden and A.A. Assad (Eds.), Vehicle Routing: Methods and Studies, North-Holland, Amsterdam, pp. 65–84, 1988.
T.A. Feo and M.G.C. Resende, “Greedy randomized adaptive search procedures,” Journal of Global Optimization, vol. 6, pp. 109–133, 1995.
M.L. Fisher, “Optimal solution of vehicle routing problems using minimum K-Trees,” Operations Research, vol. 42, pp. 626–642, 1994.
J. Homberger and H. Gehring, “Two evolutionary metaheuristics for the vehicle routing problem with time windows,” INFOR, vol. 37, pp. 296–318, 1999.
K. Jorsten, O.B.G. Madsen, and B. Sorensen, “Exact solution of the vehicle routing and scheduling problem with time windows by variable splitting,” Research Report 5/1986, IMSOR, The Technical University of Denmark, Lyngby, Denmark, 1986.
N. Kohl and O.B.G. Madsen, “An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation,” Operations Research, vol. 45, pp. 395–406, 1997.
A.W.J. Kolen, A.H.G.R. Kan, and H.W.J.M. Trienekens, “Vehicle routing with time windows,” Operations Research, vol. 35, pp. 266–273, 1987.
G. Kontoravdis and J.F. Bard, “A GRASP for the vehicle routing problem with time windows,” ORSA Journal of Computing, vol. 7, pp. 10–23, 1995.
J. Lenstra and R.A. Kan, “Complexity of vehicle routing and scheduling problems,” Networks, vol. 11, pp. 221–227, 1981.
Y. Li, P.M. Pardalos, and M.G.C. Resende, “A greedy randomized adaptive search procedure for the quadratic assignment problem,” in P.M. Pardalos and H. Wolkowicz (Eds.), Quadratic Assignment and Related Problems, vol. 16 of DIMACS series on Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, pp. 237–261, 1994.
F.F. Lui and S. Shen, “A route-neighborhood-based metaheuristic for vehicle routing problem with time windows,” European Journal of Operational Research, vol. 118, pp. 485–504, 1999.
O.B.G. Madsen, “Lagrangian relaxation and vehicle routing,” Working Paper, IMSOR, The Technical University of Denmark, Lyngby, Denmark, 1990.
V. Nissen, Evolutionare Algorithmen, Deutscher Universitats-Verlag, Wiesbaden, 1994.
J. Potvin and J. Rousseau, “A parallel route building algorithms for the vehicle routing and scheduling problem with time windows,” European Journal of Operational Research, vol. 66, pp. 331–340, 1993.
J. Potvin and J. Rousseau, “An exchange heuristic for routing problems with time windows,” Journal of the Operational Research Society, vol. 46, pp. 1433–1446, 1995.
I. Rechenberg, Evolutionsstrategic, Fromman-Holzboog, Stuttgart, 1973.
M.G.C. Resende, “Computing approximate solutions of the maximum covering problem using GRASP,” Journal of Heuristics, vol. 4, pp. 161–171, 1998.
R.A. Russell, “Hybrid heuristics for the vehicle routing problem with time windows,” Transportation Science, vol. 29, pp. 156–166, 1995.
M. Savelbergh, “Computer aided routing,” in Centrum voor Wiskunde en Informatica, Amsterdam, 1988.
M. Savelbergh, “The vehicle routing problem with time windows: Minimizing route duration,” ORSA Journal on Computing, vol. 4, pp. 146–154, 1992.
H.P. Schwefel, Numberische Optimierung von Computer-Modellen mittels der Evolutions-strategic, Birkauser, Basel, 1977.
M. Solomon and J. Desrosiers, “Time window constrained routing and scheduling problems,” Transportation Science, vol. 22, pp. 1–13, 1988.
S.R. Thangiah, K.E. Nygard, and P.L. Juell, “A genetic algorithm system for vehicle routing with time windows,” in Preceedings of the 7th Conference on Artificial Intelligence for Applications, IEEE Press, Miami, FL, pp. 322–328, 1991.
S.R. Thangiah, I.H. Osman, and T. Sun, “Hybrid genetic algorithms, simulated annealing and tabu search methods for vehicle routing problems with time windows,” Technical Report, Institute of Mathematics and Statistics, University of Kent, Canterbury, UK, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chaovalitwongse, W., Kim, D. & Pardalos, P.M. GRASP with a New Local Search Scheme for Vehicle Routing Problems with Time Windows. Journal of Combinatorial Optimization 7, 179–207 (2003). https://doi.org/10.1023/A:1024427114516
Issue Date:
DOI: https://doi.org/10.1023/A:1024427114516