A New Algorithm for the Site-Dependent Vehicle Routing Problem
In the site-dependent vehicle routing problem (SDVRP), a heterogeneous fleet of vehicles is used to service a set of customers, but there exist compatibility dependencies between customer sites and vehicle types. Some customers with extremely large demands may require large vehicles, whereas some customers located in congested areas may require small or medium-size vehicles. Other customers might be serviced by any type of vehicle. The goal is to carefully select an allowable vehicle type for each customer. Then, for each vehicle type, a classical vehicle routing problem (VRP) is solved over all customers selecting that vehicle type so that the total distance traveled by the entire fleet is minimized and all VRP constraints as well as the site-dependent constraints are satisfied. In this paper, a new algorithm for solving the SDVRP is presented and applied to a set of 12 test problems taken from the literature. The computational results show that the new algorithm easily outperforms the previous methods.
KeywordsTravel Salesman Problem Travel Salesman Problem Vehicle Rout Problem Seed Point Vehicle Type
Unable to display preview. Download preview PDF.
- Chao, I-M., Golden, B. L., and Wasil, E. A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions, American Journal of Mathematical and Management Sciences, 1993, 13, 371–406.Google Scholar
- Lin, S. Computer Solutions of the Traveling Salesman Problem, Bell System Technical Journal, 1965, 44, 2245–2269.Google Scholar
- Nag, B. Vehicle Routing in the Presence of SiteNehicle Dependency Constraints, Ph.D. Dissertation, College of Business and Management, University of Maryland at College Park, 1986.Google Scholar
- Nag, B., Golden, B. L., and Assad, A. A. Vehicle Routing with Site Dependencies, in Vehicle Routing: Methods and Studies, eds., B. Golden and A. Assad, North-Holland, Amsterdam, 1988, 149–159.Google Scholar