Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated Networks

References

• Akamatsu T. Cyclic flows, Markov process and stochastic traffic assignment. Transportation Res (1996) 30B:369–386Crossref, Google Scholar
• Akamatsu T. A dynamic traffic assignment paradox. Transportation Res (2003) 34B:515–531Google Scholar
• Akamatsu T. An efficient algorithm for the dynamic traffic equilibrium assignment with queues. Transportation Sci. (2001) 35:389–404Link, Google Scholar
• Akamatsu T., Heydecker B. G. Detecting dynamic traffic assignment capacity paradoxes: Analysis of non-saturated networks. Trans. Sci. (2003) . Submitted toGoogle Scholar
• Akamatsu T., Kuwahara M. Dynamic user equilibrium assignment on over-saturated road networks for a one-to-many/many-to-one OD pattern. JSCE J. Infrastructure Planning and Management (1994) IV-23:21–30Google Scholar
• Akamatsu T., Kuwahara M., Ceder A. A capacity increasing paradox for a dynamic traffic assignment with departure time choice. Transportation and Traffic Theory (1999) (Elsevier Science, Amsterdam, The Netherlands) 301–324Google Scholar
• Alperovich G. Neglected welfare aspects of Braess' paradox. Internat. J. Transport Econom. (1993) 20:215–220Google Scholar
• Arnott R., De Palma A., Lindsey R. Properties of dynamic traffic equilibrium involving bottlenecks, including a paradox and metering. Transportation Sci. (1993) 27:148–160Link, Google Scholar
• Bott R., Mayberry J. P., Morgenstern O. Matrices and trees. Economic Activity Analysis (1954) 391–400Google Scholar
• Braess D. Uber ein paradoxen der verkehrsplaning. Unternehmensforschung (1968) 12:258–268Google Scholar
• Catoni S., Pallottino S. Traffic equilibrium paradoxes. Transportation Sci. (1991) 25:240–244Link, Google Scholar
• Chen W. K. Topological analysis for active networks. IEEE Trans. Circuit Theory (1965) CT-12:85–91Crossref, Google Scholar
• Dafermos S., Nagurney A. On some traffic equilibrium theory paradoxes. Transportation Res. (1984) 18B:101–110Crossref, Google Scholar
• Daganzo C. F. Queue spillovers in transportation networks with a route choice. Transportation Sci (1998) 32:3–11Link, Google Scholar
• Dodd G. G. On unistar graphs. IEEE Trans. Circuit Theory (1967) CT-14:154–159Crossref, Google Scholar
• Fisk C. More paradoxes in the equilibrium assignment problem. Transportation Res. (1979) 13B:305–309Crossref, Google Scholar
• Frank M. The Braess paradox. Math. Programming (1981) 20:283–302Crossref, Google Scholar
• Friesz T. L., Bernstein D., Smith T. E., Tobin R. L., Wie B-E. A variational inequality formulation of the dynamic network user equilibrium problem. Oper. Res. (1993) 41:179–191Link, Google Scholar
• Harker P. Multiple equilibrium behaviors in networks. Transportation Sci. (1988) 22:39–46Link, Google Scholar
• Heydecker B. G., Addison J. D., Lesort J-B. An exact expression of dynamic traffic equilibrium. Transportation and Traffic Theory (1996) (Elsevier Science, Amsterdam, The Netherlands) 359–383Google Scholar
• Heydecker B. G., Addison J. D., Bell M. G. H. Analysis of traffic models for dynamic equilibrium traffic assignment. Transportation Networks: Recent Methodological Advances (1998) (Elsevier Science, Amsterdam, The Netherlands) 34–49Google Scholar
• Kajitani Y., Chen W. K., Shinoda S. A new proof of the evaluation formula of the nodal determinant in terms of directed trees. Internat. J. Circuit Theory and Appl. (1982) 10:286–289Crossref, Google Scholar
• Kuwahara M., Akamatsu T., Daganzo C. F. Dynamic equilibrium assignment with queues for a one-to-many OD pattern. Transportation and Traffic Theory (1993) (Elsevier Science, Amsterdam, The Netherlands) 185–204Google Scholar
• Kuwahara M., Akamatsu T. Dynamic user optimal assignment with physical queues for a many-to-many OD pattern. Transportation Res. (2001) 35B:461–479Crossref, Google Scholar
• Murchland J. D. Braess's paradox of traffic flow. Transportation Res. (1970) 4(4):391–394Crossref, Google Scholar
• Pas I. E., Principio S. L. Braess' paradox: Some new insights. Transportation Res. (1997) 31B:265–276Crossref, Google Scholar
• Smith M. J. In a road network, increasing delay locally can reduce delay globally. Transportation Res. (1978) 12:419–422Crossref, Google Scholar
• Smith M. A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks. Transportation Res. (1993) 27B:49–63Crossref, Google Scholar
• Steinberg R., Zangwill W. I. The prevalence of Braess' paradox. Transportation Sci. (1983) 17:301–318Link, Google Scholar
• Talbot A. Topological analysis for active networks. IEEE Trans. Circuit Theory (1966) CT-13:111–112Crossref, Google Scholar
• Tutte W. T. The dissection of equilateral triangles into equilateral triangles. Proc. Cambridge Philos. Soc. (1948) 44:463–482Crossref, Google Scholar
• Yang H., Bell M. G. H. A capacity paradox in network design and how to avoid it. Transportation Res. (1998) 32A:539–545Google Scholar