Integrated network capacity expansion and traffic signal optimization problem: Robust bi-level dynamic formulation
From MaRDI portal
Publication:613549
DOI10.1007/s11067-008-9071-xzbMath1202.90030OpenAlexW2042121490MaRDI QIDQ613549
Ampol Karoonsoontawong, Steven Travis Waller
Publication date: 21 December 2010
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-008-9071-x
robust optimizationbilevel programmingdynamic traffic assignmentnetwork design problemsignal optimization
Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)
Related Items
Hybrid evolutionary metaheuristics for concurrent multi-objective design of urban road and public transit networks ⋮ Regional air quality conformity in transportation networks with stochastic dependencies: a theoretical copula-based model ⋮ An excess-demand dynamic traffic assignment approach for inferring origin-destination trip matrices ⋮ The cost of environmental constraints in traffic networks: assessing the loss of optimality ⋮ A distributionally robust joint chance constrained optimization model for the dynamic network design problem under demand uncertainty ⋮ Vortex-based zero-conflict design of urban road networks ⋮ Optimization of robust area traffic control with equilibrium flow under demand uncertainty ⋮ 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 ⋮ Dynamic network design problem under demand uncertainty: an adjustable robust optimization approach ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Dynamic traffic assignment under uncertainty: a distributional robust chance-constrained approach
Uses Software
Cites Work
- Unnamed Item
- A combinatorial user optimal dynamic traffic assignment algorithm
- Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs
- Practical bilevel optimization. Algorithms and applications
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem
- Penalty for zero–one integer equivalent problem
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- Introduction to Stochastic Programming
- Robust Optimization of Large-Scale Systems