A dual strategy for solving the linear programming relaxation of a driver scheduling system |
| |
| Authors: | W P Willers L G Proll A Wren |
| |
| Institution: | (1) School of Computing and Mathematics, University of Teesside, TS1 3BA Middlesbrough, Cleveland, UK;(2) Division of Operational Research and Information Systems, School of Computer Studies, University of Leeds, LS2 9JT Leeds, UK |
| |
| 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. |
| |
| Keywords: | Driver scheduling multiple objectives linear programming dual simplex |
| 本文献已被 SpringerLink 等数据库收录！ |
|
