Disaggregation pp 471-483 | Cite as

Vehicle dispatching — Sweep algorithm and extensions

  • Billy E. Gillet
  • Leland E. Miller
  • Jerry G. Johnson
Chapter

Abstract

This paper surveys the original Sweep Algorithm for the vehicle dispatch problem along with several modifications and applications. The original Sweep Algorithm was developed by Gillett and Miller [5]. It divides the single terminal vehicle dispatch problem into two subproblems; one of assigning locations to routes and the other of minimizing the length of each route using a traveling salesman algorithm. A number of people have applied modified versions of the Sweep Algorithm to various applications [1], [11], [12]. Others have improved the original version and have extended it to the multi-terminal problem [6] , [8] .

Keywords

Travel Salesman Problem Distance Constraint Insertion Distance Sweep Algorithm Unnecessary Computation 
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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Buddhiraju, K. and Viswanathan, P., ‘A Heuristic Approach for Vehicle Dispatching with Some Side Conditions’, ORSA/TIMS National Meeting, Las Vegas (Fall 1975 ).Google Scholar
  2. 2.
    Christofides, N. and Eilon, S., ‘An Algorithm for the Vehicle-Dispatch Problem’, Operational Research Quarterly, vol. 20 (1969), pp. 309–318.CrossRefGoogle Scholar
  3. 3.
    Clark, G. and Wright, J. W., ‘Scheduling of Vehicles from a Central Depot to a Number of Delivery Points’, Operations Research, vol. 11 (1963), pp. 568–581.Google Scholar
  4. 4.
    Gaskell, T. J., ‘Bases for Vehicle Fleet Scheduling’, Operational Research Quarterly, vol. 18 (1967), pp. 281–295.CrossRefGoogle Scholar
  5. 5.
    Gillett, B. E. and Miller, L. E., ‘A Heuristic Algorithm for the Venicle-Dispatch Problem, Operations Research, vol. 22, (1974), pp. 340–349.CrossRefGoogle Scholar
  6. 6.
    Gillett, B. E. and Johnson, J. G., ‘Sweep Algorithm for the Multiple Depot VehicleDispatch Problem’, ORSA/TIMS National Meeting, San Juan, Puerto Rico (Fall 1974 )Google Scholar
  7. 7.
    Gillett, B. E. and Johnson, J. G., ‘Multi-Terminal Vehicle Dispatch Algorithm’, OMEGA, The International Journal of Management Science,vol. 4, no. 6 (November—December 1976).Google Scholar
  8. 8.
    Golden, B. L., Magnanti, T. L., and Ngyuen, H. Q., ‘Implementing Vehicle Routing Algorithms’, Tech. Report no. 115, Operations Research Center, MIT (1975).Google Scholar
  9. 9.
    Lin, Shen, ‘Computer Solutions for the Traveling Salesman Problem’, Bell Systems Tech. Journal, vol. 44 (1965); pp. 2245–2269.Google Scholar
  10. 10.
    Lin, Shen and Kernighan, B. W., ‘A Heuristic Algorithm for the Traveling Salesman Problem’, Computer Science Tech. Report no. 1, Bell Labs., (1972).Google Scholar
  11. 11.
    Robbins, J. A. and Turner, W. C., ‘A Manual Method for Routing School Buses’, ORSA/TIMS National Meeting, Las Vegas (Fall 1975 ).Google Scholar
  12. 12.
    Russell, Robert A., ‘Efficient Truck Routing of Industrial Refuse Collection’, ORSA/ TIMS National Meeting, San Juan, Puerto Rico (Fall 1974 ).Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1979

Authors and Affiliations

  • Billy E. Gillet
  • Leland E. Miller
  • Jerry G. Johnson

There are no affiliations available

Personalised recommendations