On strategic multistage operational two-stage stochastic 0--1 optimization for the rapid transit network design problem

DOI10.1016/j.ejor.2018.05.041zbMath1403.90088OpenAlexW2804379700WikidataQ129780010 ScholiaQ129780010MaRDI QIDQ724143

Luis Cadarso, Laureano Fernando Escudero Bueno, ángel G. Marín

Publication date: 25 July 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.05.041

zbMATH Keywords

transportationmatheuristic algorithmsmultistage multi-horizon scenario treespure 0--1 modelsrapid transit network design planning

Mathematics Subject Classification ID

Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Boolean programming (90C09)

Related Items (3)

On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach ⋮ On capacity expansion planning under strategic and operational uncertainties based on stochastic dominance risk averse management ⋮ On dealing with strategic and tactical decision levels in forestry planning under uncertainty

Cites Work

• Unnamed Item
• Medium range optimization of copper extraction planning under uncertainty in future copper prices
• Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty
• Fix-and-relax approaches for controlled tabular adjustment
• Multi-horizon stochastic programming
• On a fix-and-relax framework for a class of project scheduling problems
• Dynamic generation of scenario trees
• An extension to rapid transit network design problem
• Urban rapid transit network capacity expansion
• On practical resource allocation for production planning and scheduling with period overlapping setups
• Integrated approach to network design and frequency setting problem in railway rapid transit systems
• Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization
• A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems
• Scenario tree reduction for multistage stochastic programs
• Quasi-Monte Carlo methods for linear two-stage stochastic programming problems
• Introduction to Stochastic Programming
• The Price of Robustness
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• Recoverable Robustness in Shunting and Timetabling
• Optimization with Stochastic Dominance Constraints

This page was built for publication: On strategic multistage operational two-stage stochastic 0--1 optimization for the rapid transit network design problem