Minimum cost time-varying network flow problems

Optimization Methods and Software

Volumn 25, Issue 3, 2010, Pages 429-447

  Nasrabadi, Ebrahim ^a,b   Hashemi, S Mehdi ^a  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Minimum cost dynamic flow; Network flows; Shortest dynamic path; Time varying networks

Indexed keywords

DISCRETE TIME VERSION; DISCRETE-TIME MODEL; DYNAMIC FLOWS; MINIMUM COST; MINIMUM COST DYNAMIC FLOW; SHORTEST PATH ALGORITHMS; STORAGE CAPACITY; STORAGE COSTS; TIME COMPLEXITY; TIME HORIZONS; TIME VARYING; TRANSIT CAPACITY; TRANSIT TIME; UPPER BOUND;

ALGORITHMS; TIME VARYING NETWORKS; TIME VARYING SYSTEMS;

COSTS;

EID: 77949556155     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780903239121     Document Type: Article

References (31)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall,Englewood Cliffs, NJ, 1993.
2. R.K. Ahuja, J.B. Orlin, S.Pallottino, and M.G. Scutella, Dynamic shortest paths minimizing travel times and costs, Networks 41 (2003), pp. 197-205.
3. E.J. Aronson, A survey of dynamic network flows, Ann. Oper. Res. 20 (1989), pp. 1-66.
4. X. Cai, T. Kloks, and C.K. Wong, Time-varying shortest path problems with constraints, Networks 29 (1997), pp. 141-149.
5. X. Cai, D. Sha, and C.K. Wong, Time-varying minimum cost flow problems, European J. Oper. Res. 131 (2001), pp. 352-374.
6. L. Chabini, Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time, Transport. Res. Record 1645 (1998), pp. 170-175.
7. L. Cheng and M.A. Duran, Logistics for world-wide crude oil transportation using discrete event simulation and optimal control, Comput. Chem. Eng. 28 (2004), pp. 897-911.
8. L. Cooke and E. Halsey, The shortest route through a network with time-dependent internodal transit times J. Math. Anal. Appl. 14 (1966), pp. 492-498.
9. E.W. Dijkstra, A note on two problems in connection with graphs, Numer. Math. 1 (1959), pp. 269-271.
10. S.E. Dreyfus, An appraisal of some shortest-path algorithms, Oper. Res. 17 (1969), pp. 395-412.
11. L.K. Fleischer and E. Tardos, Efficient continuous-time dynamic network flow algorithms, Oper. Res. Lett. 23 (1998), pp. 71-80.
12. L. Fleischer and M. Skutella, Minimum cost flows over time without intermediate storage, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 2003, pp. 66-75.
13. L.K. Fleischer and M. Skutella, Quickest flows over time, SIAM J. Comput. 36 (2007), pp. 1600-1630.
14. L.R. Ford and D.R. Fulkerson, Constructing maximal dynamic flows from static flows, Oper. Res. 6 (1958), pp. 419-433.
15. L. Ford and D. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
16. D. Gale, Transient fows in networks, Michigan Math. J. 6 (1959), pp. 59-63.
17. A. Hall, S. Hippler, and M. Skutella, Multicommodity flows over time: Efficient algorithms and complexity, Theoret. Comput. Sci. 2719 (2003), pp. 397-409.
18. B. Hoppe, Efficient dynamic network flow algorithms, PhD thesis, Cornell University, 1995.
19. B. Hoppe and E. Tardos, The quickest transshipment problem, Math. Oper. Res. 25 (2000), pp. 36-62.
20. D.E. Kaufman and R.L. Smith, Fastest paths in time-dependent networks for intelligent vehicle-highway systems application, IVHS J 1 (1993), pp. 1-11.
21. B. Klinz and G.Woeginger, Minimum cost dynamic flows: The series-parallel case, Network 43 (2004), pp. 153-162.
22. E. Köhler and M. Skutella, Flows over time with load-dependent transit times, SIAM J. Optim. 15 (2005), pp. 1185-1202.
23. V. Melkonian, Flows in dynamic networks with aggregate arc capacities, Inform. Process. Lett. 101 (2007), pp. 30-35.
24. E. Miller-Hooks and S.S. Patterson, On solving quickest time problems in time-dependent, dynamic networks, J. Math. Modell. Algorithms 3 (2004), pp. 39-71.
25. E. Minieka, Maximal, lexicographic, and dynamic network fows, Oper. Res. 21 (1973), pp. 517-527.
26. A. Orda and R. Rom, Shortest-path and minimum-delay algorithms in networks with time-dependent edge length, J. ACM 37 (1990), pp. 607-625.
27. A. Orda and R. Rom, Minimum weight paths in time-dependent networks, Networks 21 (1991), pp. 295-320.
28. S. Pallottino and M.G. Scutella, Shortest path algorithms in transportation models: Classical and innovative aspects, in Equilibrium and advanced transportation modelling, P. Marcotte and S. Nguyen, eds., Kluwer, Norwell, MA, 1998, pp. 245-281.
29. W.B. Powell, P. Jaillet, and A. Odoni, Stochastic and dynamic networks and routing, in Handbooks in OR and MS: Network Routing, in M. Ball, T. Magnanti, C. Monma and G. Nemhauser, eds., North-Holland, Amsterdam, The Netherlands, 1995, pp. 141-295.
30. M. Skutella, An introduction to network flows over time, inResearch Trends in Combinatorial Optimization,W. Cook, L. Lovász and J. Vygen, eds., Springer, Berlin, 2009, pp. 451-482.
31. W.L. Wilkinson, An algorithm for universal maximal dynamic fows in a network, Oper. Res. 19 (1971), pp. 1602-1612.