A reinforcement learning algorithm to improve scheduling search heuristics with the SVM
Gersmann K, Hammer B (2004)
In: 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541)., 3. IEEE: 1811-1816.
Konferenzbeitrag
| Veröffentlicht | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Gersmann, K.;
Hammer, BarbaraUniBi 
Einrichtung
Abstract / Bemerkung
A regret-based biased random sampling scheme (RBRS) is a simple but powerful priority-rule based method to solve the resource constrained project scheduling problem (RCPSP), a well-known NP-hard benchmark problem. We present a generic machine learning method to improve results of RBRS. The rout-algorithm of reinforcement learning is combined with the support vector machine (SVM) to learn an appropriate value function which guides the search strategy given by RBRS. The specific properties of the SVM allow to reduce the size of the training set and show improved results even after a short period of training as demonstrated for benchmark instances of the RCPSP.
Erscheinungsjahr
2004
Titel des Konferenzbandes
2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541)
Band
3
Seite(n)
1811-1816
Konferenz
2004 IEEE International Joint Conference on Neural Networks
Konferenzort
Budapest, Hungary
ISBN
0-7803-8359-1
Page URI
https://pub.uni-bielefeld.de/record/2982121
Zitieren
Gersmann K, Hammer B. A reinforcement learning algorithm to improve scheduling search heuristics with the SVM. In: 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541). Vol 3. IEEE; 2004: 1811-1816.
Gersmann, K., & Hammer, B. (2004). A reinforcement learning algorithm to improve scheduling search heuristics with the SVM. 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541), 3, 1811-1816. IEEE. https://doi.org/10.1109/IJCNN.2004.1380883
Gersmann, K., and Hammer, Barbara. 2004. “A reinforcement learning algorithm to improve scheduling search heuristics with the SVM”. In 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541), 3:1811-1816. IEEE.
Gersmann, K., and Hammer, B. (2004). “A reinforcement learning algorithm to improve scheduling search heuristics with the SVM” in 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541), vol. 3, (IEEE), 1811-1816.
Gersmann, K., & Hammer, B., 2004. A reinforcement learning algorithm to improve scheduling search heuristics with the SVM. In 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541). no.3 IEEE, pp. 1811-1816.
K. Gersmann and B. Hammer, “A reinforcement learning algorithm to improve scheduling search heuristics with the SVM”, 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541), vol. 3, IEEE, 2004, pp.1811-1816.
Gersmann, K., Hammer, B.: A reinforcement learning algorithm to improve scheduling search heuristics with the SVM. 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541). 3, p. 1811-1816. IEEE (2004).
Gersmann, K., and Hammer, Barbara. “A reinforcement learning algorithm to improve scheduling search heuristics with the SVM”. 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541). IEEE, 2004.Vol. 3. 1811-1816.
Google Scholar
ISBN Suche