A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG
DOI10.1007/s00291-023-00729-9OpenAlexW4384300519MaRDI QIDQ6201534
No author found.
Publication date: 21 February 2024
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-023-00729-9
matheuristicslexicographic objectiveslocomotive and driver schedulingproblem decomposition for sequential optimization
Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A distribution network design problem in the automotive industry: MIP formulation and heuristics
- A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations
- A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution
- Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints
- The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
- MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry
- Reducing the number of variables in integer and linear programming problems
- A matheuristic for the asymmetric capacitated vehicle routing problem
- Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price
- An exact algorithm for the simplified multiple depot crew scheduling problem
- Solving the wire-harness design problem at a European car manufacturer
- Inbound and outbound flow integration for cross-docking operations
- A graph partitioning strategy for solving large-scale crew scheduling problems
- A sequencing approach for creating new train timetables
- A lexicographic minimax approach to the vehicle routing problem with route balancing
- Railway crew scheduling: models, methods and applications
- Integrating workload smoothing and inventory reduction in three intermodal logistics platforms of a European car manufacturer
- A heuristic for cumulative vehicle routing using column generation
- Learning variable neighborhood search for a scheduling problem with time windows and rejections
- Models and algorithms for integration of vehicle and crew scheduling
- A flexible system for scheduling drivers
- A survey on matheuristics for routing problems
- Solution approaches for integrated vehicle and crew scheduling with electric buses
- A MIP-based heuristic for a single trade routing and scheduling problem in roll-on roll-off shipping
- Scheduled Service Network Design for Freight Rail Transportation
- A survey on vertex coloring problems
- A Priori and A Posteriori Aggregation Procedures to Reduce Model Size in MIP Mine Planning Models
- On some matching problems arising in vehicle scheduling models
- Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems
- Teaching Integer Programming Formulations Using the Traveling Salesman Problem
- TRACS II: a hybrid IP/heuristic driver scheduling system for public transport
- An overview of heuristic solution methods
- The Column Generation Principle And The Airline Crew Scheduling Problem
- The locomotive assignment problem: a survey on optimization models
This page was built for publication: A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG
