A link-based variational inequality formulation of ideal dynamic user-optimal route choice problem

Transportation Research Part C: Emerging Technologies

Volumn 4, Issue 1, 1996, Pages 1-12

  Ran, Bin ^a   Boyce, David E ^b  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; MOTOR TRANSPORTATION; OPTIMAL SYSTEMS; PROBLEM SOLVING; VARIATIONAL TECHNIQUES;

ACTUAL ROUTE TIME; IDEAL DYNAMIC USER OPTIMAL ROUTE CHOICE PROBLEM; LINK BASED VARIATIONAL INEQUALITY FORMULATION; MINIMAL TIME ROUTES; TRAFFIC NETWORK CONSTRAINTS;

TRANSPORTATION ROUTES;

DYNAMIC USER-OPTIMAL PROBLEM; METHODOLOGICAL EVALUATION; ROUTE CHOICE PROBLEM; TRAFFIC FLOW; TRANSPORT PLANNING;

EID: 0030080651     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0968-090X(95)00017-D     Document Type: Article

References (34)

1. Abkowitz M. (1981) Understanding the effect of transit service reliability on work travel behavior. Transpn Res. Record 794, 33-41.
2. Ben-Akiva M., Cyna M. and de Palma A. (1984) Dynamic model of peak period congestion. Transpn Res.-B 18, 339-355.
3. Boyce D. E., Ran B. and LeBlanc L. J. (1991) Dynamic user-optical traffic assignment: a new model and solution techniques. Paper Presented at First Triennial Symp. on Transportation Analysis, Montreal, Canada.
4. Carey M. (1987) Optical time-varying flows on congested networks. Opers Res. 35, 58-69.
5. Chang G. L., Ho P. K. and Wei C. H. (1993) A dynamic system-optimum control model for commuting traffic corridors. Transpn Res.-C 1, 3-22.
6. Dafermos S. (1980) Traffic equilibrium and variational inequalities. Transpn Sci. 14, 42-54.
7. Dafermos S. (1982) The general multimodel equilibrium problem with elastic demand. Networks 12, 57-72.
8. Dafermos S. and Nagurney A. (1984a) On some traffic equilibrium theory paradoxes. Transpn Res.-B 18, 101-110.
9. Dafermos S. and Nagurney A (1984b) Stability and sensitivity analysis for the general network equilibrium-travel choice model. Proc. 9th Int. Symp. on Transportation and Traffic Theory, pp. 217-234, VNU Science Press, Utrecht, The Netherlands.
10. Fish C. and Boyce D. E. (1983) Alternative variational inequality formulations of network equilibrium travel choice problem. Transpn Sci. 17, 454-463.
11. Friesz T. L., Luque F. J., Tobin R. L. and Wie B.-W. (1989) Dynamic network traffic assignment considered as a continuous time optical control problem. Opers Res 37, 893-901.
12. Friesz T. L., Bernstein D., Smith T. E., Tobin R. L. and Wie B.-W. (1993) A variational inequality formulations of the dynamic network user equilibrium problem. Opers Res. 41, 179-191.
13. Ghali M. O. and Smith M. J. (1993) Traffic assignment, traffic control and road pricing. Proc. 12th ISTTT, pp. 147-169. Elsevier Science, Oxford.
14. Hendrickson C. and Plant E. (1984) The flexibility of departure times for work trips. Transpn Res.-A 18, 25-36.
15. Hurdle V. R. (1974) The effect of queuing on traffic assignment in a simple road network. Proc. 6th Int. Symp. on Transportation and Traffic Theory, pp. 519-540.
16. Janson B. N. (1991) Dynamic traffic assignment for urban road networks. Transn Res.-B 25, 143-161.
17. Kuwahara M. and Akamatsu T. (1993) Dynamic equilibrium assignment with queues for a one-to-many OD pattern. Proc. 12th Int. Symp. on Transportation and Traffic Theory.
18. Mahmassani H. S. and Chang G. L. (1987) On boundedly rational user equilibrium in transportation systems. Tranpn. Sci. 21, 89-99.
19. Mahmassani H. S. and Herman R. (1984) Dynamic user equilibrium departure time and route choice on idealized traffic arterials. Transpn Sci. 18. 362-384.
20. Merchant D. K. and Nemhauser G. L. (1978a) A model and an algorithm for the dynamic traffic assignment problems. Transpn Sci 12, 183-199.
21. Merchant D. K. and Nemhauser G. L. (1978b) Optimality conditions for a dynamic traffic assignment model. Transpn Sci. 12, 200-207.
22. Nagurney A. (1993) Network Economics: A Variational Inequality Approach. Kluwer Academic Publishers, Norwell, MA.
23. Nagurney A. (1986) Computational comparisons of algorithms for general asymmetric traffic equilibrium problems with fixed and elastic demands. Transpn Res. 20, 78-84.
24. de Palma A., Ben-Akiva M., Lefevre C. and Litinas N. (1983) Stochastic equilibrium model of peak period traffic congestion. Transpn Sci. 17, 430-453.
25. Ran B. (1993) Dynamic transportation network models for advanced traveler information systems. Ph.D. Dissertation, University of Illinois at Chicago.
26. Ran B. and Shimazaki T. (1989a) A general model and algorithm for the dynamic traffic assignment problems. Transport Policy. Management and Technology Towards 2001, Fifth WCTR, Yokohama, Japan, pp. 463-477.
27. Ran B. and Shimazaki T. (1989b) Dynamic user equilibrium traffic assignment for congested transportation networks. Presented at the Fifth World Conf. on Transport Research, Yokohama, Japan.
28. Ran B., Boyce D. E. and LeBlanc L. J. (1992a) Dynamic user-optimal departure time and route choice model: a bilevel, optimal-control formulation. Presented at TIMS/ORSA Joint National Meeting, Orlando.
29. Ran B., Rouphail N., Tarko A. and Boyce D. E. (1992b) Toward a class of link travel time functions for dynamic network models. Presented at the 39th North American Meeting of Regional Science Association International, Chicago.
30. Ran B., Boyce D. E. and LeBlanc L. J. (1993) A new class of instantaneous dynamic user-optical traffic assignment models. Opers Res. 41, 192-202.
31. Smith M. J. (1979) The existence, uniqueness and stability of traffic equilibria. Transn Res.-B 13, 295-304.
32. Smith M. J. (1993) A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks. Transn Res.-B 27, 49-63.
33. Wie B.-W., Friesz T. L. and Tobin R. L. (1990) Dynamic user optical traffic assignment on congested multidestination networks. Transn Res.-B 24 431-442.
34. Yagar S. (1971) Dynamic traffic assignment by individual path minimisation and queuing. Transpn Res. 5, 179-196.