Skip to main content

2018 | OriginalPaper | Buchkapitel

Soft-Regular with a Prefix-Size Violation Measure

verfasst von : Minh Thanh Khong, Christophe Lecoutre, Pierre Schaus, Yves Deville

Erschienen in: Integration of Constraint Programming, Artificial Intelligence, and Operations Research

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, we propose a variant of the global constraint soft-regular by introducing a new violation measure that relates a cost variable to the size of the longest prefix of the assigned variables, which is consistent with the constraint automaton. This measure allows us to guarantee that first decisions (assigned variables) respect the rules imposed by the automaton. We present a simple algorithm, based on a Multi-valued Decision Diagram (MDD), that enforces Generalized Arc Consistency (GAC). We provide an illustrative case study on nurse rostering, which shows the practical interest of our approach.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Régin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of AAAI 1994, pp. 362–367 (1994) Régin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of AAAI 1994, pp. 362–367 (1994)
2.
Zurück zum Zitat Beldiceanu, N., Contejean, E.: Introducing global constraints in CHIP. Math. Comput. Modell. 20(12), 97–123 (1994)CrossRef Beldiceanu, N., Contejean, E.: Introducing global constraints in CHIP. Math. Comput. Modell. 20(12), 97–123 (1994)CrossRef
3.
Zurück zum Zitat Van Hentenryck, P., Carillon, J.-P.: Generality versus specificity: an experience with AI and OR techniques. In: Proceedings of AAAI 1988, pp. 660–664 (1988) Van Hentenryck, P., Carillon, J.-P.: Generality versus specificity: an experience with AI and OR techniques. In: Proceedings of AAAI 1988, pp. 660–664 (1988)
4.
Zurück zum Zitat Régin, J.-C.: Generalized arc consistency for global cardinality constraint. In: Proceedings of AAAI 1996, pp. 209–215 (1996) Régin, J.-C.: Generalized arc consistency for global cardinality constraint. In: Proceedings of AAAI 1996, pp. 209–215 (1996)
6.
Zurück zum Zitat Aggoun, A., Beldiceanu, N.: Extending chip in order to solve complex scheduling and placement problems. Math. Comput. Modell. 17(7), 57–73 (1993)CrossRef Aggoun, A., Beldiceanu, N.: Extending chip in order to solve complex scheduling and placement problems. Math. Comput. Modell. 17(7), 57–73 (1993)CrossRef
8.
Zurück zum Zitat Schaus, P.: Variable objective large neighborhood search: a practical approach to solve over-constrained problems. In: 2013 IEEE 25th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 971–978. IEEE (2013) Schaus, P.: Variable objective large neighborhood search: a practical approach to solve over-constrained problems. In: 2013 IEEE 25th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 971–978. IEEE (2013)
11.
Zurück zum Zitat van Hoeve, W., Pesant, G., Rousseau, L.-M.: On global warming: flow-based soft global constraints. J. Heuristics 12(4–5), 347–373 (2006)CrossRef van Hoeve, W., Pesant, G., Rousseau, L.-M.: On global warming: flow-based soft global constraints. J. Heuristics 12(4–5), 347–373 (2006)CrossRef
12.
Zurück zum Zitat He, J., Flener, P., Pearson, J.: Underestimating the cost of a soft constraint is dangerous: revisiting the edit-distance based soft regular constraint. J. Heuristics 19(5), 729–756 (2013)CrossRef He, J., Flener, P., Pearson, J.: Underestimating the cost of a soft constraint is dangerous: revisiting the edit-distance based soft regular constraint. J. Heuristics 19(5), 729–756 (2013)CrossRef
13.
Zurück zum Zitat He, J., Flener, P., Pearson, J.: An automaton constraint for local search. Fundamenta Informaticae 107(2–3), 223–248 (2011)MathSciNetMATH He, J., Flener, P., Pearson, J.: An automaton constraint for local search. Fundamenta Informaticae 107(2–3), 223–248 (2011)MathSciNetMATH
14.
Zurück zum Zitat Montanari, U.: Network of constraints: fundamental properties and applications to picture processing. Inf. Sci. 7, 95–132 (1974)MathSciNetCrossRef Montanari, U.: Network of constraints: fundamental properties and applications to picture processing. Inf. Sci. 7, 95–132 (1974)MathSciNetCrossRef
15.
Zurück zum Zitat Dechter, R.: Constraint Processing. Morgan Kaufmann, Burlington (2003)MATH Dechter, R.: Constraint Processing. Morgan Kaufmann, Burlington (2003)MATH
16.
Zurück zum Zitat Lecoutre, C.: Constraint Networks: Techniques and Algorithms. ISTE/Wiley, Hoboken (2009)CrossRef Lecoutre, C.: Constraint Networks: Techniques and Algorithms. ISTE/Wiley, Hoboken (2009)CrossRef
18.
Zurück zum Zitat Hadzic, T., Hansen, E.R., O’Sullivan, B.: On automata, MDDs and BDDs in constraint satisfaction. In: Proceedings of ECAI 2008 Workshop on Inference methods based on Graphical Structures of Knowledge (2008) Hadzic, T., Hansen, E.R., O’Sullivan, B.: On automata, MDDs and BDDs in constraint satisfaction. In: Proceedings of ECAI 2008 Workshop on Inference methods based on Graphical Structures of Knowledge (2008)
19.
Zurück zum Zitat Cheng, K., Yap, R.: An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints. Constraints 15(2), 265–304 (2010)MathSciNetCrossRef Cheng, K., Yap, R.: An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints. Constraints 15(2), 265–304 (2010)MathSciNetCrossRef
21.
Zurück zum Zitat Perez, G., Régin, J.-C.: Soft and cost MDD propagators. In: Proceedings of AAAI 2017, pp. 3922–3928 (2017) Perez, G., Régin, J.-C.: Soft and cost MDD propagators. In: Proceedings of AAAI 2017, pp. 3922–3928 (2017)
22.
Zurück zum Zitat Khong, M.T., Deville, Y., Schaus, P., Lecoutre, C.: Efficient reification of table constraints. In: 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE (2017) Khong, M.T., Deville, Y., Schaus, P., Lecoutre, C.: Efficient reification of table constraints. In: 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE (2017)
23.
Zurück zum Zitat Burke, E., De Causmaecker, P., Berghe, G.V., Van Landeghem, H.: The state of the art of nurse rostering. J. Sched. 7(6), 441–499 (2004)MathSciNetCrossRef Burke, E., De Causmaecker, P., Berghe, G.V., Van Landeghem, H.: The state of the art of nurse rostering. J. Sched. 7(6), 441–499 (2004)MathSciNetCrossRef
24.
Zurück zum Zitat Ernst, A., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: a review of applications, methods and models. Eur. J. Oper. Res. 153(1), 3–27 (2004)MathSciNetCrossRef Ernst, A., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: a review of applications, methods and models. Eur. J. Oper. Res. 153(1), 3–27 (2004)MathSciNetCrossRef
25.
Zurück zum Zitat Curtois, T., Qu, R.: Computational results on new staff scheduling benchmark instances. Technical report, ASAP Research Group, School of Computer Science, University of Nottingham, 06 October 2014 Curtois, T., Qu, R.: Computational results on new staff scheduling benchmark instances. Technical report, ASAP Research Group, School of Computer Science, University of Nottingham, 06 October 2014
Metadaten
Titel
Soft-Regular with a Prefix-Size Violation Measure
verfasst von
Minh Thanh Khong
Christophe Lecoutre
Pierre Schaus
Yves Deville
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-93031-2_24