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

Authors:
Yiyo Kuo;Chi-Chang Wang;Pei-Ying Chuang
Affiliations:
Department of Technology Management, Hsing Kuo University of Management, Tainan 709, Taiwan;Department of Technology Management, Hsing Kuo University of Management, Tainan 709, Taiwan;Department of Business Administration, Hsing Kuo University of Management, Tainan 709, Taiwan
Venue:
Computers and Industrial Engineering
Year:
2009

Citing 4
Cited 2

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Tabu search

Modern heuristic techniques for combinatorial problems
A solution of the bicriteria vehicle scheduling problems with time and area-dependent travel speeds

Computers and Industrial Engineering
Time-Varying Travel Times in Vehicle Routing

Transportation Science

Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem

Computers and Industrial Engineering
A variable neighborhood search for the multi-depot vehicle routing problem with loading cost

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.