A Dantzig-Wolfe decomposition based heuristic scheme for bi-level dynamic network design problem

DOI10.1007/s11067-008-9093-4zbMath1213.90254OpenAlexW2057846613MaRDI QIDQ539101

Dung-Ying Lin, Ampol Karoonsoontawong, Steven Travis Waller

Publication date: 27 May 2011

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-008-9093-4

zbMATH Keywords

Dantzig-Wolfe decompositioncell transmission modeldual variables approximationdynamic network design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Hybrid evolutionary metaheuristics for concurrent multi-objective design of urban road and public transit networks ⋮ A branch and bound algorithm for bi-level discrete network design problem ⋮ Regional air quality conformity in transportation networks with stochastic dependencies: a theoretical copula-based model ⋮ A distributionally robust joint chance constrained optimization model for the dynamic network design problem under demand uncertainty ⋮ A sustainable road network design problem with land use transportation interaction over time ⋮ Complex interactions in large government networks ⋮ Traffic equilibrium and charging facility locations for electric vehicles ⋮ An effective bilevel programming approach for the evasive flow capturing location problem ⋮ Efficient insertion heuristic algorithms for multi-trip inventory routing problem with time windows, shift time limits and variable delivery time ⋮ Robust optimization model for a dynamic network design problem under demand uncertainty ⋮ Tabu search heuristic for joint location-inventory problem with stochastic inventory capacity and practicality constraints ⋮ Dynamic network design problem under demand uncertainty: an adjustable robust optimization approach ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Integrated network capacity expansion and traffic signal optimization problem: Robust bi-level dynamic formulation
• A combinatorial user optimal dynamic traffic assignment algorithm
• Linear programming models for the user and system optimal dynamic network design problem: Formulations, comparisons and extensions
• An efficient dual approach to the urban road network design problem
• Practical bilevel optimization. Algorithms and applications
• Bilevel and multilevel programming: A bibliography review
• Heuristics for urban road network design: lane layout and signal settings
• A study on network design problems for multi-modal networks by probit-based stochastic user equilibrium
• An overview of bilevel optimization
• A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem
• An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
• A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach
• Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem
• `` Direct Search Solution of Numerical and Statistical Problems
• Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
• A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
• A Mathematical Model and Descent Algorithm for Bilevel Traffic Management
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• On kinematic waves II. A theory of traffic flow on long crowded roads