Skip to main content
SpringerLink
Log in

Efficient implementation of heuristics for the continuous network design problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this paper, we present an efficient implementation of heuristic procedures for solving the continuous network design problem where network users behave according to Wardrop's first principle of traffic equilibrium. Numerical results involving a “standard” benchmark problem are given. Also, it is shown that the cost mapping arising in the Iterative-Optimization-Assignment algorithm is integrable if and only if the volume-delay function is of either the BPR or some logarithmic form.

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

Similar content being viewed by others

References

  1. M. Abdulaal and L.J. LeBanc, Continuous equilibrium design models, Transport. Res. 13B(1979)19–32.

    Google Scholar 

  2. S.C. Dafermos, Traffic equilibrium and variational inequalities, Transport. Sci. 14(1980)42–54.

    Google Scholar 

  3. T.L. Friesz, C. Suwansirikul and R.L. Tobin, Equilibrium Decomposition Optimization: A heuristic for the continuous equilibrium network design problem, Transport. Sci. 21(1987)254–263.

    Google Scholar 

  4. M. Florian, J. Guélat and H. Spiess, An efficient implementation of the PARTAN variation of the linear approximation method for the network equilibrium problem, Networks 17(1987)319–340.

    Google Scholar 

  5. M. Fukushima, A modified Frank-Wolfe algorithm for solving the traffic assignment problem, Transport. Res. 18B(1984)169–177.

    Google Scholar 

  6. D.W. Hearn. The gap function of a convex program, Oper. Res. Lett. 1(1981)67–71.

    Google Scholar 

  7. S. Lawphongpanich and D.W. Hearn, Simplicial decomposition of the asymmetric traffic assignment problem, Transport. Res. 18B(1984)123–133.

    Google Scholar 

  8. P. Marcotte, Network optimization with continuous control parameters, Transport. Sci. 17(1983)181–197.

    Google Scholar 

  9. P. Marcotte, Network design problem with congestion effects: A case of bilevel programming. Math. Progr. 34(1986)142–162.

    Google Scholar 

  10. P. Marcotte and J. Guélat, A modified Newton method for solving the asummetric traffic equilibrium problem, Transport. Sci. 22(1988)112–124.

    Google Scholar 

  11. L. LeBlanc, E. Morlok and W. Pierskalla, An efficient approach to solving road network equilibrium traffic assignment problems, Transport. Res. 9B(1975)309–318.

    Google Scholar 

  12. M.J. Smith, The existence, uniqueness and stability of traffic equilbria, Transport. Res. 13B(1979)295–304.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département de Mathématiques, Collège Militaire Royal de Saint-Jean, J0J 1R0, Richelain, Québec, Canada

    Patrice Marcotte & Gérald Marquis

Authors
  1. Patrice Marcotte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gérald Marquis
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by the National Sciences and Engineering Research Council of Canada (Grant A5789) and the Academic Research Program of the Department of National Defense (Grant FUHBP).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Marcotte, P., Marquis, G. Efficient implementation of heuristics for the continuous network design problem. Ann Oper Res 34, 163–176 (1992). https://doi.org/10.1007/BF02098178

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02098178

Keywords

Search

Navigation