Reduction and Solution of Large Scale Vehicle Routing Problems

Clifford Orloff and David Caprera
Additional contact information
Clifford Orloff: Princeton University, Princeton, New Jersey
David Caprera: Princeton University, Princeton, New Jersey

Transportation Science, 1976, vol. 10, issue 4, 361-373

Abstract: 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 (subseteq) N and that traverses every arc in a subset R (subseteq) A . Utilizing special problem characteristics and the structure of real transportation networks, large reduction in effective problem size and complexity can often be made. This permits a very effective heuristic to produce optimum and near optimum solutions quickly.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.10.4.361 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:10:y:1976:i:4:p:361-373

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().