Skip to main content
SpringerLink
Log in

A modified active set algorithm for transportation discrete network design bi-level problem

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

Transportation discrete network design problem (DNDP) is about how to modify an existing network of roads and highways in order to improve its total system travel time, and the candidate road building or expansion plan can only be added as a whole. DNDP can be formulated into a bi-level problem with binary variables. An active set algorithm has been proposed to solve the bi-level discrete network design problem, while it made an assumption that the capacity increase and construction cost of each road are based on the number of lanes. This paper considers a more general case when the capacity increase and construction cost are specified for each candidate plan. This paper also uses numerical methods instead of solvers to solve each step, so it provides a more direct understanding and control of the algorithm and running procedure. By analyzing the differences and getting corresponding solving methods, a modified active set algorithm is proposed in the paper. In the implementation of the algorithm and the validation, we use binary numeral system and ternary numeral system to avoid too many layers of loop and save storage space. Numerical experiments show the correctness and efficiency of the proposed modified active set algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. Code provided on http://ximing.wix.com/ximing#!research/c1ac3

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications. Tech. rep., DTIC Document (1988)

  2. Beckmann, M., McGuire, C., Winsten, C.B.: Studies in the economics of transportation. Tech. rep. (1956)

  3. Bertsekas, D.P.: Nonlinear programming, 2nd edn. Athena Scientific, Belmont (1999)

  4. CPLEX, I.I.: V12. 1: Users manual for CPLEX. Int. Bus. Mach. Corp. 46(53), 157 (2009)

  5. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  6. Drud, A.S.: Conopt a large-scale GRG code. ORSA J. Comput. 6(2), 207–216 (1994)

    Article  MATH  Google Scholar 

  7. Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Logist. Q. 3(1–2), 95–110 (1956)

    Article  MathSciNet  Google Scholar 

  8. Friesz, T.L., Bernstein, D., Smith, T.E., Tobin, R.L., Wie, B.: A variational inequality formulation of the dynamic network user equilibrium problem. Oper. Res. 41(1), 179–191 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fukushima, M.: A modified frank-wolfe algorithm for solving the traffic assignment problem. Transp. Res. Part B Methodol. 18(2), 169–177 (1984)

    Article  MathSciNet  Google Scholar 

  10. Larsson, T., Patriksson, M.: Side constrained traffic equilibrium models analysis, computation and applications. Transp. Res. Part B Methodol. 33(4), 233–264 (1999)

    Article  Google Scholar 

  11. Rosenthal, R.E.: Gams—a user’s guide. GAMS Development Corporation, Washington, DC (2004)

  12. Seref, O., Ahuja, R.K., Orlin, J.B.: Incremental network optimization: theory and algorithms. Oper. Res. 57(3), 586–594 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Sheffi, Y.: Urban transportation networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, Inc., Englewood Cliffs (1984)

  14. Skiena, S.: Dijkstra’s Algorithm. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Addison-Wesley, Reading (1990)

    MATH  Google Scholar 

  15. Yin, Y., Lawphongpanich, S.: A robust approach to continuous network designs with demand uncertainty. In: Transportation and Traffic Theory 2007. Papers Selected for Presentation at ISTTT17 (2007)

  16. Zhang, L., Lawphongpanich, S., Yin, Y.: An active-set algorithm for discrete network design problems. In: Lam, W.H.K., Wong, H., Lo, H.K. (eds.) Transportation and Traffic Theory 2009: Golden Jubilee, pp. 283–300. Springer, Berlin (2009)

Download references

Acknowledgments

We are grateful to Yafeng Yin for providing the problem and the original active set algorithm, and also the valuable discussions with him. P. M. Pardalos was partially supported by LATNA Laboratory, NRU HSE, RF government grant, ag. 11.G34.31.0057, National Research University Higher School of Economics, Nizhny Novgorod, Russia.

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611, USA

    Ximing Wang & Panos M. Pardalos

Authors
  1. Ximing Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ximing Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, X., Pardalos, P.M. A modified active set algorithm for transportation discrete network design bi-level problem. J Glob Optim 67, 325–342 (2017). https://doi.org/10.1007/s10898-015-0396-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-015-0396-y

Keywords

Search

Navigation