A single-level mixed integer linear formulation for a bi-level discrete network design problem

Transportation Research Part E: Logistics and Transportation Review

Volumn 47, Issue 5, 2011, Pages 623-640

  Farvaresh, Hamid ^a   Sepehri, Mohammad Mehdi ^a  

^a TARBIAT MODARES UNIVERSITY   (Iran)

Author keywords

Bi level programming; Discrete network design problem; Multi commodity flows; Transportation network

Indexed keywords

COMPLEX NETWORKS; TRAVEL TIME;

ADJACENCY MATRIX; BI-LEVEL PROGRAMMING; DISCRETE NETWORK DESIGN PROBLEM; INTEGER LINEAR PROGRAMMING FORMULATION; MIXED INTEGER LINEAR; MIXED INTEGER LINEAR FORMULATION; MULTI-COMMODITY FLOW; SINGLE LEVEL; TRANSPORTATION NETWORK; TRAVEL TIME FUNCTIONS;

INTEGER PROGRAMMING;

LINEAR PROGRAMING; NETWORK DESIGN; TRANSPORTATION SYSTEM; TRAVEL TIME;

EID: 79955117081     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2011.02.001     Document Type: Article

References (41)

1. Abdulaal M., Leblanc L.J. Continuous equilibrium network design models. Transportation Research Part B 1979, 13:19-32.
2. Asakura, Y., Sasaki, T., 1990. Formulation and feasibility test of optimal road network design model with endogenously determined travel demand. In: Proceedings of the 5th World Congress on Transport Research, Japan.
3. Bar-Gera H. Origin-based algorithm for the transportation assignment problem. Transportation Science 2002, 36:398-417.
4. Bazaraa M.S., Sherali H.D., Shetty C.M. Nonlinear Programming - Theory and Algorithms 2006, John Wiley & Sons, Hoboken, New Jersey.
5. Boyce D.E. Urban transportation network equilibrium and design models: recent achievements and future prospectives. Environment and Planning, A 1984, 16:1445-1474.
6. Boyce D.E., Farhi A., Weischedel R. Optimal network problem: a branch-and-bound algorithm. Environment and Planning 1973, 5:519-533.
7. Chen M., Alfa A.S. Algorithm for solving fisk's stochastic traffic assignment model. Transportation Research Part B 1991, 25:405-412.
8. Dantzig G.B., Harvey R.P., Lansdowne Z.F., Robinson D.W., Maier S.F. Formulating and solving the network design problem by decomposition. Transportation Research Part B 1979, 13:5-17.
9. Davis G.A. Exact local solution of the continuous network design problem via stochastic user equilibrium assignment. Transportation Research Part B 1994, 28:61-75.
10. Drezner T., Salhi S. Using hybrid metaheuristics for the one-way and two-way network design problem. Naval Research Logistics 2002, 49:449-463.
11. Ferris M.C., Meeraus A., Rutherford T.F. Computing Wardropian equilibrium in a complementarity framework. Optimization Methods and Software 1999, 10:669-685.
12. Floudas C. Nonlinear and Mixed-integer Optimization - Fundamentals and Applications 1995, Oxford University Press, New York.
13. Freisz T.L. Transportation network equilibrium, design and aggregation: key developments and research opportunities. Transportation Research Part A 1985, 19:413-427.
14. Friesz T.L., Cho H.J., Mehta N.J., Tobin R.L., Anadalingam G. A simulated annealing approach to the network design problem with variational inequality constraints. Transportation Science 1992, 26:18-26.
15. Gao Z., Wu J., Sun H. Solution algorithm for the bi-level discrete network design problem. Transportation Research Part B 2005, 39:479-495.
16. Haghani A.E., Daskin M.S. Network design application of an extraction algorithm for network aggregation. Transportation Research Record 1983, 944:37-46.
17. Holmberg K., Hellstrand J. Solving the uncapacitated network design problem by a lagrangian heuristic and branch-and-bound. Operations Research 1998, 46:247-259.
18. Karoonsoontawong A., Waller S.T. Dynamic continuous network design problem: linear bilevel programming and metaheuristic approaches. Transportation Research Record 2006, 1964:104-117.
19. Kim B.J., Kim W. An equilibrium network design model with a social cost function for multimodal networks. The Annals of Regional Science 2006, 40:473-491.
20. Leblanc L.J. An algorithm for the discrete network design problem. Transportation Science 1975, 9:183-199.
21. Leblanc L.J., Boyce D.E. A bilevel programming algorithm for exact solution of the network design problem with user-optimal flows. Transportation Research Part B 1986, 20:259-265.
22. Lee C.K., Yang K.I. Network design of one-way streets with simulated annealing. Papers in Regional Science 1994, 32:119-134.
23. Magnanti T.L., Wong R.T. Network design and transportation planning: models and algorithms. Transportation Science 1984, 18:1-55.
24. Marcotte, P., Patriksson, M. 2007. Traffic equilibrium. In: Barnhart, C., Laporte, G. (Eds.), Handbook in Operations Research and Management Science.
25. Meng Q., Yang H., Bell M.G.H. An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem. Transportation Research Part B 2001, 35:83-105.
26. Nie Y.M. A class of bush-based algorithms for the traffic assignment problem. Transportation Research Part B 2010, 44:73-89.
27. Patriksson, M. 1994. The Traffic Assignment Problems: Models and Methods, Utercht, The Netherlands, VSP.
28. Patriksson M. On the applicability and solution of bilevel optimization models in transportation science: a study on the existence, stability and computation of optimal solutions to stochastic mathematical programs with equilibrium constraints. Transportation Research Part B 2008, 42:843-860.
29. Poorzahedy H., Abulghasemi F. Application of ant system to network design problem. Transportation 2005, 32:251-273.
30. Poorzahedy H., Rouhani O.M. Hybrid meta-heuristic algorithms for solving network design problem. European Journal of Operational Research 2007, 182:578-596.
31. Poorzahedy H., Turnquist M.A. Approximate algorithms for the discrete network design problem. Transportation Research Part B 1982, 16:45-55.
32. Sheffi Y. Urban Transportation Network: Equilibrium Analysis with Mathematical Programming Methods 1985, Prentice Hall, England Cliffs, NJ.
33. Sherali H.D. On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions. Operations Research Letters 2001, 28:155-160.
34. Steenbrink P.A. Optimization of Transport Networks 1974, John Wiley & Sons, New York.
35. Steenbrink A. Transport network optimization in the dutch integral transportation study. Transportation Research Part B 1974, 8:11-27.
36. Sun Y., Song R., He S., Chen Q. Mixed transportation network design based on immune clone annealing algorithm. Journal of Transportation Systems Engineering and Information Technology 2009, 9:103-108.
37. Wang D.Z.W., Lo H.K. Global optimum of the linearized network design problem with equilibrium flows. Transportation Research Part B 2010, 44:482-492.
38. Xiong, Y., Schneider, J.B., 1995. Transportation network design using a cumulative genetic algorithm and neural network. Transportation Research Record, 1364.
39. Xu T., Wei H., Hu G. Study on continuous network design problem using simulated annealing and genetic algorithm. Expert Systems with Applications 2009, 36:1322-1328.
40. Yang H., Bell M.G.H. Models and algorithms for road network design: a review and some new developments. Transport Review 1998, 18:257-278.
41. Zhang H., Gao Z. Bilevel programming model and solution method for mixed transportation network design problem. Journal of Systems Science and Complexity 2009, 22:446-459.