Implementing Vehicle Routing Algorithms

Abstract

Heuristic programming algorithms frequently address large problems and require manipulation and operation on massive data sets. The algorithms can be improved by using efficient data structures. With this in mind, we consider heuristic algorithms for vehicle routing, comparing techniques of Clarke and Wright, Gillett and Miller, and Tyagi, and presenting modifications and extensions which permit problems involving hundreds of demand points to be solved in a matter of seconds. In addition, a multi-depot routing algorithm is developed. The results are illustrated with a routing study for an urban newspaper with an evening circulation exceeding 100,000.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1975
Accession Number
ADA018020

Entities

People

  • Bruce L. Golden
  • Hien Q. Nguyen
  • Thomas L. Magnanti

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Counter IED

DTIC Thesaurus Topics

  • Acquisition
  • Algorithms
  • Cartesian Coordinates
  • Computations
  • Computer Programming
  • Computer Programs
  • Computers
  • Flow Network
  • Grids
  • Heuristic Methods
  • Integer Programming
  • Military Research
  • Newspapers
  • Operations Research
  • Plastic Explosives
  • Scheduling (Production)
  • Travel Time

Fields of Study

  • Computer science

Readers

  • Coastal and Marine Engineering/Sediment Transport/Hydraulic Engineering
  • Operations Research