Benders decomposition for discrete-continuous linear bilevel problems with application to traffic network design

Transportation Research Part B: Methodological

Volumn 70, Issue , 2014, Pages 163-172

  Fontaine, Pirmin ^a   Minner, Stefan ^a  

^a TUM SCHOOL OF MANAGEMENT   (Germany)

Author keywords

Benders decomposition; Bilevel programming; Discrete network design problem; Linear approximation

Indexed keywords

BINS; COMPLEX NETWORKS; FUNCTIONS; LINEARIZATION;

BENDERS DECOMPOSITION; BENDERS DECOMPOSITION ALGORITHM; BI-LEVEL PROGRAMMING; DISCRETE NETWORK DESIGN PROBLEM; KARUSH KUHN TUCKER CONDITION; LINEAR APPROXIMATIONS; LINEARIZATION METHODS; NONLINEAR OBJECTIVE FUNCTIONS;

STOCHASTIC PROGRAMMING;

ALGORITHM; DECOMPOSITION ANALYSIS; NETWORK ANALYSIS; NUMERICAL METHOD; TRANSPORTATION SYSTEM;

EID: 84907696032     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2014.09.007     Document Type: Article

References (38)

1. Abdulaal M., LeBlanc L.J. Continuous equilibrium network design models. Transportation Research Part B 1979, 13(1):19-32.
2. Bard J.F. Practical Bilevel Optimization: Algorithms and Applications 1998, Springer.
3. Bard J., Moore J. A branch and bound algorithm for the bilevel programming problem. SIAM Journal on Scientific and Statistical Computing 1990, 11(2):281-292.
4. Bar-Gera, H. (2013). Transportation Network Test Problems. url: . http://www.bgu.ac.il/~bargera/tntp/.
5. Ben-Ayed O., Blair C.E. Computational difficulties of bilevel linear programming. Operations Research 1990, 38(3):556-560.
6. Benders J. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 1962, 4(1):238-252.
7. Bialas W.F., Karwan M.H. Two-level linear programming. Management Science 1984, 30(8):1004-1020.
8. Braess D., Nagurney A., Wakolbinger T. On a paradox of traffic planning. Transportation Science 2005, 39(4):446-450.
9. Bureau of Public Roads, 1964. Traffic Assignment Manual. U.S. Department of Commerce, Urban Planning Division. Washington, DC.
10. Cao D., Chen M. Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach. European Journal of Operational Research 2006, 169(1):97-110.
11. Colson B., Marcotte P., Savard G. Bilevel programming: a survey. 4OR 2005, 3(2):87-107.
12. Dempe S. Foundations of Bilevel Programming 2002, Springer.
13. Ekström J., Sumalee A., Lo H.K. Optimizing toll locations and levels using a mixed integer linear approximation approach. Transportation Research Part B 2012, 46(7):834-854.
14. Farahani R.Z., Miandoabchi E., Szeto W., Rashidi H. A review of urban transportation network design problems. European Journal of Operational Research 2013, 229(2):281-302.
15. Farvaresh H., Sepehri M.M. A single-level mixed integer linear formulation for a bi-level discrete network design problem. Transportation Research Part E: Logistics and Transportation Review 2011, 47(5):623-640.
16. Gao Z., Wu J., Sun H. Solution algorithm for the bi-level discrete network design problem. Transportation Research Part B 2005, 39(6):479-495.
17. Geoffrion A.M. Generalized benders decomposition. Journal of Optimization Theory and Applications 1972, 10(4):237-260.
18. Grossmann I.E., Floudas C.A. Active constraint strategy for flexibility analysis in chemical processes. Computers and Chemical Engineering 1987, 11(6):675-693.
19. Hansen P., Jaumard B., Savard G. New branch-and-bound rules for linear bilevel programming. SIAM Journal on Scientific and Statistical Computing 1992, 13(5):1194-1217.
20. Imamoto A., Tang B. Optimal piecewise linear approximation of convex functions. Proceedings of the World Congress on Engineering and Computer Science 2008, 1191-1194. Citeseer.
21. LeBlanc L.J. An algorithm for the discrete network design problem. Transportation Science 1975, 9(3):183-199.
22. Luathep P., Sumalee A., Lam W.H., Li Z.-C., Lo H.K. Global optimization method for mixed transportation network design problem: a mixed-integer linear programming approach. Transportation Research Part B 2011, 45(5):808-827.
23. Magnanti T.L., Wong R.T. Accelerating benders decomposition: algorithmic enhancement and model selection criteria. Operations Research 1981, 29(3):464-484.
24. Mathew T.V., Sharma S. Capacity expansion problem for large urban transportation networks. Journal of Transportation Engineering 2009, 135(7):406-415.
25. Meng Q., Yang H. Benefit distribution and equity in road network design. Transportation Research Part B 2002, 36(1):19-35.
26. Nemhauser G.L., Wolsey L.A. Integer and Combinatorial Optimization 1988, Wiley, New York.
27. Nguyen S. An algorithm for the traffic assignment problem. Transportation Science 1974, 8(3):203-216.
28. Poorzahedy H., Abulghasemi F. Application of ant system to network design problem. Transportation 2005, 32(3):251-273.
29. Poorzahedy H., Rouhani O.M. Hybrid meta-heuristic algorithms for solving network design problem. European Journal of Operational Research 2007, 182(2):578-596.
30. Poorzahedy H., Turnquist M.A. Approximate algorithms for the discrete network design problem. Transportation Research Part B 1982, 16(1):45-55.
31. Saharidis G., Ierapetritou M. Resolution method for mixed integer bi-level linear problems based on decomposition technique. Journal of Global Optimization 2009, 44(1):29-51.
32. Sahinidis N., Grossmann I.E. Convergence properties of generalized benders decomposition. Computers and Chemical Engineering 1991, 15(7):481-491.
33. Schneeweiß C. Distributed Decision Making 2003, Springer. 2nd ed.
34. Sheffi Y. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods 1985, Prentice-Hall, Inc.
35. Suh S., Kim T. Solving nonlinear bilevel programming models of the equilibrium network design problem: a comparative review. Annals of Operations Research 1992, 34(1):203-218.
36. Wang S., Meng Q., Yang H. Global optimization methods for the discrete network design problem. Transportation Research Part B 2013, 50:42-60.
37. Wardrop J.G. Some theoretical aspects of road traffic research. ICE Proceedings: Engineering Divisions 1952, vol. 1.3:325-362. Thomas Telford.
38. Xu T., Wei H., Hu G. Study on continuous network design problem using simulated annealing and genetic algorithm. Expert Systems with Applications 2009, 36(2):1322-1328.