A structural Lagrangean relaxation for two-duty period bus driver scheduling problems

DOI10.1016/0377-2217(89)90194-XzbMath0673.90061OpenAlexW1967819272MaRDI QIDQ1121170

S. H. Smith

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90194-x

zbMATH Keywords

set coveringpenaltiesgreedy heuristicsstructural lagrangean relaxationtwo-duty period bus driver scheduling

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

A dual strategy for solving the linear programming relaxation of a driver scheduling system

Cites Work

• Algorithms for large scale set covering problems
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
• Validation of subgradient optimization
• Unnamed Item
• Unnamed Item