A parametric analysis of heuristics for the vehicle routing problem with side-constraints

Abstract The behavior of the parameters of 10 heuristics for the vehicle routing problem (VRP) with side-constraints is analysed. Statistical analysis techniques are used to determine the significant effect of the heuristic parameters on the solution value. All analyses are performed on a huge test set containing 420 problems with specific geographical characteristics and including a variety of vehicle-related, customer-related and time-related constraints. A classification of the heuristic parameters is presented as a result of the analyses. The findings can be considered as a basis for the conception of automated systems capable of providing support in selecting an appropriate heuristic and its parameter value combinations for a VRP.

[1]  Marvin D. Nelson,et al.  Implementation techniques for the vehicle routing problem , 1985, Comput. Oper. Res..

[2]  P. C. Yellow,et al.  A Computational Modification to the Savings Method of Vehicle Scheduling , 1970 .

[3]  Alex Van Breedam,et al.  Comparing descent heuristics and metaheuristics for the vehicle routing problem , 2001, Comput. Oper. Res..

[4]  J. J. McDonald.  Vehicle Scheduling — A Case Study , 1972 .

[5]  Alex Van Breedam,et al.  An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-relatezd, customer-related, and time-related constraints , 1994 .

[6]  R. A. Holmes,et al.  A Vehicle Scheduling Procedure Based Upon Savings and a Solution Perturbation Scheme , 1976 .

[7]  Jean-Yves Potvin,et al.  Heuristic approaches to vehicle routing with backhauls and time windows , 1996, Comput. Oper. Res..

[8]  H. Paessens,et al.  The savings algorithm for the vehicle routing problem , 1988 .

[9]  R. H. Mole,et al.  A Survey of Local Delivery Vehicle Routing Methodology , 1979 .

[10]  Edward K. Baker,et al.  Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints , 1986 .

[11]  G. M. Buxey,et al.  The Vehicle Scheduling Problem and Monte Carlo Simulation , 1979 .

[12]  H. Van Landeghem,et al.  A bi-criteria heuristic for the vehicle routing problem with time windows , 1988 .

[13]  Nicos Christofides,et al.  Distribution management : mathematical modelling and practical analysis , 1971 .

[14]  T. J. Gaskell,et al.  Bases for Vehicle Fleet Scheduling , 1967 .

[15]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[16]  Bruce L. Golden,et al.  Evaluating a Sequential Vehicle Routing Algorithm , 1977 .

[17]  M. Czapaluk,et al.  Decyzje kapitałowe w małych przedsiębiorstwach we wczesnym okresie ich działalności , 2002 .

[18]  R. H. Mole,et al.  A Sequential Route-building Algorithm Employing a Generalised Savings Criterion , 1976 .

[19]  Warren B. Powell,et al.  An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints , 1992, Transp. Sci..

[20]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[21]  M. Goetschalckx,et al.  The vehicle routing problem with backhauls , 1989 .

[22]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[23]  Ibrahim Hassan Osman,et al.  Metastrategy : simulated annealing and tabu search for combinatorial optimization problems , 1991 .

[24]  Barrie M. Baker.  Further Inprovements to Vehicle Routeing Heuristics , 1992 .

[25]  J. Morgan,et al.  Problems in the Analysis of Survey Data, and a Proposal , 1963 .

[26]  Nicos Christofides,et al.  Combinatorial optimization , 1979 .

[27]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[28]  Robert Englebretson.  Searching for Structure: The problem of complementation in colloquial Indonesian conversation , 2003 .

[29]  Nagraj Balakrishnan,et al.  Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows , 1993 .

[30]  J. Potvin,et al.  Generalization and refinement of route construction heuristics using genetic algorithms , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[31]  M. H. J. Webb,et al.  Relative Performance of Some Sequential Methods of Planning Multiple Delivery Journeys , 1972 .

[32]  Mwp Martin Savelsbergh,et al.  A parallel insertion heuristic for vehicle routing with side constraints , 1990 .

[33]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[34]  Lawrence Bodin,et al.  Solving large vehicle routing and scheduling problems in small core , 1983, ACM '83.

[35]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[36]  Bezalel Gavish,et al.  Parallel Savings Based Heuristics for the Delivery Problem , 1991, Oper. Res..