REDUCTION AND SOLUTION OF LARGE SCALE VEHICLE ROUTING PROBLEMS

This paper discusses the General Routing Problem approach to solving large scale routing problems. The General Routing Problem on network G = (N; A) requires finding the minimum cost cycle that visits every node in subset Q (left hook equal) N and that traverses every arc in a subset R (left hook equal) A. Utilizing special problem characteristics and the structure of real transportation networks, large reduction in effective problem size and complexity can be made. This permits an effective heuristic to produce optimum and near optimum solutions quickly.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    428 East Preston Street
    Baltimore, MD  USA  21202
  • Authors:
    • Orloff, C
    • Caprera, D
  • Publication Date: 1976-11

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00159678
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: Apr 12 1978 12:00AM