Three case studies pertaining to the development of scientifically rigorous methods in urban transportation planning are presented. Drawing on the lessons of these studies, an approach and attitude toward future research on planning methods and practice is considered.
Get full access to this article
View all access options for this article.
References
1.
AashtianiH Z, 1979The Multi-Modal Traffic Assignment Problem PhD thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA
2.
AbdulaalMLeBlancL J, 1979a, “Continuous equilibrium network design models”Transportation Research B1319–32
3.
AbdulaalMLeBlancL J, 1979b, “Methods for combining modal split and equilibrium assignment models”Transportation Science13292–314
4.
BealeE M LKendallM GMannD W, 1967, “The discarding of variables in multivariate analysis”Biometrika54357–366
5.
BeckmannM J, 1967, “Principles of optimum location for transportation networks” in Quantitative Geography, Part I: Economic and Cultural Topics Eds GarrisonW LMarbleD F, Department of Geography, Northwestern University, Evanston, IL, pp 95–119
6.
BeckmannMMcGuireC BWinstenC B, 1956Studies in the Economics of Transportation (Yale University Press, New Haven, CT)
7.
BoyceD E, 1984, “Network models in transportation/land use planning” in Transportation Planning Models Ed. FlorianM (North-Holland, Amsterdam) forthcoming
8.
BoyceD EDayN DMcDonaldC, 1970Metropolitan Plan Making (Regional Science Research Institute, Philadelphia, PA)
9.
BoyceD EFarhiAWeischedelR, 1973, “Optimal network problem: A branch-and-bound algorithm”Environment and Planning5519–533
10.
BoyceD EFarhiAWeischedelR, 1974Lecture Notes in Economics and Mathematical Systems, 103. Optimal Subset Selection (Springer, Berlin)
11.
BoyceD EJansonB N, 1980, “A discrete transportation network design problem with combined trip distribution and assignment”Transportation Research B14147–154
12.
BoyceD ELeBlancL JChonK S, 1984, “Network equilibrium models of location, destination, mode and route choice: A review and unified approach to derivation of hierarchical choice functions” publication 3 (revised), Transportation Planning Group, University of Illinois at Urbana-Champaign, Urbana, IL
13.
BoyceD ESoberanesJ L, 1979, “Solutions to the optimal network design problem with shipments related to transportation cost”Transportation Research B1365–80
14.
BruynoogheM, 1969Une Modèle Integre de Distribution et d'Affectation du Trafic sur Un Réseau technical report, Département de Recherche Operationnelle et Informatique, Institut de Recherches sur des Transports, Arcueil
15.
BruynoogheMGibertASakarovitchM, 1969, “Une méthode d'affectation du trafic”Straßenbau und Straßenverkehrstechnik, Heft 86. Beiträge zur Theorie des Verkehrsflusses Eds LentzbachWBaronP, Herausgegeben von Bundesminster für Verkehr, Abt. Straßenbau, Bonn, pp 198–204
16.
CATS, 1960Final Report, Volume 2Chicago Area Transportation Study, 300 W Adams Street, Chicago, IL 60606
17.
CharnesACooperW W, 1961, “Multicopy traffic network models” in Theory of Traffic Flow Ed. HermanR (Elsevier, Amsterdam) pp 85–96
18.
ChonK S, 1982Testing of Combined Urban Location and Travel Choice Models PhD thesis, Department of Civil Engineering, University of Illinois at Urbana-Champaign, Urbana, IL
19.
DafermosS C, 1968Traffic Assignment and Resource Allocation in Transportation Networks PhD thesis, Department of Operations Research, Johns Hopkins University, Baltimore, MD
20.
DafermosS C, 1971, “An extended traffic assignment model with applications to two-way traffic”Transportation Science5366–389
21.
DafermosS C, 1972, “The traffic assignment problem for multiclass-user transportation networks”Transportation Science673–87
22.
DafermosS C, 1980, “Traffic equilibria and variational inequalities”Transportation Science1442–54
23.
DafermosS C, 1982a, “Relaxation algorithms for the general asymmetric traffic equilibrium problem”Transportation Science16231–240
24.
DafermosS C, 1982b, “The general multimodal network equilibrium problem with elastic demand”Networks1257–72
25.
DafermosSNagurneyA, 1984, “On some traffic equilibrium theory paradoxes”Transportation Research B18101–110
26.
DafermosS CSparrowF T, 1969, “The traffic assignment problem for a general network”Journal of Research of the National Bureau of Standards B7391–118
27.
DafermosS CSparrowF T, 1971, “Optimal resource allocation and toll patterns in user-optimized transport networks”Journal of Transport Economics and Policy51–17
28.
DantzigG BHarveyR PLansdowneZ FRobinsonD WMaierS F, 1979, “Formulating and solving the network design problem by decomposition”Transportation Research B135–17
29.
DantzigG BWolfeP, 1961, “The decomposition algorithm for linear programs”Econometrica29767–778
30.
DionneRFlorianM, 1977, “Exact and approximate algorithms for optimal network design” publication 41, Centre de Recherche sur les Transports, Université de Montréal, Montréal
31.
DowP D C, 1979, “Capacity-restrained road assignment, III, improved equilibrium methods”Traffic Engineering and Control20303–305
32.
EashR WJansonB NBoyceD E, 1979, “Equilibrium trip assignment: Advantages and implications for practice”Transportation Research Recordnumber 728, 1–8
33.
ErlanderS, 1973, “Planeringsmodeller for vag och gatutrafiksystem, gravitations-modellen”Department of Mathematics, Linköping Institute of Technology, Linköping, Sweden
34.
ErlanderS, 1977, “Accessibility, entropy and the distribution and assignment of traffic”Transportation Research11149–153
35.
ErlanderS, 1980Lecture Notes in Economics and Mathematical Systems, 173. Optimal Spatial Interaction and the Gravity Model (Springer, Berlin)
36.
ErlanderSSchéeleS, 1974, “A mathematical programming model for bus traffic in a network” in Transportation and Traffic Theory Ed. BuckleyD J (Elsevier, Amsterdam) pp 581–605
37.
EvansS P, 1973Some Applications of Optimization Theory in Transport Planning PhD thesis, Research Group in Traffic Studies, University College, University of London, London
38.
EvansS P, 1976, “Derivation and analysis of some models for combining trip distribution and assignment”Transportation Research1037–57; a shorter report of these results is published as “Some models for combining the trip distribution and traffic assignment stages in the transport planning process” in Lecture Notes in Economics and Mathematical Systems, 118. Traffic Equilibrium Methods 1976, Ed. FlorianM (Springer, Berlin) pp 201–228
39.
FernandezL J EFrieszT L, 1983, “Equilibrium predictions in transportation markets: The state of the art”Transportation Research B17155–172
40.
FiskC S, 1983, “Entropy and information theory: Are we missing something?” publication 14, Transportation Planning Group, University of Illinois at Urbana-Champaign, Urbana, IL; to be published in Environment and Planning A
41.
FiskC S, 1984, “Optimal signal controls on congested networks”in Proceedings of the Ninth International Symposium on Transportation and Traffic Theory Eds VolmullerJHamerslagR (VNU Science Press, Utrecht) pp 197–216
42.
FiskC SBoyceD E, 1983a, “Alternative variational inequality formulations of the network equilibrium-travel choice problem”Transportation Science17454–463
43.
FiskC SBoyceD E, 1983b, “A note on trip matrix estimation from link traffic count data”Transportation Research B17245–250
44.
FiskC SBoyceD E, 1983c, “Optimal transportation systems planning with integrated supply and demand models” publication 16, Transportation Planning Group, University of Illinois at Urbana-Champaign, Urbana, IL
45.
FiskC SBoyceD E, 1984, “A modified composite cost measure for probabilistic choice modelling”Environment and Planning A16241–248
46.
FlorianMGuelatJSpiessH, 1983, “An efficient implementation of the PARTAN variant of the linear approximation method for the network equilibrium problem” paper presented at the Operations Research Society of America Meeting, Orlando; copy obtainable from Centre de Recherche sur les Transports, Université de Montréal, Montréal, Québec H3C 317
47.
FlorianMNguyenS, 1976, “An application and validation of equilibrium trip assignment models”Transportation Science10374–390
48.
FlorianMNguyenSFerlandJ, 1975, “On the combined distribution—assignment of traffic”Transportation Science943–53
49.
FlorianMSpiessH, 1982, “The convergence of diagonalization algorithms for asymmetric network equilibrium problems”Transportation Research B16447–483
50.
FrankC, 1978A Study of Alternative Approaches to Combined Trip Distribution—Assignment Modeling PhD thesis, Department of Regional Science, University of Pennsylvania, Philadelphia, PA
51.
FrankM, 1981, “The Braess paradox”Mathematical Programming20283–302
52.
FrankMWolfeP, 1956, “An algorithm for quadratic programming”Naval Research Logistics Quarterly395–110
53.
FrieszT LTobinR LSmithT EHarkerP T, 1983, “A nonlinear complementarity formulation and solution procedure for the general derived demand network equilibrium problem”Journal of Regional Science23337–359
54.
GibertA, 1968, “A method for the traffic assignment problem” LBS-TNT-95, Transport Network Theory Unit, London Business School, London
55.
HarkerP T, 1983Prediction of Intercity Freight Flows: Theory and Application of a Generalized Spatial Price Equilibrium Model PhD thesis, Department of Civil Engineering, University of Pennsylvania, Philadelphia, PA
56.
HarrisB, 1961, “Some problems in the theory of intra-urban location”Operations Research9695–721
57.
HarrisB, 1971, “Planning as a branch-and-bound process”Papers of the Regional Science Association2653–63
58.
HerbertJ DStevensB H, 1960, “A model for the distribution of residential activity in urban areas”Journal of Regional Science221–36
59.
KnightF H, 1924, “Some fallacies in the interpretation of social cost”Quarterly Journal of Economics38582–606
60.
KuhnH W, 1982, “Complementary problems: An eclectic view”Nordic Symposium on Linear Complementarity Problems and Related Areas Eds LarssonTSmedsP, Linköping Institute of Technology, Linköping, pp 1–16
61.
KuhnH WTuckerA W, 1951, “Nonlinear programming” in Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability Ed. NeymanJ (University of California Press, Berkeley, CA)
62.
LeBlancL J, 1973Mathematical Programming Algorithms for Large Scale Network Equilibrium and Network Design Problems PhD thesis, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL
63.
LeBlancL J, 1975, “An algorithm for the discrete network design problem”Transportation Science9183–199
64.
LeBlancL JFarhangianK, 1981, “Efficient algorithms for solving elastic demand traffic assignment problems and mode split-assignment problems”Transportation Science15306–317
65.
LeBlancL JHelgasonR VBoyceD E, 1983, “Improved efficiency of the Frank—Wolfe algorithm” submitted to Transportation Science; copy obtainable from Dr LeBlanc, Owen Graduate School of Management, Vanderbilt University, Nashville, TN
66.
LeBlancL JMorlokE KPierskallaW P, 1975, “An efficient approach to solving the road network equilibrium traffic assignment problem”Transportation Research9309–318
67.
LeeD BJr, 1973, “Requiem for large-scale models”Journal of the American Institute of Planners40163–178
LosM, 1975Simultaneous Optimization of Land Use and Transportation in New Town Design PhD thesis, Department of City and Regional Planning, University of Pennsylvania, Philadelphia, PA
70.
LosM, 1976, “Optimal network problem without congestion: Some computational results” publication 40, Centre de Recherche sur les Transports, Université de Montréal, Montréal
71.
LosM, 1979, “Combined residential-location and transportation models”Environment and Planning A111241–1265
72.
LosMNguyenS, 1983, “Solution algorithms for a combined residential location and transportation model”Environment and Planning A15515–524
73.
MarbleD FGarrisonW L, 1958, “Analysis of transportation networks: A linear programming formulation”Highway Research Board Proceedings371–17
74.
MarcotteP, 1983, “Network optimization with continuous control parameters”Transportation Science17181–197
75.
McFaddenD, 1974, “Conditional logit analysis of qualitative choice behavior” in Frontiers in Econometrics Ed. ZarembkaP (Academic Press, New York) pp 105–142
76.
MurchlandJ D, 1966, “Some remarks on the gravity model of traffic distribution and an equivalent maximization formulation” LSE-TNT-38, Transport Network Theory Unit, London School of Economics, London
77.
MurchlandJ D, 1970, “Road network traffic distribution in equilibrium”Operations Research-Verfahren8145–183
78.
NguyenS, 1974Une Approche Unifiée des Méthodes d'Équilibre pour l'Affectation du Trafic PhD thesis, Département d'informatique, Université de Montréal, Montréal
79.
NguyenS, 1976, “A unified approach to equilibrium methods for traffic assignment” in Lecture Notes in Economics and Mathematical Systems, 118. Traffic Equilibrium Methods Ed. FlorianM (Springer, Berlin) pp 148–182
80.
QuandtR E, 1962, “Models of transportation and optimal network construction”Journal of Regional Science227–46
81.
RidleyT M, 1968, “An investment policy to reduce the travel time in a transportation network”Transportation Research2409–424
82.
RockafellarR T, 1967, “Convex programming and systems of elementary monotonic relations”Journal of Mathematical Analysis and Applications19543–564
83.
RockafellarR T, 1968Convex Analysis (Princeton University Press, Princeton, NJ)
84.
RothengatterW, 1979, “Application of optimal subset selection to problems of design and scheduling in urban transportation networks”Transportation Research B1349–63
85.
SchneiderM, 1959, “Gravity models and trip distribution theory”Papers of the Regional Science Association551–56
86.
ScottA J, 1969, “The optimal network problem: Some computational procedures”Transportation Research3201–210
87.
SeniorM LWilsonA G, 1974, “Some explorations and syntheses of linear programming and spatial interaction models of residential location”Geographical Analysis6209–237
88.
SheffiYDaganzoC F, 1980, “Computation of equilibrium over transportation networks: The case of disaggregate demand models”Transportation Science14155–173
89.
SmithM J, 1979, “Existence, uniqueness and stability of traffic equilibria”Transportation Research B13295–304
90.
StairsS, 1967, “Selecting an optimal traffic network”Journal of Transport Economics and Policy2218–231
91.
SteinbergRZangwillW I, 1983, “The prevalence of Braess' paradox”Transportation Science17301–318
92.
TomlinJ A, 1967Mathematical Programming Models for Traffic Network Problems doctoral dissertation, Department of Civil Engineering, University of Adelaide, Australia
93.
TomlinJ A, 1971, “A mathematical programming model for the combined distribution—assignment of traffic”Transportation Science5122–140
94.
US DOT, 1979UTPS Reference ManualUS Department of Transportation, Washington, DC
95.
WardropJ G, 1952, “Some theoretical aspects of road traffic research”Proceedings of the Institution of Civil Engineers, Part II1325–378
96.
WernerC, 1968, “The role of topology and geometry in optimal network design”Papers of the Regional Science Association21173–189
97.
WilsonA G, 1967, “A statistical theory of spatial distribution models”Transportation Research1253–269
98.
WongR T, 1984, “Introduction and recent advances in network design” in Transportation Planning Models Ed. FlorianM (North-Holland, Amsterdam) forthcoming
