Algorithms for railway crew management
From MaRDI portal
Publication:1365052
DOI10.1007/BF02614314zbMath0887.90056OpenAlexW2058140821MaRDI QIDQ1365052
Pier Luigi Guida, Daniele Vigo, Matteo Fischetti, Paolo Toth, Alberto Caprara
Publication date: 28 August 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02614314
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items
Human resources management at a marine container terminal, Rostering in a rail passenger carrier, An efficient local search heuristic with row weighting for the unicost set covering problem, Set covering with almost consecutive ones property, A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs, The multiple team formation problem using sociometry, Discrete optimization in public rail transport, Cutting plane versus compact formulations for uncertain (integer) linear programs, Solving a multi-objective interval crew-scheduling problem via genetic algorithms, Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism, A three-phase heuristic for the fairness-oriented crew rostering problem, Short-term manpower planning for MRT carriage maintenance under mixed deterministic and stochastic demands, Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems, An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport, Effective search space control for large and/or complex driver scheduling problems, A constraint programming-based approach to the crew scheduling problem of the Taipei mass rapid transit system, An electromagnetism metaheuristic for the unicost set covering problem, A genetic algorithm for public transport driver scheduling, Workforce planning in a lotsizing mail processing problem, An efficient column generation approach for practical railway crew scheduling with attendance rates, Railway crew scheduling: models, methods and applications, Heuristics for the variable sized bin-packing problem, A self-adaptive biogeography-based algorithm to solve the set covering problem, An effective heuristic for large-scale capacitated facility location problems, On solving multi-type railway line planning problems, Vehicle and crew scheduling for urban bus lines, A set covering approach for multi-depot train driver scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Network models for vehicle and crew scheduling
- A multi-level bottleneck assignment approach to the bus drivers' rostering problem
- A heuristic procedure for the crew rostering problem
- Enhancing an algorithm for set covering problems
- A genetic algorithm for the set covering problem
- A Lagrangian-based heuristic for large-scale set covering problems
- A surrogate heuristic for set covering problems
- An algorithm for set covering problem
- An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Modeling and Solving the Crew Rostering Problem
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- On Manpower Scheduling Algorithms
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- Note: A local-search heuristic for large set-covering problems
- A Heuristic Method for the Set Covering Problem
