The locomotive assignment problem: a survey on optimization models
From MaRDI portal
Publication:4979995
DOI10.1111/itor.12062zbMath1291.90118OpenAlexW1602844090MaRDI QIDQ4979995
No author found.
Publication date: 20 June 2014
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12062
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items (5)
A time-space formulation for the locomotive routing problem at the Canadian National Railways ⋮ A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG ⋮ The decomposition problem for the set of paths in a directed graph and its application ⋮ Locomotive assignment graph model for freight traffic on linear Section of railway. The problem of finding a maximal independent schedule coverage ⋮ Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor
Cites Work
- Unnamed Item
- Capturing incomplete information in resource allocation problems through numerical patterns
- Locomotive assignment with heterogeneous consists at CN North America
- Routing of railway carriages
- A Model for the Optimal Programming of Railway Freight Train Movements
- Railway Timetabling Using Lagrangian Relaxation
- A Survey of Optimization Models for Train Routing and Scheduling
- A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
- Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems
- Approximate dynamic programming for rail operations
- A Branch-First, Cut-Second Approach for Locomotive Assignment
- Exact Solution of Locomotive Scheduling Problems
- Applying Stochastic Algorithms to a Locomotive Scheduling Problem
- The Engine Scheduling Problem In A Railway Network
- An Adaptive Dynamic Programming Algorithm for the Heterogeneous Resource Allocation Problem
- Production of locomotive rosters for a multi-class multi-locomotive problem
- A Note on the Use of Lagrangean Relaxation in Railway Scheduling
- Approximate Dynamic Programming
- A representational paradigm for dynamic resource transformation problems
This page was built for publication: The locomotive assignment problem: a survey on optimization models
