A time-space formulation for the locomotive routing problem at the Canadian National Railways
From MaRDI portal
Publication:2669796
Recommendations
- Simultaneous Assignment of Locomotives and Cars to Passenger Trains
- Integrating traffic routing optimization and train formation plan using simulated annealing algorithm
- Locomotive assignment with heterogeneous consists at CN North America
- A multiobjective optimization for train routing at the high-speed railway station based on tabu search algorithm
- An efficient MIP model for locomotive scheduling with time windows
Cites work
- A Benders decomposition approach for the locomotive and car assignment problem
- A branch-first, cut-second approach for locomotive assignment
- Decomposition Principle for Linear Programs
- Locomotive assignment with heterogeneous consists at CN North America
- Network flows. Theory, algorithms, and applications.
- Partitioning procedures for solving mixed-variables programming problems
- Scheduled service network design for freight rail transportation
- Simultaneous Assignment of Locomotives and Cars to Passenger Trains
- The locomotive assignment problem: a survey on optimization models
Cited in
(5)- Simultaneous Assignment of Locomotives and Cars to Passenger Trains
- Locomotive assignment and freight train scheduling using genetic algorithms
- An improved decomposition-based heuristic for truck platooning
- Operations routing and scheduling problem: concept, graphing and notation systems
- Integrating traffic routing optimization and train formation plan using simulated annealing algorithm
This page was built for publication: A time-space formulation for the locomotive routing problem at the Canadian National Railways
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669796)
