Optimizing goods assignment and the vehicle routing problem with time-dependent travel speeds

Many mathematical models have been presented for the vehicle routing problem (VRP) in research papers. Most of them assume that the travel speeds are constant, and ignore the fact that travel speeds can change throughout the day. In this research, based on time-dependent travel speeds, an optimization method is proposed for solving goods assignment and vehicle routing problems. Moreover, in the optimization method, the travel time calculation satisfies the ''non-passing'' property, which is ignored in most research papers. A real case of a 3C warehousing company and a larger simulated problem are introduced to illustrate the proposed method. The results show that the proposed method is efficient and effective in solving problems.

[1]  Yang-Byung Park A solution of the bicriteria vehicle scheduling problems with time and area-dependent travel speeds , 2000 .

[2]  Bernhard Fleischmann,et al.  Time-Varying Travel Times in Vehicle Routing , 2004, Transp. Sci..

[3]  Michael H. Cole,et al.  A VEHICLE ROUTING PROBLEM WITH BACKHAULS AND TIME WINDOWS: A GUIDED LOCAL SEARCH SOLUTION , 2005 .

[4]  C. Reeves Modern heuristic techniques for combinatorial problems , 1993 .

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

[6]  Chryssi Malandraki,et al.  A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem , 1996 .

[7]  Arthur V. Hill,et al.  Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems , 1992 .

[8]  Mark S. Daskin,et al.  Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms , 1992, Transp. Sci..

[9]  Nico Vandaele,et al.  A Queueing Framework for Routing Problems with Time-dependent Travel Times , 2007, J. Math. Model. Algorithms.

[10]  Michel Gendreau,et al.  Vehicle dispatching with time-dependent travel times , 2003, Eur. J. Oper. Res..

[11]  J. Beasley Adapting the savings algorithm for varying inter-customer travel times , 1981 .

[12]  Mohamed Ben-Daya,et al.  A tabu search approach for the flow shop scheduling problem , 1998, Eur. J. Oper. Res..

[13]  T. Yang *,et al.  Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study , 2004 .

[14]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[15]  Mei-Shiang Chang,et al.  The real-time time-dependent vehicle routing problem , 2006 .

[16]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..