Annals of Operations Research

, Volume 34, Issue 1, pp 163–176

Efficient implementation of heuristics for the continuous network design problem

Authors

  • Patrice Marcotte
    • Département de MathématiquesCollège Militaire Royal de Saint-Jean
  • Gérald Marquis
    • Département de MathématiquesCollège Militaire Royal de Saint-Jean
Article

DOI: 10.1007/BF02098178

Cite this article as:
Marcotte, P. & Marquis, G. Ann Oper Res (1992) 34: 163. doi:10.1007/BF02098178

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.

Copyright information

© J.C. Baltzer AG, Scientific Publishing Company 1992