Effective search space control for large and/or complex driver scheduling problems

DOI10.1007/s10479-007-0203-3zbMath1145.90388OpenAlexW2068701118MaRDI QIDQ2468754

Raymond S. K. Kwan, A. S. K. Kwan

Publication date: 25 January 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-007-0203-3

zbMATH Keywords

heuristicsset coveringpublic transportdriver scheduling

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems ⋮ A column generation based hyper-heuristic to the bus driver scheduling problem ⋮ Railway crew scheduling: models, methods and applications ⋮ A set covering approach for multi-depot train driver scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for railway crew management
• Computer-aided transit scheduling. Proceedings of the fourth international workshop on computer-aided scheduling of public transport, held in Hamburg, FRG, 28th -- 31st July 1987
• A fuzzy genetic algorithm for driver scheduling
• Computer-aided transit scheduling. Proceedings of the 6th international workshop on computer-aided scheduling of public transport, Lisbon, Portugal, July 6-9, 1993
• A flexible system for scheduling drivers
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• A Column Generation Approach to the Urban Transit Crew Scheduling Problem
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• TRACS II: a hybrid IP/heuristic driver scheduling system for public transport

This page was built for publication: Effective search space control for large and/or complex driver scheduling problems