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-4MaRDI QIDQ1725820zbMATH OpenOpenAlexFDO

Authors Markó Horváth, Tamás Kis

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

branch-and-priceexact methodsinteger programmingvehicle and crew scheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• A branch and bound algorithm for the multiple depot vehicle scheduling problem
• Models and algorithms for integration of vehicle and crew scheduling
• scientific article; zbMATH DE number 1361557
• Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
• A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem

Cites work

• A bundle method for integrated multi-depot vehicle and duty scheduling in public transit
• A comparison of five heuristics for the multiple depot vehicle scheduling problem
• A crew scheduling approach for public transit enhanced with aspects from vehicle scheduling
• A time-space network based exact optimization model for multi-depot bus scheduling
• Driver scheduling for vehicle schedules using a set covering approach: a case study
• scientific article; zbMATH DE number 1361553 (Why is no real title available?)
• scientific article; zbMATH DE number 1361555 (Why is no real title available?)
• Models and algorithms for integration of vehicle and crew scheduling
• Models and Algorithms for Single-Depot Vehicle Scheduling
• On some matching problems arising in vehicle scheduling models
• SCIP: solving constraint integer programs
• Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
• Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems
• The Fixed Job Schedule Problem with Spread-Time Constraints
• The Fixed Job Schedule Problem with Working-Time Constraints

Cited in

(4)

• Single workgroup scheduling problem with variable processing personnel
• A branch and bound algorithm for the multiple depot vehicle scheduling problem
• A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG
• Multicommodity network flow model of a human resource allocation problem considering time periods

Describes a project that uses

Uses Software

• SCIP
• XPRESS
• LEMON

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1725820)