A New Algorithm for the Site-Dependent Vehicle Routing Problem

  • I-Ming Chao
  • Bruce L. Golden
  • Edward A. Wasil
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 9)

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.

Keywords

Travel Salesman Problem Travel Salesman Problem Vehicle Rout Problem Seed Point Vehicle Type 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    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
  2. [2]
    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.CrossRefGoogle Scholar
  3. [3]
    Dueck, G. New Optimization Heuristics: The Great Deluge Algorithm and the Recordto-Record Travel, Journal of Computational Physics, 1993, 104, 86–92.CrossRefGoogle Scholar
  4. [4]
    Fisher, M. L. and Jaikumar, R. A Generalized Assignment Heuristic for Vehicle Routing, Networks, 1981, 11, 109–124.CrossRefGoogle Scholar
  5. [5]
    Golden, B. L., Magnanti, T. L., and Nguyen, H. Q. Implementing Vehicle Routing Algorithms, Networks, 1977, 7, 113–148.CrossRefGoogle Scholar
  6. [6]
    Lin, S. Computer Solutions of the Traveling Salesman Problem, Bell System Technical Journal, 1965, 44, 2245–2269.Google Scholar
  7. [7]
    Marsten, R. E. The Design of the XMP Linear Programming Library, ACM Transactions on Mathematical Software, 1981, 7, 481–497.CrossRefGoogle Scholar
  8. [8]
    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
  9. [9]
    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

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • I-Ming Chao
    • 1
  • Bruce L. Golden
    • 2
  • Edward A. Wasil
    • 3
  1. 1.Department of Mathematics and Management SciencesThe Chinese Military AcademyFeng-ShanTaiwan, ROC
  2. 2.College of Business and ManagementUniversity of MarylandCollege ParkUSA
  3. 3.Kogod College of Business AdministrationAmerican UniversityUSA

Personalised recommendations