Advertisement

Networks and Spatial Economics

, Volume 13, Issue 1, pp 67–106 | Cite as

A Branch and Bound Algorithm for Bi-level Discrete Network Design Problem

  • Hamid Farvaresh
  • Mohammad Mehdi Sepehri
Article

Abstract

Discrete network design problem (DNDP) is generally formulated as a bi-level programming. Because of non-convexity of bi-level formulation of DNDP which stems from the equilibrium conditions, finding global optimal solutions are very demanding. In this paper, a new branch and bound algorithm being able to find exact solution of the problem is presented. A lower bound for the upper-level objective and its computation method are developed. Numerical experiments show that our algorithm is superior to previous algorithms in terms of both computation time and solution quality. The conducted experiments indicate that in most cases the first incumbent solution which is obtained within a few seconds is superior to the final solution of some of previous algorithms.

Keywords

Network design problem Bi-level programming Branch and bound Outer approximation 

Notes

Acknowledgments

The authors would like to thank the three anonymous referees for many thoughtful and constructive comments. We also wish to thank Mr. Fouad Behzadpour for his grammatical and lexical revisions and comments. We accept full responsibility for all the remaining errors and shortcomings.

References

  1. Abdulaal M, LeBlanc LJ (1979) Continous equilibrium network design models. Transp Res 13B:19–32CrossRefGoogle Scholar
  2. Bar-Gera H (2002) Origin-based algorithm for the traffic assignment problem. Transp Sci 36:398–417CrossRefGoogle Scholar
  3. Boyce DE (1984) Urban transportation netwrok equilibrium and design models: recent achievements and future prospectives. Environ Plann A 16:1445–1474CrossRefGoogle Scholar
  4. Boyce DE, Farhi A, Weischedel R (1973) Optimal network problem: a branch-and-bound algorithm. Environ Plann 5:519–533CrossRefGoogle Scholar
  5. Chung BD, Yao T, Xie C, Thorsen A (2011) Robust optimization model for a dynamic network design problem under demand uncertainty. Netw Spat Econ 11:371–389CrossRefGoogle Scholar
  6. Dantzig GB, Harvey RP, Lansdowne ZF, Robinson DW, Maier SF (1979) Formulating and solving the network design problem by decomposition. Transp Res 13B:5–17CrossRefGoogle Scholar
  7. Drezner T, Salhi S (2002) Using hybrid metaheuristics for the one-way and two-way network design problem. Nav Res Log 49:449–463CrossRefGoogle Scholar
  8. Duan L, Xiaoling S (2006) Nonlinear integer programming. Springer, New YorkGoogle Scholar
  9. Duran MA, Grossmann IE (1986) An outer algorithm for a class of mixed integer nonlinear programs. Math Program 36:307CrossRefGoogle Scholar
  10. Farvaresh H, Sepehri MM (2011) A single-level mixed integer linear formulation for a bi-level discrete network design problem. Transp Res 47E:623–640Google Scholar
  11. Fletcher R, Leyffer S (1994) Solving mixed integer nonlinear programs by outer approximation. Math Program 66:327CrossRefGoogle Scholar
  12. Floudas C (1995) Nonlinear and mixed-integer optimization-fundamentals and applications. Oxford University Press, New YorkGoogle Scholar
  13. Floudas CA, Pardalos PM (2009) Encyclopedia of optimization, 2nd edn. Springer, New YorkCrossRefGoogle Scholar
  14. Friesz TL (1985) Transportation network equilibrium, design and aggregation: key developments and research opportunities. Transp Res 19A:413–427Google Scholar
  15. Friesz TL, Cho HJ, Mehta NJ, Tobin RL, Anadalingam G (1992) A simulated annealing approach to the network design problem with variational inequality constraints. Transp Sci 26:18–26CrossRefGoogle Scholar
  16. Gao Z, Wu J, Sun H (2005) Solution algorithm for the bi-level discrete network design problem. Transp Res 39B:479–495CrossRefGoogle Scholar
  17. Geoffrion AM (1972) Generalized Benders decomposition. J Optimiz Theory App 10:237–260CrossRefGoogle Scholar
  18. Haghani AE, Daskin MS (1983) Network design application of an extraction algorithm for network aggregation. Transp Res Rec 944:37–46Google Scholar
  19. Holmberg K, Hellstrand J (1998) Solving the uncapacitated network design problem by a Lagrangian heuristic and branch-and-bound. Oper Res 46:247–259CrossRefGoogle Scholar
  20. Ibaraki T (1987) Enumerative approaches to combinatorial optimization. Ann Oper Res 10(11)Google Scholar
  21. Karakostas G, Taeyon K, Anastasios V, Xia H (2011) On the degradation of performance for traffic networks with oblivious users. Transp Res 45B: 364–371Google Scholar
  22. Karoonsoontawong A, Waller ST (2006) Dynamic continuous network design problem: linear bilevel programming and metaheuristic approaches. Transp Res Rec 1964:104–117CrossRefGoogle Scholar
  23. Kim BJ, Kim W (2006) An equilibrium network design model with a social cost function for multimodal networks. Ann Regional Sci 40:473–491CrossRefGoogle Scholar
  24. Leblanc LJ (1975) An algorithm for the discrete network design problem. Transp Sci 9:183–199CrossRefGoogle Scholar
  25. LeBlanc LJ, Boyce DE (1986) A bilevel programming algorithm for exact solution of the network design problem with user-optimal flows. Transp Res 20B:259–265CrossRefGoogle Scholar
  26. Leblanc LJ, Morlok EK, Pierskalla WP (1975) An efficient approach to solving the road network equilibrium traffic assignment problem. Transp Res 9B:309–318Google Scholar
  27. Lee CK, Yang KI (1994) Network design of one-way streets with simulated annealing. Pap Reg Sci 32(2):119–134Google Scholar
  28. Lin DY, Karoonsoontawong A, Waller ST (2011) Dantzig-Wolfe decomposition based heuristic scheme for bi-level dynamic network design problem. Netw Spat Econ 11:101–126CrossRefGoogle Scholar
  29. Luathep P, Sumalee A, Lam WHK, Li Z-C, Lo HK (2011) Global optimization method for mixed transportation network design problem: a mixed-integer linear programming approach. Transp Res 45B:808–827CrossRefGoogle Scholar
  30. Magnanti TL, Wong RT (1984) Network design and transportation planning: models and algorithms. Transp Sci 18:1–55CrossRefGoogle Scholar
  31. Meng Q, Yang H, Bell MGH (2001) An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem. Transp Res 35B:83–105CrossRefGoogle Scholar
  32. Miandoabchi E, Zanjirani FR, Dullaert W, Szeto WY (2011) Hybrid evolutionary metaheuristics for concurrent multi-objective design of urban road and public transit networks. Netw Spat Econ. doi: 10.1007/s11067-011-9163-x
  33. Nie YM (2010) A class of bush-based algorithms for the traffic assignment problem. Transp Res 44B:73–89CrossRefGoogle Scholar
  34. Patriksson M (1994) The traffic assignment problems: models and methods. VSP, UterchtGoogle Scholar
  35. Poorzahedy H, Abulghasemi F (2005) Application of ant system to network design problem. Transportation 32:251–273CrossRefGoogle Scholar
  36. Poorzahedy H, Rouhani OM (2007) Hybrid meta-heuristic algorithms for solving network design problem. Eur J Oper Res 182:578–596CrossRefGoogle Scholar
  37. Poorzahedy H, Turnquist MA (1982) Approximate algorithms for the discrete network design problem. Transp Res 16B:45–55CrossRefGoogle Scholar
  38. Sheffi Y (1985) Urban transportation network: equilibrium analysis with mathematical programming methods. Prentice Hall, England CliffsGoogle Scholar
  39. Steenbrink A (1974a) Transport network optimization in the Dutch integral transportation study. Transp Res 8B:11–27Google Scholar
  40. Steenbrink PA (1974b) Optimization of transport networks. John Wiley & Sons, New YorkGoogle Scholar
  41. Sun Y, Song R, He S, Chen Q (2009) Mixed transportation network design based on immune clone annealing algorithm. J Transp Syst Eng Inf Technol 9(3):103–108Google Scholar
  42. Wang DZW, Lo HK (2010) Global optimum of the linearized network design problem with equilibrium flows. Transp Res 44B:482–492CrossRefGoogle Scholar
  43. Xiong Y, Schneider JB (1995) Transportation network design using a cumulative genetic algorithm and neural network. Transp Res Rec 1364:37–44Google Scholar
  44. Xu T, Wei H, Hu G (2009) Study on continuous network design problem using simulated annealing and genetic algorithm. Expert Syst Appl 36:1322–1328CrossRefGoogle Scholar
  45. Yang H, Bell MGH (1998) Models and algorithms for road network design: a review and some new developments. Transport Rev 18:257–278CrossRefGoogle Scholar
  46. Zhang H, Gao Z (2009) Bilevel programming model and solution method for mixed transportation network design problem. J Syst Sci Complex 22:446–459CrossRefGoogle Scholar
  47. Zhang L, Lawphongpanich S, Yin Y (2009) An active-set algorithm for discrete network design problems. The 18th International Symposium on Transportation and Traffic Theory, Hong Kong, Springer. In: Lam, W. H. K., Wong, S. C., Lo H. K., 2009. Transportation and Traffic Theory 2009: Golden Jubilee, 283–300, SpringerGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.Department of Industrial EngineeringUniversity of KurdistanSanandajIran
  2. 2.Department of Industrial EngineeringTarbiat Modares UniversityTehranIran

Personalised recommendations