Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
Clarke, G. and Wright, J. W. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Operations Research, 1964, 12, 568–581.
Dueck, G. New Optimization Heuristics: The Great Deluge Algorithm and the Recordto-Record Travel, Journal of Computational Physics, 1993, 104, 86–92.
Fisher, M. L. and Jaikumar, R. A Generalized Assignment Heuristic for Vehicle Routing, Networks, 1981, 11, 109–124.
Golden, B. L., Magnanti, T. L., and Nguyen, H. Q. Implementing Vehicle Routing Algorithms, Networks, 1977, 7, 113–148.
Lin, S. Computer Solutions of the Traveling Salesman Problem, Bell System Technical Journal, 1965, 44, 2245–2269.
Marsten, R. E. The Design of the XMP Linear Programming Library, ACM Transactions on Mathematical Software, 1981, 7, 481–497.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Chao, IM., Golden, B.L., Wasil, E.A. (1998). A New Algorithm for the Site-Dependent Vehicle Routing Problem. In: Woodruff, D.L. (eds) Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search. Operations Research/Computer Science Interfaces Series, vol 9. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2807-1_12
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2807-1_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5023-9
Online ISBN: 978-1-4757-2807-1
eBook Packages: Springer Book Archive