Abstract
In this paper we give an overview of some industrial applications built using global constraints. We look at three systems from different application domains and show the core models used to express their constraints. We also consider different search strategies that have been applied and discuss some of the application aspects.
Similar content being viewed by others
References
Abdennadher, S., & Schlenker, H. (1999). INTERDIP an interactive constraint based nurse scheduler. In Practial Application of Constraint Technologies and Logic Programming (PACLP) 1999. London, UK. Blackpool: The Practical Application Company.
Aggoun, A., & Beldiceanu, N. (1993). Extending CHIP in order to solve complex scheduling and placement problems. Math. Comput. Model, 17(7), 57–73.
Aggoun, A., Beldiceanu, N., Bourreau, E., & Simonis, H. (1998). L’ apport des contraintes globales pour la modelisation et la resolution d’applications industrielles. In FRANCORO II, Deuxieme Journees Francophones de Recherche Operationelle. Sousse, Tunisie, April.
Aggoun, A., Gloner, Y., & Simonis, H. (1999). Global constraints for scheduling in CHIP. Invited Industrial Presentation, JFPLC 99.
Appa, G., Magos, D., & Mourtos, I. (2004). LP relaxations of multiple all_different predicates. In Régin & Rueher [47] (Eds.), (pp. 364–369). Berlin Heidelberg New York: Springer.
Apt, K. (2003). Principles of Constraint Programming. Cambridge, UK: Cambridge University Press.
Artigues, C., Selmokhtar, S., & Feillet, D. (2004). A new exact solution algorithm for the job-shop problem with sequence-dependent setup times. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR 2004, Nice, France (pages 37–49). Berlin Heidelberg New York: Springer, April.
Baptiste, P., & Le Pape, C. (2000). Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. In Smolka [65] (Ed.), (pp. 375–389). Berlin Heidelberg New York: Springer.
Baues, G., Kay, P., & Charlier, P. (1994). Constraint based resource allocation for airline crew management. In ATTIS94. Paris, France, April.
Beldiceanu, N., Bourreau, E., Chan, P., & Rivreau, D. (1997). Partial search strategy in CHIP. In 2nd Int. Conf. on Meta-Heuristics. Sofia-Antipolis, France.
Beldiceanu, N., Bourreau, E., Rivreau, D., & Simonis, H. (1996). Solving resource-constrained project scheduling problems with CHIP. In Fifth International Workshop on Project Management and Scheduling. Poznan, Poland (pp. 35–38), April.
Beldiceanu, N., Carlsson, M., & Rampon, J. X. (2005). Global Constraint Catalog. Technical Report T2005:08. Kista, Sweden: Swedish Institute of Computer Science, May.
Beldiceanu, N. & Contjean, E. (1994). Introducing global constraints in CHIP. Math. Comput. Model 12, 97–123.
Beldiceanu, N., & Carlsson, M. (2001). Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint. In Walsh [73] (Ed.), (pp. 377–391). Berlin Heidelberg New York: Springer.
Beldiceanu, N., & Carlsson, M. (2002). A new multi-resource cumulatives constraint with negative heights. In P. Van Hentenryck, (Ed.), CP, Lecture Notes in Computer Science 2470, (pp. 63–79). Berlin Heidelberg New York: Springer.
Bourdais, S., Galinier, P., & Pesant, G. Hibiscus: A constraint programming application to staff scheduling in health care. In Rossi [50] (Ed.), (pp. 153–167). Berlin Heidelberg New York: Springer.
Bourreau, E. (1999). Traitement de Contraintes sur les Graphes en Programmation par Contraintes. PhD thesis, L’Universite de Paris 13—Institut Galilee Laboratoire d’Informatique de Paris Nord (L.I.P.N.), March.
Caseau, Y., & Laburthe, F. (1994). Improved CLP scheduling with task intervals. In International Conference on Logic Programming (ICLP) (pp. 369–383). Cambridge, MA: MIT.
Caseau, Y., & Laburthe, F. (1996). Cumulative scheduling with task intervals. In M. Maher (Ed.), Joint International Conference and Symposium on Logic Programming (JICSLP) (pp. 363–377). Cambridge, MA: MIT.
Chan, P. (2002). La Planification du Personnel: Acteurs, Actions et Termes Multiples Pour Une Planification Operationelle des Personnes. PhD thesis, Universite Joseph Fourier, Grenoble 1. TIMC-IMAG, October.
Chan, P., Heus, K., & Weil, G. (1998). Nurse scheduling with global constraints in CHIP: Gymnaste. In Practical Applications of Constraint Technology (PACT) 1998. London, UK. Blackpool: The Practical Application Company, March.
Chan, P., & Weil, G. (2000). Cyclical timetabling using constraint logic programming. In Practial Application of Constraint Technologies and Logic Programming (PACLP) 2000, Manchester, UK (pp. 159–175). Blackpool: The Practical Application Company.
Cras, Y. (1994). Using constraint logic programming in services: a few short tales. In M. Bruynooghe (Ed.), International Logic Programming Symposium (ILPS) (pp. 3–16). Cambridge, MA: MIT.
Dincbas, M., Van Hentenryck, P., Simonis, H., Aggoun, A., Graf, T., & Berthier, F. (1988). The constraint logic programming language CHIP. In Fifth Generation Computer Systems (FGCS) (pp. 693–702). Berlin Heidelberg New York: Springer.
Dincbas, M., & Simonis, H. (1991). Apache—a constraint based, automated stand allocation system. In Proceedings of Advanced Software Technology in Air Transport (ASTAIR’91), London, UK: Royal Aeronautical Society (pp. 267–282), October.
Dincbas, M., Simonis, H., & Van Hentenryck, P. (1990). Solving large combinatorial problems in logic programming. J. Log. Program. 8(1), 75–93.
Dincbas, M., Simonis, H., & Van Hentenryck, P. (1988). Solving the car sequencing problem in constraint logic programming. In European Conference on Artificial Intelligence (ECAI-88). Munich, W. Germany (pp. 290–295). London, UK: Pitmann, August.
Dincbas, M., Van Hentenryck, P., Simonis, H., Aggoun, A., & Graf, T. (1988). Applications of CHIP to industrial and engineering problems. In First International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, Tullahoma, Tennessee, USA (pp. 885–892). New York, NY: ACM, June.
Chun, A. et al. (2000). Nurse rostering at the hospital authority of Hong-Kong. In AAAI Innovative Applications of Artificial Intelligence. Menlo Park, CA: AAAI.
Darmoni, S. et al. (1994). Horoplan: computer-assisted nurse scheduling using constraint-based programming. In Twelfth International Congress of the European Federation for Medical Informatics, Lisboa, Portugal.
Focacci, F., & Nuijten, W. (2000). A constraint propagation algorithm for scheduling with sequence dependent setup times. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR 2000.
Harvey, W. D. & Ginsberg, M. L. (1995). Limited discrepancy search. In IJCAI 1, 607–615.
Hellsten, L., Pesant, G., & van Beek, P. (2004). A domain consistency algorithm for the stretch constraint. In Wallace [72] (Ed.), (pp. 290–304). Berlin Heidelberg New York: Springer.
Meyer aufm Hofe, H. (1997). ConPlan/SIEDAplan: Personnel assignment as a problem of hierarchical constraint satisfaction. In Practical Applications of Constraint Technology (PACT) 1997. London, UK (pp. 257–271). Blackpool: The Practical Application Company.
Montanari, U. & Rossi, F. (Eds). (1995). In Principles and Practice of Constraint Programming- CP’95, Proceedings of First International Conference, CP’95, Cassis, France, September 19-22, 1995, Lecture Notes in Computer Science 976, (pp. 103–120). Berlin Heidelberg New York: Springer.
Nuijten, W., & Le Pape, C. (1998). Constraint-based job shop scheduling with Ilog Scheduler. J. Heuristics, 3(4), 271–286.
Simonis, H., & Kay, P. (1995). Building industrial CHIP applications from reusable software components. In Practical Applications of Prolog (PAP) 1995, Paris (pp. 355–369). Blackpool: The Practical Application Company, April.
Perrett, M. (1991). Using constraint logic programming techniques in container port planning. ICL Tech. J., 7(3), 537–545, May.
Pesant, G. (2004). A regular language membership constraint for finite sequences of variables. In Wallace [72] (Ed.), (pp. 482–495). Berlin Heidelberg New York: Springer.
Pesant, G., & Régin, J.-C. (2005). Spread: A balancing constraint based on statistics. In P. van Beek (Ed.), CP Lecture Notes in Computer Science 3709 (pp. 460–474). Berlin Heidelberg New York: Springer.
Puget, J.-F. (1995). Applications of constraint programming. In Montanari, & Rossi [35] (Eds.), (pp. 647–650). Berlin Heidelberg New York: Springer.
Quimper, C.-G., López-Ortiz, A., van Beek, P., & Golynski, A. (2004). Improved algorithms for the global cardinality constraint. In Wallace [72] (Ed.), (pp. 542–556). Berlin Heidelberg New York: Springer.
Regin, J.-C. (1994). A filtering algorithm for constraints of difference in CSPs. In Innovative Applications of Artificial Intelligence (pp. 362–367). Menlo Park, CA: AAAI.
Régin, J.-C. (1996). Generalized arc consistency for global cardinality constraint. In AAAI/IAAI, 1 (pp. 209–215). Menlo Park, CA: AAAI.
Régin, J.-C., & Gomes, C.P. (2004). The cardinality matrix constraint. In Wallace [72] (Ed.), (pp. 572–587). Berlin Heidelberg New York: Springer.
Régin, J.-C., & Puget, J.-F. (1997). A filtering algorithm for global sequencing constraints. In Smolka [65] (Ed.), (pp. 32–46). Berlin Heidelberg New York: Springer.
Régin, J.-C., & Rueher, M. (Eds.) (2004). Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, First International Conference, CPAIOR 2004, Nice, France, April 20-22, 2004, Lecture Notes in Computer Science 3011 Berlin Heidelberg New York: Springer.
Ribeiro, C., & Carravilla, M.A. (2004). A global constraint for nesting problems. In Régin, and Rueher [47] (Ed.), (pp. 256–270). Berlin Heidelberg New York: Springer.
Ros, L., Creemers, T., Tourouta, E., & Riera, J. (2001). A global constraint model for integrated routeing and scheduling on a transmission network. In 7th International Conference on Information Networks, Systems and Technologies, Minsk, Belarus (pp. 40–47), October.
Rossi, F. (Ed.) (2003). In Proceedings of the Principles and Practice of Constraint Programming—CP 2003, 9th International Conference, CP 2003, Kinsale, Ireland, September 29–October 3, 2003,Lecture Notes in Computer Science 2833. Berlin Heidelberg New York: Springer.
Simonis, H. (1995). Application development with the CHIP system. In G. Kuper (Eds.), Constraint Databases and Applications. Proc Contessa Workshop, LNCS 1034, Friedrichshafen, Germany (pp. 1–21). Berlin Heidelberg New York: Springer, September.
Simonis, H. (1995). Scheduling and planning with constraint logic programming. Tutorial at Practical Applications of Prolog (PAP) 1995. London, UK, April.
Simonis, H. (1996). A problem classification scheme—when to use CLP. Tutorial at Practical Applications of Constraint Technologies (PACT) 1996. Paris, France, April.
Simonis, H. (1997). Standard models for finite domain constraint solving. Tutorial at Practical Applications of Constraint Technologies (PACT) 1997. London, UK, April.
Simonis, H. (1998). Standard models 2 for finite domain constraint solving. Tutorial at Practical Applications of Constraint Technologies (PACT) 1998. London, UK, March.
Simonis, H. (1999). Visualization in constraint logic programming. Tutorial at Practial Application of Constraint Technologies and Logic Programming (PACLP) 1999. London, UK, April.
Simonis, H. (2000). Finite domain constraint programming methodology. Tutorial at Practial Application of Constraint Technologies and Logic Programming (PACLP) 2000. Manchester, UK, April.
Simonis, H. (2005). Sudoku as a constraint problem. In Fourth International Workshop on Modelling and Reformulating Constraint Satisfaction Problems (CP2005) (pp. 13–27), October.
Simonis, H., & Aggoun, A. (2000). Search-tree visualization. In P. Deransart, J. Maluszynski, & M. Hermenegildo (Eds.), Analysis and Visualisation Tools for Constraint Programming, Lecture Notes in Computer Science 1870, (pp. 191–208). Berlin Heidelberg New York: Springer.
Simonis, H., Aggoun, A., Beldiceanu, N., & Bourreau, E. (2000). Global constraint visualization. In P. Deransart, J. Maluszynski, & M. Hermenegildo (Eds.), Analysis and Visualisation Tools for Constraint Programming, Lecture Notes in Computer Science 1870 (pp. 299–317). Berlin Heidelberg New York: Springer.
Simonis, H., Charlier, P., & Kay, P. (2000). Constraint handling in an integrated transportation problem. IEEE Intell. Syst. Their Appl., 15(1), 26–32, Jan/Feb.
Simonis, H., Cornelissens, T., Dumortier, V., Fabris, G., Nanni, F., & Tirabosco, A. (2000). Using constraint visualization tools. In P. Deransart, J. Maluszynski, & M. Hermenegildo (Eds.), Analysis and Visualisation Tools for Constraint Programming, Lecture Notes in Computer Science 1870 (pp. 321–356). Berlin Heidelberg New York: Springer.
Simonis, H. (1999). Building industrial applications with constraint programming. In H. Comon, C. Marché, & R. Treinen (Eds.), Constraints in Computational Logics (CCL), Lecture Notes in Computer Science 2002 (pp. 271–309). Berlin Heidelberg New York: Springer.
Simonis, H., & Cornelissens, T. (1995). Modelling producer/consumer constraints. In Montanari, & Rossi [35] (Eds.), (pp. 449–462). Berlin Heidelberg New York: Springer.
Smolka, G., (Ed.) (1997). In Principles and Practice of Constraint Programming—CP97, Proceedings of the Third International Conference, Linz, Austria, October 29–November 1, 1997, Lecture Notes in Computer Science 1330. Berlin Heidelberg New York: Springer.
Szymanek, R., Gruian, F., & Kuchcinski, K. (1999). Application of constraint programming to digital systems design. In Workshop on Constraint Programming for Decision and Control, Institute for Automation, Silesian University of Technology. Gliwice, Poland (pp. 296–302), June.
Touraïvane (1995). Constraint programming and industrial applications. In Montanari & Rossi [35] (Eds.), (pp. 640–642). Berlin Heidelberg New York: Springer.
Van Hentenryck, P., & Carillon, J. P. (1988). Generality versus specificity: an experience with AI and OR techniques. In Proceedings of AAAI-88, vol. 2, pp. 660–664.
van Hoeve, W. (2001). The alldifferent constraint: a survey. In 6th Annual Workshop of the ERCIM Working Group on Constraints. Prague, Czech Republic, June.
Vilim, P. (2002). Batch processing with sequence dependent setup times. In P. Van Hentenryck (Ed.), Principles and Practice of Constraint Programing—CP 2002 (pp. 1–764). Ithaca, New York: Cornell University, September.
Wallace, M. (1996). Practical applications of constraint programming. Constraints, 1(1/2), 139–168.
Wallace, M. (Ed.) (2004). In Principles and Practice of Constraint Programming—CP 2004, Proceedings of the 10th International Conference, CP 2004, Toronto, Canada, September 27–October 1, 2004, Lecture Notes in Computer Science 3258. Berlin Heidelberg New York: Springer.
Walsh, T. (Ed.) (2001). In Principles and Practice of Constraint Programming—CP 2001, Proceedings of the 7th International Conference, CP 2001, Paphos, Cyprus, November 26–December 1, 2001, Lecture Notes in Computer Science 2239. Berlin Heidelberg New York: Springer.
Weil, G., Heus, K., Puget, F., & Poujade, M. (1995). Solving the nurse scheduling problem using constraint programming. IEEE Engineering in Medicine and Biology, 14(4), 417–422, July-August.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Simonis, H. Models for Global Constraint Applications. Constraints 12, 63–92 (2007). https://doi.org/10.1007/s10601-006-9011-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10601-006-9011-7