Network models with unsplittable node flows with application to unit train scheduling

DOI10.1287/OPRE.2019.1864MaRDI QIDQ5129179zbMATH OpenOpenAlexWikidataFDO

Authors Danial Davarnia, Jean-Philippe Richard, Ece Içyüz-Ay, Bijan Taslimi

Publication date 26 October 2020

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/cfd50becf70fa9c6812c83f4dd1235468775d384

zbMATH Keywords

cutting planesmixed integer programsnetwork optimizationunit trains

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Mixed integer programming (90C11)

Recommendations

• Redundant coupling/decoupling in train unit scheduling optimization
• A rolling stock circulation model for combining and splitting of passenger trains
• Cost optimal periodic train scheduling
• Routing Trains Through Railway Stations: Model Formulation and Algorithms
• scientific article; zbMATH DE number 3847190

Cites work

• A branch-and-cut algorithm for capacitated network design problems
• A branch-first, cut-second approach for locomotive assignment
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• A survey of optimization models for train routing and scheduling
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Disjunctive Programming
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• scientific article; zbMATH DE number 2119660 (Why is no real title available?)
• Lectures on Polytopes
• Lifted flow cover inequalities for mixed 0-1 integer programs
• Minimum cost capacity installation for multicommodity network flows
• Mixed integer linear programming formulation techniques
• Network Design Using Cut Inequalities
• On capacitated network design cut-set polyhedra
• On cut-based inequalities for capacitated network design polyhedra
• On the choice of explicit stabilizing terms in column generation
• On the single-source unsplittable flow problem
• Optimising a coal rail network under capacity constraints
• The \(k\)-splittable flow problem
• Valid inequalities for mixed 0-1 programs
• Valid Linear Inequalities for Fixed Charge Problems

Cited in

(1)

• A novel mixed integer programming model for freight train travel time estimation

This page was built for publication: Network models with unsplittable node flows with application to unit train scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5129179)