Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price

DOI10.1007/s10100-017-0489-4OpenAlexW2754129956MaRDI QIDQ1725820

Tamás Kis, Markó Horváth

Publication date: 15 February 2019

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: http://eprints.sztaki.hu/9605/

zbMATH Keywords

integer programmingbranch-and-priceexact methodsvehicle and crew scheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (2)

Single workgroup scheduling problem with variable processing personnel ⋮ A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG

Uses Software

• SCIP
• XPRESS
• LEMON

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• SCIP: solving constraint integer programs
• A comparison of five heuristics for the multiple depot vehicle scheduling problem
• A time-space network based exact optimization model for multi-depot bus scheduling
• Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
• Models and algorithms for integration of vehicle and crew scheduling
• The Fixed Job Schedule Problem with Spread-Time Constraints
• On some matching problems arising in vehicle scheduling models
• The Fixed Job Schedule Problem with Working-Time Constraints
• Models and Algorithms for Single-Depot Vehicle Scheduling
• Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems
• Driver scheduling for vehicle schedules using a set covering approach: a case study

This page was built for publication: Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price