A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach

Mingyuan Chen · Attahiru Sule Alfa

142 citations0/0 files storedTransportation Science

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

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Complexity and Algorithms in Graphs Vehicle Routing Optimization Methods

Abstract

In this paper, a branch and bound algorithm is presented for solving network design problems (NDP). Route selection for the NDP is based on a stochastic incremental traffic assignment approach. Experiments are performed to compare the behaviors of three assignment methods. Numerical examples are presented to illustrate the algorithm for solving the NDP.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

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

References

1986Urban transportation networks: Equilibrium analysis with mathematical programming methods 1984Network Design and Transportation Planning: Models and Algorithms 1971A probabilistic multipath traffic assignment model which obviates path enumeration 1980Some developments in equilibrium traffic assignment 1975An Algorithm for the Discrete Network Design Problem 1979Continuous equilibrium network design models 1987Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem 1982The Convergence of Equilibrium Algorithms with Predetermined Step Sizes

Cited by

2015A bi-level programming for bus lane network design 2006The multi-criteria road network design problem in an urban area 2005Heuristics for urban road network design: Lane layout and signal settings 2009Multi-period transportation network design under demand uncertainty 1998Algorithms for logit-based stochastic user equilibrium assignment

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

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