Algorithms for railway crew management
From MaRDI portal
Publication:1365052
DOI10.1007/BF02614314zbMATH Open0887.90056OpenAlexW2058140821MaRDI QIDQ1365052FDOQ1365052
Authors: Alberto Caprara, Matteo Fischetti, Paolo Toth, Daniele Vigo, Pier Luigi Guida 
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
Recommendations
- scientific article; zbMATH DE number 1683914
- Railway crew scheduling: models, methods and applications
- An algebraic algorithm to train dispatch of railway networks
- Algorithms and models for railway optimization.
- scientific article; zbMATH DE number 1683912
- An integrated optimization model for train crew management
- Modeling and algorithms of the crew rostering problem with given cycle on high-speed railway lines
- Algorithm and Software Development to Allocate Locomotives for Transportation of Freight Trains
- Railway scheduling by network optimization
Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- A genetic algorithm for the set covering problem
- Branch-and-price: Column generation for solving huge integer programs
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- A multi-level bottleneck assignment approach to the bus drivers' rostering problem
- On Manpower Scheduling Algorithms
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- Enhancing an algorithm for set covering problems
- A Lagrangian-based heuristic for large-scale set covering problems
- An algorithm for set covering problem
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- Title not available (Why is that?)
- Note: A local-search heuristic for large set-covering problems
- A Heuristic Method for the Set Covering Problem
- Modeling and solving the crew rostering problem
- An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
- Network models for vehicle and crew scheduling
- A heuristic procedure for the crew rostering problem
- A surrogate heuristic for set covering problems
- Title not available (Why is that?)
Cited In (46)
- Modeling and algorithms of the crew rostering problem with given cycle on high-speed railway lines
- Optimizing crew rostering with multilicense on high-speed railway lines
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Railway crew scheduling: models, methods and applications
- Rostering in a rail passenger carrier
- Title not available (Why is that?)
- A model and computational tool for crew scheduling in train transportation of mine materials by using a local search strategy
- Short-term manpower planning for MRT carriage maintenance under mixed deterministic and stochastic demands
- Modeling and solving the crew rostering problem
- Title not available (Why is that?)
- Set covering with almost consecutive ones property
- The crew timetabling problem: an extension of the crew scheduling problem
- Combinational aspects of move up crews
- Workforce planning in a lotsizing mail processing problem
- Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems
- Discrete optimization in public rail transport
- A constraint programming-based approach to the crew scheduling problem of the Taipei mass rapid transit system
- An efficient column generation approach for practical railway crew scheduling with attendance rates
- A self-adaptive biogeography-based algorithm to solve the set covering problem
- A flexible, fast, and optimal modeling approach applied to crew rostering at London Underground
- An efficient local search heuristic with row weighting for the unicost set covering problem
- Crew scheduling of light rail transit in Hong Kong: From modeling to implementation.
- Title not available (Why is that?)
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- An effective heuristic for large-scale capacitated facility location problems
- Solving a multi-objective interval crew-scheduling problem via genetic algorithms
- Algorithm and Software Development to Allocate Locomotives for Transportation of Freight Trains
- Heuristics for the variable sized bin-packing problem
- An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport
- A column generation approach for the rail crew re-scheduling problem
- An electromagnetism metaheuristic for the unicost set covering problem
- An integrated optimization model for train crew management
- Vehicle and crew scheduling for urban bus lines
- Staff rostering for the station personnel of a railway company
- The multiple team formation problem using sociometry
- Human resources management at a marine container terminal
- A three-phase heuristic for the fairness-oriented crew rostering problem
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism
- Title not available (Why is that?)
- A genetic algorithm for public transport driver scheduling
- Effective search space control for large and/or complex driver scheduling problems
- A set covering approach for multi-depot train driver scheduling
- On solving multi-type railway line planning problems
- Optimizing railway crew schedules with fairness preferences
- Title not available (Why is that?)
- Two-level decomposition algorithm for crew rostering problems with fair working condition
This page was built for publication: Algorithms for railway crew management
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365052)
