Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems
From MaRDI portal
Publication:439646
DOI10.1016/J.EJOR.2011.12.038zbMath1244.90120OpenAlexW2038384811MaRDI QIDQ439646
Silke Jütte, Ulrich Wilhelm 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
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)
Related Items (7)
Optimizing schedules of rail train circulations by tabu search algorithm ⋮ A graph partitioning strategy for solving large-scale crew scheduling problems ⋮ Integral simplex using double decomposition for set partitioning problems ⋮ An efficient column generation approach for practical railway crew scheduling with attendance rates ⋮ Railway crew scheduling: models, methods and applications ⋮ Public transit planning and scheduling based on AVL data in China ⋮ Optimizing crew rostering with multilicense on high-speed railway lines
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Integrated airline crew scheduling: a bi-dynamic constraint aggregation method using neighborhoods
- Dual variable based fathoming in dynamic programs for column generation
- Airline crew scheduling: state-of-the-art
- An effective and simple heuristic 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
- Crew pairing at Air France
- Stabilized column generation
- Algorithms for railway crew management
- Staff scheduling and rostering: a review of applications, methods and models.
- Handbook of transportation science.
- 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
- Bi-dynamic constraint aggregation and subproblem reduction
- Effective search space control for large and/or complex driver scheduling problems
- A solution approach for dynamic vehicle and crew scheduling
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Reducibility Among Combinatorial Problems
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
- 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
- Deadhead Selection for the Long-Haul Crew Pairing Problem
- A Heuristic Method for the Set Covering Problem
- A Distributed Decision-Making Structure for Dynamic Resource Allocation Using Nonlinear Functional Approximations
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
- Selected Topics in Column Generation
- A Primer in Column Generation
- Shortest Path Problems with Resource Constraints
- Parallel integer optimization for crew scheduling
This page was built for publication: Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems
