Models and algorithms for road network design: a review and some new developments

Yang, Hai; Bell, Michael G.H.

doi:10.1080/01441649808717016

Cited by 611 publications

(332 citation statements)

References 43 publications

Supporting

Mentioning

327

Contrasting

Unclassified

Order By: Relevance

“…All input information by Suwansirikul et al [6] for the test network is presented in Table 2. The travel demand of (1,6) is assumed to be d, which is half of that for (6,1).…”

Section: The 16-link Network Examplementioning

confidence: 99%

“…The continuous NDP (CNDP) has become one of the most computationally intensive problems in the transportation field [1]. The CNDP is to determine how to expand the link capacity to minimize the total system travel cost while the users follow the Wardrop's first principle of traffic equilibrium to choose their routes, i.e.…”

Section: Introductionmentioning

confidence: 99%

“…Allsop [3] firstly proposed the algorithm for addressing CNDP, and subsequently CNDP has been continuously studied by many researchers during the last five decades. Lots of related publications have grown over time including reviews by Yang and Bell [1] and Farahani et al [4]. Various algorithms have been proposed to solve CNDP (see Table 1 for details).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An MPCC Formulation and Its Smooth Solution Algorithm for Continuous Network Design Problem

Wang

2017

PROMET

View full text Add to dashboard Cite

Continuous network design problem (CNDP) is searching for a transportation network configuration to minimize the sum of the total system travel time and the investment cost of link capacity expansions by considering that the travellers follow a traditional Wardrop user equilibrium (UE) to choose their routes. In this paper, the CNDP model can be formulated as mathematical programs with complementarity constraints (MPCC) by describing UE as a non-linear complementarity problem (NCP

show abstract

“…All input information by Suwansirikul et al [6] for the test network is presented in Table 2. The travel demand of (1,6) is assumed to be d, which is half of that for (6,1).…”

Section: The 16-link Network Examplementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An MPCC Formulation and Its Smooth Solution Algorithm for Continuous Network Design Problem

Wang

2017

PROMET

View full text Add to dashboard Cite

show abstract

“…Webster and Cobbe (1966), Allsop (1972), and Wong (1996) investigated this concept for network intersections. However, using this concept as the objective function of the UNDPs was only suggested in the study by Yang and Bell (1998a). Yang and Bell (1998b) introduced a paradox related to network design problems and demonstrated that using the concept of reserve capacity into a network design problem is the best way to avoid this paradox.…”

Section: Accepted M M a N U mentioning

confidence: 99%

“…Nowadays, studying urban transportation network systems is crucial because the speed of the increase in urban transportation demand is higher than that in expanding the transportation system, so this system could not accommodate the increase in demand, while resources available for expanding the system capacity remain limited (Yang and Bell, 1998a). Until now, most UNDPs have been formulated as bi-level problems which in the upper level problem, several investment decisions are made by system owners or planners to optimize the desired objective function.…”

Section: Introductionmentioning

confidence: 99%

Mixed network design using hybrid scatter search

Khooban¹,

Farahani

Miandoabchi³

et al. 2015

European Journal of Operational Research

View full text Add to dashboard Cite

This research proposes a bi-level model for the mixed network design problem (MNDP). The upper level problem involves redesigning the current road links' directions, expanding their capacity, and determining signal settings at intersections to optimize the reserve capacity of the whole system.The lower level problem is the user equilibrium traffic assignment problem. By proving that the optimal arc flow solution of the bi-level problem must exist in the boundary of capacity constraints, an exact line search method called golden section search is embedded in a scatter search method for solving this complicated MNDP. The algorithm is then applied to some real cases and finally, some conclusions are drawn on the model's efficiency.

show abstract

Traffic Network Analysis and Design

Boyles

Waller

2011

Wiley Encyclopedia of Operations Research and Management Science

View full text Add to dashboard Cite

This article provides an overview of basic traffic network analysis methods, focusing on the central traffic assignment problem. Formulations of the user‐optimal and system‐optimal assignment problems are given and link‐based, path‐based, and origin‐based solution methods are presented. Congestion pricing and network design are then presented as two applications of these models. Finally, a brief treatment is given to extensions of the basic model: stochastic user equilibrium, elastic demand, uncertain costs, and dynamic traffic assignment. A discussion of seminal papers in the field is provided for historical context and further reference.

show abstract

Models and algorithms for road network design: a review and some new developments

Cited by 611 publications

References 43 publications

An MPCC Formulation and Its Smooth Solution Algorithm for Continuous Network Design Problem

An MPCC Formulation and Its Smooth Solution Algorithm for Continuous Network Design Problem

Mixed network design using hybrid scatter search

Traffic Network Analysis and Design

Contact Info

Product

Resources

About