Approximating earliest arrival flows with flow-dependent transit times

Discrete Applied Mathematics

Volumn 155, Issue 2, 2007, Pages 161-171

  Baumann, Nadine ^a   Köhler, Ekkehard ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Dynamic flows; Earliest arrival flows; Flows over time; Optimization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION; TIME DOMAIN ANALYSIS;

CONSTANT FACTOR APPROXIMATION; DYNAMIC FLOWS; EARLIEST ARRIVAL FLOWS; FLOWS OVER TIME;

PROBLEM SOLVING;

EID: 33751177071     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.04.030     Document Type: Article

References (19)

1. Carey M., and Subrahmanian E. An approach to modeling time-varying flows on congested networks. Transportation Res. Part B 34 (2000) 157-183
2. L. Fleischer, Universally maximum flow with piecewise-constant capacities, in: G. Cornuejols, R.E. Burkard, G. Woeginger (Eds.), Seventh International IPCO Conference, Lecture Notes in Computer Science, vol. 1610, Springer, Berlin, 1999, pp. 151-165.
3. L. Fleischer, M. Skutella, Minimum cost flows over time without intermediate storage. in: 14th ACM-SIAM Symposium on Discrete Algorithms (SODA'03), 2003, pp. 66-75.
4. Ford L.R., and Fulkerson D.R. Constructing maximal dynamic flows from static flows. Oper. Res. 6 (1958) 419-433
5. Ford L.R., and Fulkerson D.R. Flows in Networks (1962), Princeton University Press, Princeton, NJ
6. D. Gale, Transient flows in networks, Michigan Math. J. (1959) 59-63.
7. A. Hall, K. Langkau, M. Skutella, An FPTAS for quickest multicommodity flows with inflow-dependent transit times, in: S. Arora, K. Jansen, J.D. Rolim, A. Sahai (Eds.), Approximation, Randomization, and Combinatorial Optimization (APPROX'03), Lecture Notes in Computer Science, vol. 2764, Springer, Berlin, 2003, pp. 71-82.
8. Hall L.A., Schulz A., Shmoys D.B., and Wein J. Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Seventh ACM-SIAM Symposium on Discrete Algorithms (SODA'96) (1996) 142-151
9. Hamacher H.W., and Tjandra S.A. Earliest arrival flow model with time dependent capacity for solving evacuation problems. Pedestrian and Evacuation Dynamics (2002) 267-276
10. Hamacher H.W., and Tjandra S.A. Mathematical modeling of evacuation problems: a state of the art. Pedestrian and Evacuation Dynamics (2002) 227-266
11. Hoppe B., and Tardos E. Polynomial time algorithms for some evacuation problems. Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'94) (1994) 433-441
12. E. Köhler, K. Langkau, M. Skutella, Time-expanded graphs for flow-dependent transit times, in: R.H. Möhring, R. Raman (Eds.), Algorithms-ESA 02, Lecture Notes in Computer Science, vol. 2461, Springer, Berlin, 2002, pp. 599-611.
13. Köhler E., and Skutella M. Flows over time with load-dependent transit times. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02). San Francisco, CA (2002) 174-183
14. Merchant D.K., and Nemhauser G.L. A model and an algorithm for the dynamic traffic assignment problems. Transportation Sci. 12 3 (1978) 183-199
15. Minieka E. Maximal, lexicographic, and dynamic network flows. Oper. Res. 21 (1973) 517-527
16. Ogier R.G. Minimum-delay routing in continuous time dynamic networks with piecewise-constant capacities. Networks 18 (1988) 303-318
17. S.A. Tjandra, Dynamic network optimization with application to the evacuation problem, Ph.D. Thesis, Fachbereich Mathematik der Universität Kaiserslautern, 2003.
18. Wilkinson W.L. An algorithm for universal maximal dynamic flows in a network. Oper. Res. 19 (1971) 1602-1612
19. Zadeh N. A bad network problem for the simplex method and other minimum cost flow algorithms. Math. Programming 5 (1973) 255-266