An Heuristic Method for Solving Time-Sensitive Routeing Problems

Abstract

Many vehicle scheduling situations require careful monitoring and control of the time a vehicle is on the road. Setting time limits as rigid constraints on a vehicle scheduling problem is usually not appropriate since minor violations of such constraints do not really imply that a solution is infeasible. An heuristic method for solving vehicle scheduling problems in which time is an important factor has been developed. The heuristic creates routes based on a "time density function" which identifies clusters of stops and chooses stops from these clusters to form a route. Important considerations balancing overtime costs, overnight route costs and travel costs to and from far clusters of stops are part of the heuristic. The method has been tested on 10 days of data from a large food distributor in the midwestern United States and found to affect significantly both variable and fixed costs in these commercial problems. The smallest of these problems had 110 stops, while the largest had 223. A modest amount of computer time (under 15 seconds in every case) was required to generate the assignment of stops to trucks and produce routes for the vehicles.

Keywords:

• vehicle routeing heuristic
• clustering
• insertion penalties