Abstract
We propose and formulate the vehicle routing problem with demand range (VRPDR), a new variation on the traditional vehicle routing problem. In the VRPDR, the delivery quantity for each customer i is allowed to vary from its original size d i by an amount α d i where 0 ≤ α < 1. In adding this limited flexibility to the problem, there is potential to generate significant savings in the total distance traveled. We address issues such as bounding the impact of a given α on total distance and provide empirical results to illustrate “typical” behavior.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Belenguer, J.M., M.C. Martinez, and E. Mota. (2000). “A Lower Bound for the Split Delivery Vehicle Routing Problem.” Operations Research, 48(5), 801–810.
Brumback, N. (1995). “Rubbermaid’s New System Scores.” Home Furnishing Network, 69, 11.
Campbell, A., L. Clarke, A. Kleywegt, and M. Savelsbergh. (1998). “Inventory Routing.” In: T. Crainic and G. Laporte (Eds.), Fleet Management and Logistics, pp. 95–112. Kluwer Academic Publishers.
Campbell, A. and M. Savelsbergh. (2004). “A Decomposition Approach for the Inventory Routing Problem.” Transportation Science, 38, 488–502.
Campbell, A. and M. Savelsbergh. (2004). “Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems.” Transportation Science, 38, 369–378.
Campbell, A. and M. Savelsbergh. (2002). “Inventory Routing in Practice.” In: P. Toth and D. Vigo (Eds.), The Vehicle Routing Problem, pp. 309–329. SIAM Monographs on Discrete Mathematics and Applications.
Christiansen, M. and B. Nygreen. (1998a). “A Method for Solving Ship Routing Problems with Inventory Constraints.” Annals of Operations Research, 81, 357–378.
Christiansen, M. and B. Nygreen. (1998b). “Modeling Path Flows for a Combined Ship Routing and Inventory Management Problem.” Annals of Operations Research, 82, 391–412.
Croes, G.A. (1958). “A Method for Solving Traveling Salesman Problems.” Operations Research, 6, 791–812.
Dror, M., G. Laporte, and P. Trudeau. (1994). “Vehicle Routing with Split Deliveries.” Discrete Applied Mathematics, 50, 239–254.
Dror, M. and P. Trudeau. (1989). “Savings by Split Delivery Routing.” Transportation Science, 23, 141–145.
Dror, M. and P. Trudeau. (1990). “Split Delivery Routing.” Naval Research Logistics, 27, 383–402.
Frizzell, P.W. and J.W. Giffin. (1995). “The Split Delivery Vehicle Scheduling Problem with Time Windows and Grid Network Distance.” Computers and Operations Research, 22, 655–667.
Laporte, G. and Y. Nobert. (1985). “A Branch and Bound Algorithm for the Capacitated Vehicle Routing Problem.” OR Spektrum, 5, 77–85.
Millstein, M. (1993). “Giant Smoothing out Supply Flow.” Supermarket News, 43, 15.
Mongelluzzo, B. (1998). “Shippers let Vendors Manage the Stock: Wal-Mart’s Suppliers Share in Databases.” Journal of Commerce and Commercial, 417, 12A.
Purpura, L. (1997). “Vendor-Run Inventory: Are its Benefits Exaggerated?.” Supermarket News, 47, 59–60.
Ross, J. (1998). “HEB Project Leads Expansion of Vendor Managed Inventory Programs.” Stores, 80, 46–47.
Sierksma, G. and G.A. Tijssen. (1998). “Routing Helicopters for Crew Exchanges on Off-Shore Locations.” Annals of Operations Research, 76, 261–286.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Campbell, A.M. The Vehicle Routing Problem with Demand Range. Ann Oper Res 144, 99–110 (2006). https://doi.org/10.1007/s10479-006-0057-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-006-0057-0