Article1975

An Algorithm for the Discrete Network Design Problem

474 citations0/0 files storedTransportation Science

No readable copy stored yet — this record is metadata only.

Transportation Planning and Optimization Traffic control and management Complexity and Algorithms in Graphs

Abstract

This paper addresses the problem of determining which links should be improved in an urban road network so that total congestion in the city is minimized. A nonlinear mixed integer programming model is developed, and strategies for a branch-and-bound algorithm are presented. Particular attention is paid to the computational aspects of large-scale problems, and numerical results are reported.

Citations in this library

Stored only when both papers are in the corpus — 474 citations exist upstream.

References

1975An efficient approach to solving the road network equilibrium traffic assignment problem

Cited by

1979Continuous equilibrium network design models 1987Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem 1982An algorithm for the equilibrium assignment problem with random link times 1991A location-allocation model and algorithm for evacuation planning under hurricane/flood conditions 2004Solution algorithm for the bi-level discrete network design problem 1991Dynamic traffic assignment for urban road networks 2001An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem 2011Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach

Imported from OpenAlex (CC0) — nothing here is generated.