A mixed integer linear programming model for dynamic route guidance

Transportation Research Part B: Methodological

Volumn 32B, Issue 6, 1998, Pages 431-440

  Kaufman, David E ^a   Nonis, Jason ^b   Smith, Robert L ^b  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTELLIGENT TRANSPORTATION SYSTEM; LINEAR PROGRAMMING; TRAFFIC MANAGEMENT; TRANSPORT SYSTEM;

INTEGER PROGRAMMING; INTELLIGENT VEHICLE HIGHWAY SYSTEMS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; MOTOR TRANSPORTATION; OPTIMIZATION; PROBLEM SOLVING;

DYNAMIC TRAFFIC ASSIGNMENT; INTELLIGENT TRANSPORTATION SYSTEM; MIXED INTEGER LINEAR PROGRAMMING;

OPERATIONS RESEARCH;

EID: 0031594051     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0191-2615(98)00013-7     Document Type: Article

References (21)

1. Branston, D. (1976) Link capacity functions: a review. Transportation Research 10, 223-236.
2. Carey, M. (1987) Optimal time-varying flows on congested networks. Operations Research 35(1), 58-69.
3. Carey, M. (1990) Extending and solving a multiperiod congested network flow model. Computers and Operations Research 17(5), 495-507.
4. Chen, P. S. and Mahmassani, H. S. (1993) An investigation of the reliability of real-time information systems for route choice decisions in a congested traffic system. Transportation 20(2), 157-178.
5. Daganzo, C. F. (1995) Properties of link travel time functions under dynamic loads. Transportation Research-B 29, 95-98.
6. Friesz, T. L., Luque, J., Tobin, R. L. and Wie, B. W. (1989) Dynamic network traffic assignment considered as a continuous time optimal control problem. Operations Research 37(6), 893-901.
7. Janson, B. N. (1989) Dynamic traffic assignment for urban road networks. Transportation Research-B 25(2/3), 143-161.
8. Janson, B. N. (1991) A convergent algorithm for dynamic traffic assignment. Transportation Research Record 1328, 69-80.
9. Kaufman, D. E. and Smith, R. L. (1993) Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. IVHS Journal 1(1), 1-11.
10. LeBlanc, L. J. (1975) An algorithm for the discrete network design problem. Transportation Science 9, 183-199.
11. McGurrin, M. F. and Wang, P. T. R. (1991) An object-oriented traffic simulation with IVHS applications. SAE Vehicle Navigation and Information Systems Conference Proceedings P-253, pp. 551-561.
12. Merchant, D. K. and Nemhauser, G. L. (1978) A model and an algorithm for the dynamic traffic assignment problems. Transportation Science 12(3), 183-199.
13. Murty, K. (1976) Linear and Combinatorial Programming. John Wiley, New York.
14. Potts, R. B. and Oliver, R. M. (1972) Flows in Transportation Networks. Academic Press, New York.
15. Ran, B. and Boyce, D. E. (1994) Dynamic Urban Transportation Network Models: Theory and Implications for Intelligent Vehicle-Highway Systems. Springer-Verlag, Berlin.
16. Ran, B., Boyce, D. E. and LeBlanc, L. J. (1993) A new class of instantaneous dynamic user-optimal traffic assignment models. Operations Research 41(1), 192-202.
17. Schochetman, I. E. and Smith, R. L. (1998) Existence and discovery of average optimal solutions in infinite horizon optimization. Mathematics of Operations Research (in press).
18. Sheffi, Y. (1985) Urban Transportation Networks. Prentice-Hall, Englewood Cliffs, N.J.
19. Van Aerde, M., Voss, J., Ugge, A. and Case, E. R. (1989) An integrated approach to managing traffic congestion in combined freeway and traffic signal networks. ITE Journal 59(2), 36-42.
20. Wie, B. W. (1991) Dynamic analysis of user-optimized network flows with elastic travel demand. Transportation Research Record 1328, 81-87.
21. Wie, B. W., Friesz, T. L. and Tobin, R. L. (1990) Dynamic user optimal traffic assignment on congested multidestination networks. Transportation Research-B 24(6), 431-442.