Skip to main content
SpringerLink
Log in

Elastic Constraint Branching, the Wedelin/Carmen Lagrangian Heuristic and Integer Programming for Personnel Scheduling

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The Wedelin algorithm is a Lagrangian based heuristic that is being successfully used by Carmen Systems to solve large crew pairing problems within the airline industry. We extend the Wedelin approach by developing an implementation for personnel scheduling problems (also termed staff rostering problems) that exploits the special structure of these problems. We also introduce elastic constraint branching with the twin aims of improving the performance of our new approach and making it more column generation friendly. Numerical results show that our approach can outperform the commercial solver CPLEX on difficult commercial rostering problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Andersson, E. Housos, N. Kohl and D. Wedelin, Crew Pairing Optimization (Kluwer Scientific, 1997) chapter 1, pp. 1-31. See http://www.cs.chalmers.se/~dag/.

  2. A. Atamturk, G.L. Nemhauser and M.W.P. Savelsbergh, A combined Lagrangian, linear programming and implication heuristic for large-scale set partitioning problems, Journal of Heuristics 1 (1996) 247–259.

    Google Scholar 

  3. N. Balakrishnan and R.T. Wong, A network model for the rotating workforce scheduling problem, Networks 20 (1990) 25–42.

    Google Scholar 

  4. C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh and P.H. Vance, Branch-and-price: Column generation for solving huge integer programs, Operations Research 46(3) (1998) 316–329.

    Google Scholar 

  5. J.E. Beasley, A Lagrangian heuristic for set covering problems, Naval Research Logistics 37 (1990) 151–164.

    Google Scholar 

  6. N. Beaumont, Scheduling staff using mixed integer programming, European Journal of Operational Research 98(3) (1997) 473–484.

    Google Scholar 

  7. Y. Van Den Berg and D.M. Panton, Personnel shift assignment: Existence conditions and network models, Networks 24 (1994) 385–394.

    Google Scholar 

  8. L. Bianco, M. Bielli, A. Mingozzi, S. Ricciardelli and M. Spadoni, A heuristic procedure for the crew rostering problem, European Journal of Operational Research 58 (1992) 272–283.

    Google Scholar 

  9. R.E. Bixby, S. Ceria, C.M. McZeal and M.W.P. Savelsbergh, The MIPLIB Library (1996). Available at http://www.caam.rice.edu/~bixby/miplib/miplib.html.

  10. A. Caprara, M. Fischetti, P. Toth and D. Vigo, A heuristic algorithm for a crew rostering problem arising in railway applictions, Ricerca Operativa 76 (1995) 15–36.

    Google Scholar 

  11. A. Caprara, M. Fischetti, P. Toth and D. Vigo, Modeling and solving the crew rostering problem, Operations Research 46 (1998) 820–830.

    Google Scholar 

  12. A. Caprara, M. Fischetti and P. Toth, A heuristic method for the set covering problem, Operations Research 47(5) (1999) 730–743.

    Google Scholar 

  13. A. Caprara, M. Fischetti and P. Toth, Algorithms for the set covering problem, Technical report OR-98-3, Università degli Studi di Bologna (1998). See http://www.or.deis.unibo.it/staff_pages/ caprara/online.html.

  14. B. Davey, Cost modification heuristics for set partitioning problems and air crew scheduling, Ph.D. thesis, Department of Mathematics, University of Melbourne Australia (1995).

  15. P.R. Day and D.M. Ryan, Flight attendant rostering for short-haul airline operations, Operations Research 45 (1997) 649–661.

    Google Scholar 

  16. K.A. Dowsland, Nurse scheduling with tabu search and strategic oscillation, European Journal of Operational Research 106(2/3) (1998) 393–407.

    Google Scholar 

  17. Dr. T. Emden-Weinert, Crew scheduling and staff rostering (2000). http://people.freenet.de/Emden-Weinert/index-e.html.

  18. T. Emden-Weinert, Bibliography on set covering and set partitioning (2000). http://people.freenet.de/Emden-Weinert/index-e.html.

  19. J. Etcheberry, The set covering problem: A new implicit enumeration algorithm, Operations Research 25(5) (1977) 760–772.

    Google Scholar 

  20. P. Eveborn, Investigating soft branching, Technical report, Division of Optimization, Linkoping University, 58183 Linkoping, Sweden (1999).

    Google Scholar 

  21. M.L. Fisher and P. Kedia, Optimal solution of set covering/partitioning problems using dual heuristics, Management Science 36(6) (1990) 674–688.

    Google Scholar 

  22. M.L. Fisher, The Lagrangian relaxation method for solving integer programming problems, Management Science 27(1) (1981) 1–18.

    Google Scholar 

  23. M.L. Fisher, An applications oriented guide to Lagrangian relaxation, Interfaces 15(2) (1985) 10–21.

    Google Scholar 

  24. M. Gamache and F. Soumis, A method for optimally solving the rostering problem, Technical report,G-90-40, GERAD, École des Hautes Études Commercials, Montreal, Canada H3T 1V6 (1993).

  25. M. Gamache, F. Soumis, D. Villeneuve, J. Desrosiers and É. Gélinas, The preferential bidding system at Air Canada, Technical report, G-97-12 GERAD and École Polytechnique de Montréal and École des Hautes Études Commerciales de Montréal and Ad Opt Technologies Inc (1997).

  26. M. Gamache, F. Soumis, G. Marquis and J. Desrosiers, A column generation approach for large-scale aircrew rostering problems, Operations Research 47(2) (1999) 247–263.

    Google Scholar 

  27. T. Gustafsson, A heuristic approach to column generation for airline crew scheduling, M.Phil. thesis, Chalmers University of Technology (1999).

  28. C. Hjorring, Personal communication (2000).

  29. ILOG, ILOG CPLEX 6.5 Users Manual, ILOG Gentilly Cedex, France (1999).

    Google Scholar 

  30. B. Jaumard, F. Semet and T. Vovor, A generalized linear programming model for nurse scheduling, European Journal of Operational Research 107(1) (1998) 1–18.

    Google Scholar 

  31. K.C. Kiwiel, P.O. Lindberg and A. Nou, Bregman proximal relaxations of large-scale 0-1 problems, in: Large-Scale Combinatorial Optimization with Transportation Science Applications, ed. A. Nou, Royal Institute of Technology, Stockholm, Sweden (1997) pp. 19–37.

    Google Scholar 

  32. D. Klabjan, E.L. Johnson and G.L. Nemhauser, Solving large airline crew scheduling problems: Random pairing generation and strong branching, Technical report, tli9912, School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA 30332-0205 (1999).

    Google Scholar 

  33. G. Laporte, Y. Nobert and J. Biron, Rotating schedules, European Journal of Operational Research 4 (1980) 24–30.

    Google Scholar 

  34. J. Larson, Bibliography: Papers on airline OR and related areas (2000). See http://www.imm.dtu.dk/~jla/routebib.html.

  35. S.-H. Lee, Lagrangian relaxation and dual based methods for solving crew rostering problems, M.Phil. thesis, Department of Engineering Science, University of Auckland, New Zealand (1994).

    Google Scholar 

  36. P.O. Lindberg and A. Nou, A combined probabilistic and differentiable dual approach to large-scale binary optimization porblems in: Large-Scale Combinatorial Optimization with Transportation Science Applications, ed. A. Nou, Royal Institute of Technology, Stockholm, Sweden (1997) pp. 19–37.

    Google Scholar 

  37. A.J. Mason, Branch and cut and integer programming for cyclic rostering, in: Proceedings of the 1999 Nordic MPS Conference, Västerås, Sweden (September 1999). See http://www.esc.auckland.ac.nz/Mason/.

  38. A.J. Mason and D. Nielsen, PETRA: A programmable optimisation engine and toolbox for personnel rostering applications, Technical report, Department of Engineering Science, University of Auckland (1999). See http://www.esc.auckland.ac.nz/Mason/.

  39. A.J. Mason and M.C. Smith, A nested column generator for solving rostering problems with integer programming in international conference on optimisation, in: International Conference on Optimisation: Techniques and Applications, eds. L. Caccetta, K.L. Teo, P.F. Siew, Y.H. Leung, L.S. Jennings and V. Rehbock (1998). See also http://www.esc.auckland.ac.nz/Mason/.

  40. A.J. Mason, D.M. Ryan and D.M. Panton, Integrated simulation, heuristic and optimisation approaches to staff scheduling, Operations Research 46(2) (1998) 161–175.

    Google Scholar 

  41. H.H. Millar and M. Kiragu, Cyclic and non-cyclic scheduling of 12 hour shift nurses by network programming, European Journal of Operational Research 104(3) (1998) 582–592.

    Google Scholar 

  42. A. Nou, Large-scale combinatorial optimization with transportation science applications, Ph.D. thesis, Royal Institute of Technology, SE-100 44 Stockholm, Sweden (1997).

    Google Scholar 

  43. E.S. Rosenbloom and N.F. Goertzen, Cyclic nurse scheduling, European Journal of Operational Research 31 (1987) 19–23.

    Google Scholar 

  44. D.M. Ryan, The solution of massive generalised set partitioning problems in aircrew rostering, Journal of the Operational Research Society 43(5) (1992) 459–467.

    Google Scholar 

  45. D.M. Ryan and J.C. Faulkner, On the integer properties of scheduling set partitioning models, European Journal of Operational Research 35(3) (1988) 442–456.

    Google Scholar 

  46. D.M. Ryan and B.A. Foster, An integer programming approach to scheduling, in: Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, ed. A.Wren (North-Holland, Amsterdam, 1981) pp. 269–280.

    Google Scholar 

  47. M.O. Thornley, Crew rostering under a seniority preferential bidding environment using column generation, Masters thesis, Department of Engineering Science, University of Auckland, New Zealand (1995).

    Google Scholar 

  48. F. Vanderbeck and L.A. Wolsey, An exact algorithm for IP column generation, Operations Research Letters 19 (1996) 151–159.

    Google Scholar 

  49. D. Wedelin, An algorithm for large scale 0-1 integer programming with application to airline crew scheduling, Annals of Operations Research 57 (1995) 283–301.

    Google Scholar 

  50. D.Wedelin, The design of a 0-1 integer optimizer and its application in the Carmen system, European Journal of Operational Research 87 (1995) 722–730.

    Google Scholar 

  51. L.A. Wolsey, Integer Programming, Interscience Series in Discrete Mathematics and Optimisation (Wiley, 1998).

  52. A. Wren and J.-M. Rousseau, Bus driver scheduling-an overview, in: Computer-Aided Transit Scheduling: Proceedings of the Sixth International Workshop on Computer-Aided Scheduling of Public Transport, eds. J.R. Daduna, I. Branco and J.M.P. Paixao (Springer-Verlag, Berlin, 1995) pp. 173–187.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Engineering Science, The University of Auckland, New Zealand

    Andrew J. Mason

Authors
  1. Andrew J. Mason
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mason, A.J. Elastic Constraint Branching, the Wedelin/Carmen Lagrangian Heuristic and Integer Programming for Personnel Scheduling. Annals of Operations Research 108, 239–276 (2001). https://doi.org/10.1023/A:1016023415105

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016023415105

Search

Navigation