Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems
DOI10.1016/J.EJOR.2011.12.038zbMATH Open1244.90120OpenAlexW2038384811MaRDI QIDQ439646FDOQ439646
Authors: Silke Jütte, Ulrich W. Thonemann 
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.12.038
Recommendations
- A graph partitioning strategy for solving large-scale crew scheduling problems
- A Column-and-Row Generation Algorithm for a Crew Planning Problem in Railways
- Two-level decomposition algorithm for crew rostering problems with fair working condition
- scientific article; zbMATH DE number 1683919
- scientific article; zbMATH DE number 1361550
Large-scale problems in mathematical programming (90C06) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Theory of organizations, manpower planning in operations research (90B70)
Cites Work
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- Title not available (Why is that?)
- Crew pairing at Air France
- Selected Topics in Column Generation
- Shortest Path Problems with Resource Constraints
- Stabilized column generation
- Handbook of transportation science.
- Branch-and-price: Column generation for solving huge integer programs
- Handbooks in operations Research \& management science: Transportation
- A Primer in Column Generation
- An effective and simple heuristic for the set covering problem
- Staff scheduling and rostering: a review of applications, methods and models.
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- A Distributed Decision-Making Structure for Dynamic Resource Allocation Using Nonlinear Functional Approximations
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
- Algorithms for railway crew management
- A Heuristic Method for the Set Covering Problem
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- On the choice of explicit stabilizing terms in column generation
- Integrated airline crew scheduling: a bi-dynamic constraint aggregation method using neighborhoods
- Airline crew scheduling: state-of-the-art
- Bi-dynamic constraint aggregation and subproblem reduction
- A decision support system for crew planning in passenger transportation using a flexible branch-and-price algorithm
- An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
- Effective search space control for large and/or complex driver scheduling problems
- A solution approach for dynamic vehicle and crew scheduling
- Reducibility among combinatorial problems
- On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
- Title not available (Why is that?)
- Deadhead Selection for the Long-Haul Crew Pairing Problem
- Title not available (Why is that?)
- Parallel integer optimization for crew scheduling
- Dual variable based fathoming in dynamic programs for column generation
Cited In (8)
- Optimizing crew rostering with multilicense on high-speed railway lines
- Railway crew scheduling: models, methods and applications
- Integral simplex using double decomposition for set partitioning problems
- An efficient column generation approach for practical railway crew scheduling with attendance rates
- A graph partitioning strategy for solving large-scale crew scheduling problems
- Optimizing schedules of rail train circulations by tabu search algorithm
- Title not available (Why is that?)
- Public transit planning and scheduling based on AVL data in China
This page was built for publication: Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439646)
