A set covering approach for multi-depot train driver scheduling
From MaRDI portal
Publication:2343986
DOI10.1007/s10878-013-9612-1zbMath1322.90081MaRDI QIDQ2343986
Mohadeseh Rahbar, Masoud Yaghini, Mohammad Karimi
Publication date: 11 May 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-013-9612-1
tabu search; set covering problem; matheuristic; design of experiment; Iranian railways; LP-based neighborhoods; train drive scheduling
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Optimizing word set coverage for multi-event summarization, An efficient column generation approach for practical railway crew scheduling with attendance rates, Railway crew scheduling: models, methods and applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using a facility location algorithm to solve large set covering problems
- An effective and simple heuristic for the set covering problem
- A column generation approach for the rail crew re-scheduling problem
- Surrogate constraint normalization for the set covering problem
- Computational experience with general cutting planes for the set covering problem
- Genetic algorithms and traveling salesman problems
- A genetic algorithm for the set covering problem
- Crew pairing at Air France
- Solving large scale crew scheduling problems
- A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
- Algorithms for railway crew management
- Staff scheduling and rostering: a review of applications, methods and models.
- Local branching
- Exploring relaxation induced neighborhoods to improve MIP solutions
- An annotated bibliography of personnel scheduling and rostering
- Application of a hybrid genetic algorithm to airline crew scheduling
- Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
- Effective search space control for large and/or complex driver scheduling problems
- A 3-flip neighborhood local search for the set covering problem
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Modeling and Solving the Crew Rostering Problem
- On multiroute maximum flows in networks
- An Approximate Model and Solution Approach for the Long-Haul Crew Pairing Problem
- An efficient heuristic for large set covering problems
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- A note on some computationally difficult set covering problems
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- A Greedy Heuristic for the Set-Covering Problem
- Tabu Search—Part I
- Tabu Search—Part II
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- A Heuristic Method for the Set Covering Problem
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Algorithms for the set covering problem
- Airline cockpit crew scheduling
