Modeling the Regular Constraint with Integer Programming

Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer programming (MIP), while in constraint programming (CP), the global constraint regular easily represents this kind of substructure with deterministic finite automata (DFA). In this paper, we use DFAs and the associated layered graph structure built for the regular constraint consistency algorithm to develop a MIP version of the constraint. We present computational results on an employee timetabling problem, showing that this new modeling approach can significantly decrease computational times in comparison with a classical MIP formulation.

[1]  Stephen E. Bechtold,et al.  Implicit modeling of flexible break assignments in optimal shift scheduling , 1990 .

[2]  Stephen E. Bechtold,et al.  The equivalence of general set‐covering and implicit integer programming formulations for shift scheduling , 1996 .

[3]  T. Aykin.  Optimal Shift Scheduling with Multiple Break Windows , 1996 .

[4]  Andreas T. Ernst,et al.  An Annotated Bibliography of Personnel Scheduling and Rostering , 2004, Ann. Oper. Res..

[5]  Gilles Pesant,et al.  A Regular Language Membership Constraint for Finite Sequences of Variables , 2004, CP.

[6]  George B. Dantzig,et al.  Letter to the Editor - A Comment on Edie's "Traffic Delays at Toll Booths" , 1954, Oper. Res..

[7]  M. Segal,et al.  The Operator-Scheduling Problem: A Network-Flow Approach , 1974, Oper. Res..

[8]  Mark W. Isken,et al.  An Implicit Tour Scheduling Model with Applications in Healthcare , 2004, Ann. Oper. Res..

[9]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[10]  Meinolf Sellmann.  The Theory of Grammar Constraints , 2006, CP.

[11]  Nagraj Balakrishnan,et al.  A network model for the rotating workforce scheduling problem , 1990, Networks.

[12]  Gilles Pesant,et al.  On global warming: Flow-based soft global constraints , 2006, J. Heuristics.

[13]  Gilles Pesant,et al.  A Cost-Regular Based Hybrid Column Generation Approach , 2006, Constraints.

[14]  Stephen Norris,et al.  A Flexible, Fast, and Optimal Modeling Approach Applied to Crew Rostering at London Underground , 2004, Ann. Oper. Res..

[15]  Laurence A. Wolsey,et al.  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings , 2007, CPAIOR.

[16]  Harvey H. Millar,et al.  Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming , 1998 .

[17]  Michael J. Brusco,et al.  Personnel Tour Scheduling When Starting-Time Restrictions Are Present , 1998 .

[18]  Andreas T. Ernst,et al.  Staff scheduling and rostering: A review of applications, methods and models , 2004, Eur. J. Oper. Res..

[19]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[20]  Mark Wallace,et al.  Principles and Practice of Constraint Programming – CP 2004 , 2004, Lecture Notes in Computer Science.

[21]  Frédéric Benhamou.  Principles and Practice of Constraint Programming - CP 2006, 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings , 2006, CP.

[22]  Toby Walsh,et al.  Global Grammar Constraints , 2006, CP.

[23]  Tobias Achterberg,et al.  SCIP - a framework to integrate Constraint and Mixed Integer Programming , 2004 .

[24]  Gary M. Thompson.  Improved implicit optimal modeling of the labor shift scheduling problem , 1995 .

[25]  Oktay Günlük,et al.  An integer programming model for the weekly tour scheduling problem , 2001 .

[26]  Gilles Pesant,et al.  Constraint Programming Based Column Generation for Employee Timetabling , 2005, CPAIOR.