An efficient dual approach to the urban road network design problem

DOI10.1016/0898-1221(81)90134-6zbMath0398.90042OpenAlexW1992304457MaRDI QIDQ1254188

Larry J. Le Blanc, Mustafa Abdulaal

Publication date: 1979

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(81)90134-6

zbMATH Keywords

Computational ResultsEfficient Dual ApproachLarge Nonconvex MinimizationOne-Dimensional Search TechniqueSubgradientsTraffic AssignmentUrban Road Network Design

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (22)

A relaxation approach for estimating origin-destination trip tables ⋮ Network design problem with congestion effects: A case of bilevel programming ⋮ Bilevel programming in traffic planning: Models, methods and challenge ⋮ Complexity and Approximation of the Continuous Network Design Problem ⋮ A DC Programming Approach to the Continuous Equilibrium Network Design Problem ⋮ Multi-criterion system optimization model for urban multimodal traffic network ⋮ Optimization model and algorithm for mixed traffic of urban road network with flow interference ⋮ Optimizing reserve capacity of urban road networks in a discrete network design problem ⋮ Model for microcirculation transportation network design ⋮ The Pareto-optimal solution set of the equilibrium network design problem with multiple commensurate objectives ⋮ A globally convergent algorithm for transportation continuous network design problem ⋮ Hierarchical optimization: An introduction ⋮ Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review ⋮ Inverse Nonlinear Multicommodity Flow Optimization by Column Generation ⋮ A new genetic approach for transport network design and optimization ⋮ A Dantzig-Wolfe decomposition based heuristic scheme for bi-level dynamic network design problem ⋮ Robust optimization model for a dynamic network design problem under demand uncertainty ⋮ Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints ⋮ Linear programming models for the user and system optimal dynamic network design problem: Formulations, comparisons and extensions ⋮ An optimum link improvement model with a computer algorithm ⋮ A GRASP and path relinking heuristic for rural road network development ⋮ Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications

Cites Work

• Global Solutions for a Nonconvex Nonconcave Rail Network Model
• Convergence Conditions for Nonlinear Programming Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient dual approach to the urban road network design problem