Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Possibilistic Framework for Multi-objective Optimization Under Uncertainty Kapitel lesen Erstes Kapitel lesen

2019 | OriginalPaper | Buchkapitel

11. CHN and Min-Conflict Heuristic to Solve Scheduling Meeting Problems

verfasst von : Adil Bouhouch, Chakir Loqman, Abderrahim El Qadi

Erschienen in: Bioinspired Heuristics for Optimization

Verlag: Springer International Publishing

Einloggen

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

search-config
loading …

Abstract

Meetings are important for teem works, However, scheduling a meeting that involves persons with different preferences and engagements remains a difficult task. This paper proposes a new hybrid approach to solve meeting scheduling problem (MSP). The proposed network combines the characteristics of neural networks and minimizing conflicts approach. Her the MSP is considerate as Constraint Satisfaction Problem, then we apply Continuous Hopfield Neural Netwok (CHN) and Conflicts Minimization Heuristics to solve a quadratic reformulation of the CSP-MSP model in other words the Min-Conflict heuristic will improve the given CHN solution. So, the performance of the network is compared with the existing scheduling algorithms under various experimental conditions.

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren
Vorheriges Kapitel Hidden Markov Model Classifier for the Adaptive ACS-TSP Pheromone Parameters
Nächstes Kapitel A Probabilistic Finite State Machine Design of Particle Swarm Optimization
Literatur
1.
BenHassine, A., & Ho, T. B. (2007). An agent-based approach to solve dynamic meeting scheduling problems with preferences. Engineering Applications of Artificial Intelligence, 20(6), 857–873.CrossRef
2.
Berger, F., Klein, R., Nussbaum, D., Sack, J. R., & Yi, J. (2009). A meeting scheduling problem respecting time and space. GeoInformatica, 13(4), 453–481.CrossRef
3.
Bouhouch, A., Chakir, L., & El Qadi, A. (2016). Scheduling meeting solved by neural network and min-conflict heuristic. In 2016 4th IEEE International Colloquium on Information Science and Technology (CiSt) (pp. 773–778). New York: IEEE.
4.
Chun, A., Wai, H., & Wong, R. Y. (2003). Optimizing agent-based meeting scheduling through preference estimation. Engineering Applications of Artificial Intelligence, 16(7), 727–743.CrossRef
5.
Davenport, A., Tsang, E., Wang, C. J., Zhu, K. (1994). Genet: A connectionist architecture for solving constraint satisfaction problems by iterative improvement. In AAAI (pp. 325–330).
6.
Ettaouil, M., Loqman, C., & Haddouch, K. (2010). Job shop scheduling problem solved by the continuous hopfield networks. Journal of Advanced Research in Computer Science, 2(1), 31–47.
7.
Ettaouil, M., Loqman, C., Hami, Y., & Haddouch, K. (2012). Task assignment problem solved by continuous hopfield network. International Journal of Computer Science Issues, 9(1), 206–2012.
8.
Haddouch, K., Ettaouil Mohamed Loqman, C., (2013). Continuous hopfield network and quadratic programming for solving the binary constraint satisfaction problems. Journal of Theoretical and Applied Information Technology, 56(3), 362–372.
9.
Haddouch, K., Ettaouil, M., & Loqman, C. (2013). Continuous hopfield network and quadratic programming for solving the binary constraint satisfaction problems. Journal of Theoretical and Applied Information Technology, 56(3), 362–372.
10.
Handa, H. (2003). Hybridization of estimation of distribution algorithms with a repair method for solving constraint satisfaction problems. In Genetic and Evolutionary ComputationGECCO 2003 (pp. 991–1002). Berlin: Springer.
11.
Hayakawa, D., Mizuno, K., Sasaki, H., & Nishihara, S. (2011). Improving search efficiency adopting hill-climbing to ant colony optimization for constraint satisfaction problems. In 2011 Third International Conference on Knowledge and Systems Engineering (KSE) (pp. 200–204). New York: IEEE.
12.
Hopfield, J. J. (1982). Neural networks and physical systems with emergent collective computational abilities. Proceedings of the National Academy of Sciences, 79(8), 2554–2558.MathSciNetCrossRef
13.
Hopfield, J. J. (1984). Neurons with graded response have collective computational properties like those of two-state neurons. Proceedings of the National Academy of Sciences, 81(10), 3088–3092.CrossRef
14.
Hopfield, J. J., & Tank, D. W. (1985). neural computation of decisions in optimization problems. Biological Cybernetics, 52(3), 141–152.MathSciNetMATH
15.
Jennings, N. R., & Jackson, A. (1995). Agent-based meeting scheduling: A design and implementation. IEE Electronics Letters, 31(5), 350–352.CrossRef
16.
Kanoh, H., Matsumoto, M., Nishihara, S. (1995). Genetic algorithms for constraint satisfaction problems. In IEEE International Conference on Systems, Man and Cybernetics, 1995. Intelligent Systems for the 21st Century (Vol. 1, pp. 626–631). New York: IEEE.
17.
Lee, J. H., Leung, H., Won, H. (1995). Extending genet for non-binary csp’s. In Seventh International Conference on Tools with Artificial Intelligence, 1995. Proceedings (pp. 338–343). New York: IEEE.
18.
Li, X., Zhang, X., Qian, Q., Wang, Z., Shang, H., Huang, M., Lu, Z. (2016). Cloud tasks scheduling meeting with qos. In Proceedings of the 2015 International Conference on Electrical and Information Technologies for Rail Transportation (pp. 289–297). Berlin: Springer.
19.
Liu, T., Liu, M., Zhang, Y.B., Zhang, L. (2005). Hybrid genetic algorithm based on synthetical level of resource conflict for complex construction project scheduling problem. In Proceedings of 2005 International Conference on Machine Learning and Cybernetics, 2005 (Vol. 9, pp. 5699–5703). New York: IEEE.
20.
Minton, S., Johnston, M. D., Philips, A. B., & Laird, P. (1992). Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58(1), 161–205.MathSciNetCrossRef
21.
Minton, S., Philips, A., Johnston, M. D., & Laird, P. (1993). Minimizing conflicts: A heuristic repair method for constraint-satisfaction and scheduling problems. Journal of Artificial Intelligence Research, 1, 1–15.CrossRef
22.
Rasmussen, R. V., & Trick, M. A. (2006). The timetable constrained distance minimization problem. In International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming (pp. 167–181). Berlin: Springer.
23.
Rinaldi, F., & Serafini, P. (2006). Scheduling school meetings. In International Conference on the Practice and Theory of Automated Timetabling (pp. 280–293). Berlin: Springer.
24.
Schoofs, L., & Naudts, B. (2002). Swarm intelligence on the binary constraint satisfaction problem. In Proceedings of the 2002 Congress on Evolutionary Computation, 2002. CEC’02 (Vol. 2, pp. 1444–1449). New York: IEEE.
25.
Sen, S. (1997). Developing an automated distributed meeting scheduler. IEEE Expert, 12(4), 41–45.CrossRef
26.
Shakshuki, E., Koo, H. H., Benoit, D., & Silver, D. (2008). A distributed multi-agent meeting scheduler. Journal of Computer and System Sciences, 74(2), 279–296.MathSciNetCrossRef
27.
28.
Talaván, P. M., & Yáñez, J. (2005). A continuous hopfield network equilibrium points algorithm. Computers and Operations Research, 32(8), 2179–2196.MathSciNetCrossRef
29.
Tsuchiya, K., & Takefuji, Y. (1997). A neural network parallel algorithm for meeting schedule problems. Applied Intelligence, 7(3), 205–213.CrossRef
30.
Wang, J., Niu, C., & Shen, R. (2007). Scheduling meetings in distance learning. In International Workshop on Advanced Parallel Processing Technologies (pp. 580–589). Berlin: Springer.
31.
Zou, H., & Choueiry, B. Y. (2003). Characterizing the behavior of a multi-agent search by using it to solve a tight, real-world resource allocation problem. In Workshop on Applications of Constraint Programming, Kinsale, County Cork, Ireland (pp. 81–101).
Metadaten
Titel
CHN and Min-Conflict Heuristic to Solve Scheduling Meeting Problems
verfasst von
Adil Bouhouch
Chakir Loqman
Abderrahim El Qadi
Copyright-Jahr
2019
Buch
Bioinspired Heuristics for Optimization

Print ISBN: 978-3-319-95103-4

Electronic ISBN: 978-3-319-95104-1

Copyright-Jahr: 2019

DOI
https://doi.org/10.1007/978-3-319-95104-1_11