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

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

0.00 Avg rating0 Votes
Article ID: iaor1996161
Country: Switzerland
Volume: 58
Issue: 1
Start Page Number: 519
End Page Number: 531
Publication Date: Jul 1995
Journal: Annals of Operations Research
Authors: , ,
Keywords: transportation: road, Transportation: Road, programming: linear
Abstract:

A Mathematical Programming model of a driver scheduling system is described. This consists of set covering and partitioning constraints, possibly user-supplied side constraints, and two pre-emptively ordered objectives. The previous solution strategy addressed the two objectives using separate Primal Simplex optimisations; a new strategy uses a single weighted objective function and a Dual Simplex algorithm initiated by a specially developed heuristic. Computational results are reported.

Reviews

Required fields are marked *. Your email address will not be published.