Network Design and Transportation Planning: Models and Algorithms

T. L. Magnanti and R. T. Wong
Additional contact information
T. L. Magnanti: Massachusetts Institute of Technology, Cambridge, Massachusetts
R. T. Wong: Purdue University, West Lafayette, Indiana

Transportation Science, 1984, vol. 18, issue 1, 1-55

Abstract: Numerous transportation applications as diverse as capital investment decision-making, vehicle fleet planning, and traffic light signal setting all involve some form of (discrete choice) network design. In this paper, we review some of the uses and limitations of integer programming-based approaches to network design, and describe several discrete and continuous choice models and algorithms. Our objectives are threefold---to provide a unifying view for synthesizing many network design models, to propose a unifying framework for deriving many network design algorithms, and to summarize computational experience in solving design problems. We also show that many of the most celebrated combinatorial problems that arise in transportation planning are specializations and variations of a generic design model. Consequently, the network design concepts described in this paper have great potential application in a wide range of problem settings.

Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (238)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.18.1.1 (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:18:y:1984:i:1:p:1-55

Access Statistics for this article

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