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:
  • Find a library where document is available. Order URL: http://worldcat.org/oclc/1767714
• Corporate Authors:

  Operations Research Society of America

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

Media Info

• Features: References;
• Pagination: p. 361-373
• Serial:
  • Transportation Science
  • Volume: 10
  • Issue Number: 4
  • Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
  • ISSN: 0041-1655
  • Serial URL: http://transci.journal.informs.org/

Subject/Index Terms

• TRT Terms: Costs; Heuristic methods; Highway transportation; Mathematical models; Networks; Problem solving; Reduction (Chemistry); Routes; Routing; Traffic control; Traffic flow; Transportation; Urban transportation
• Old TRIS Terms: Reduction; Route analysis
• Subject Areas: Operations and Traffic Management; Planning and Forecasting; Transportation (General);

Filing Info

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