Combinatorial and robust optimisation models and algorithms for railway applications

DOI10.1007/s10288-010-0138-4zbMath1217.90031OpenAlexW1978657360MaRDI QIDQ548671

Laura Galli

Publication date: 30 June 2011

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-010-0138-4

zbMATH Keywords

mixed integer programmingrobust optimisationrolling stock planningtrain platforming

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (3)

Min-max and min-max (relative) regret approaches to representatives selection problem ⋮ Optimization Methods: An Applications-Oriented Primer ⋮ Recent advances in robust optimization: an overview

Cites Work

• A rolling stock circulation model for combining and splitting of passenger trains
• Robust train routing and online re-scheduling
• Recoverable Robustness for Railway Rolling Stock Planning
• 04. Solution of the Train Platforming Problem

This page was built for publication: Combinatorial and robust optimisation models and algorithms for railway applications