A flow algorithm for network synchronization

Operations Research

Volumn 44, Issue 4, 1996, Pages 570-578

  Hassin, Refael ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER WORKSTATIONS; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMAL SYSTEMS; OPTIMIZATION; SCHEDULING; SYNCHRONIZATION;

FLOW ALGORITHM; NETWORK SYNCHRONIZATION; NODE VARIABLES;

PRODUCTION CONTROL;

EID: 0030182440     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.44.4.570     Document Type: Article

References (27)

1. ALLSOP, R. E. 1986. Selection of Offsets to Minimize Delay to Traffic in a Network Controlled by Fixed-time Signals. Trans. Sci. 2, 1-13.
2. BEN-ZVI, R. 1991. Optimization of Traffic Signals Control. M.Sc. Thesis, Statistics Department, Tel Aviv University, Israel.
3. BURKARD, R. E. 1986. Optimal Schedules for Periodically Recurring Events. Discr. Appl. Math. 15, 167-180.
4. ERVOLINA, T. R. AND T. MCCORMICK. 1993. Cancelling Most Helpful Cuts for Minimum Cost Network Flow. Networks 23, 41-52.
5. FOULDS, L. R. 1986. TRANSYT Traffic Engineering Program Efficiency Improvement via Fibonacci Search. Trans. Res. 20A, 331-335.
6. GAREY, M. R., AND D. S. JOHNSON. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman & Company, San Francisco.
7. GARTNER, N. H. 1972a. Constraining Relations Among Offsets in Synchronized Signal Networks. Transp. Sci. 6, 88-93.
8. GARTNER, N. H. 1972b. Algorithms for dynamic road-traffic control. Proc. 5th IFAC World Cong., Paris. 1-6.
9. GARTNER, N. H. AND J. D. C. LITTLE. 1975. Generalized Combination Method for Area Traffic Control. Trans. Res. Record 531, 58-69.
10. GARTNER, N. H., J. D. C. LITTLE, AND H. GABBAY. 1975. Optimization of Traffic Signal Settings by Mixed-Integer Linear Programming. Trans. Sci. 9, 321-363.
11. HASSIN, R. 1983. The Minimum Cost Flow Problem: A Unifying Approach to Dual Algorithms and a New Tree-search Algorithm. Math. Prog. 25, 228-239.
12. HASSIN, R. 1992. Algorithms for the Minimum Cost Circulation Problem Based on Maximizing the Mean Improvement. Opns. Res. Lett. 12, 227-233.
13. HILLIER, J. A. 1967. The Synchronization of Traffic Signals for Minimum Delay. Trans. Sci. 1, 81-94.
14. IMPORTA, G., AND A. SFORZA. 1982. Optimal Offsets for Traffic Signal System in Urban Networks. Trans. Res. 16B, 043-161.
15. KARAZANOV, A. V., AND S. T. MCKORMICK. 1993. Polynomial Methods for Separable Convex Optimization Linear Spaces with Applications to Circulations and Cocirculations in Networks. To appear in SIAM J. Computing, extended abstract in Proc. Sixth SODA 1995, 78-87.
16. LOVETSKII, S. E., AND I. I. MELAMED. 1987. Static Flows in Networks. Aut Remot R 48, 1269-1291. Translated from Avtomatika i Telemekhanika 10, 2-29, October 1987.
17. LOVETSKII, S. E., AND I. I. MELAMED. 1987. Static Flows in Networks. Aut Remot R 48, 1269-1291. Translated from Avtomatika i Telemekhanika 10, 2-29, October 1987.
18. MCCORMICK, T., AND T. R. ERVOLINA. 1994. Computing Maximum Mean Cuts. Discrete Appl. Math. 52, 53-70.
19. ROBERTSON, D. I. 1969. TRANSYT: A Traffic Network Study Tool. Road Research Laboratory Report LR 253, Crowthorne, Berkshire, England.
20. ROCKAFELLAR, R. T. 1984. Network Flows and Monotropic Optimization. John Wiley & Sons, New York.
21. SANDI C. 1986. On a Nonbasic Dual Method for the Transportation Problem. Math. Prog. Study 26, 65-82.
22. SCHRIJVER, A. 1986. Theory of Linear and Integer Programming. John Wiley & Sons, New York.
23. SERAFINI, P., AND W. UKOVICH. 1989a. A Mathematical Model for the Fixed-time Traffic Control Problem. European J. Opnl. Res. 42, 152-165.
24. SERAFINI, P. AND W. UKOVICH. 1989b. A Mathematical Model for Periodic Scheduling Problems. SIAM J. Discrete Math. 2, 550-581.
25. TAMIR, A. 1993. Complexity Results for the p-median Problem with Mutual Communication. Opns. Res. Lett. 14, 79-84.
26. TSAY, H-S., AND K-T. WANG. 1989. Use of Three-Dimensional Conjugate Directions Search Method to Improve TRANSYT-7F Computational Efficiency. Trans. Res. Record 1225, 116-129.
27. WONG, W. S., AND R. J. T. MORRIS. 1989. A New Approach to Choosing Initial Points in Local Search. Info. Processing Lett. 30, 67-72.