1984/02/01 by Thomas L. Magnanti, T. L. Magnanti, R. T. Wong +1 · 2 citations
Engineering · Social Sciences · #Transportation Planning and Optimization #Transportation and Mobility Innovations #Vehicle Routing Optimization Methods
paper · doi:10.1287/trsc.18.1.1
crossref issued 1984/02/01 · crossref published 1984/02/01 · crossref published-print 1984/02/01 · openalex publication_date 1984/02/01 · crossref created 2008/10/31 · crossref deposited 2023/04/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30 · crossref indexed 2026/08/01
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.