Hybridizing Constraint Programming and Monte-Carlo Tree Search: Application to the Job Shop problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Hybridizing Constraint Programming and Monte-Carlo Tree Search: Application to the Job Shop problem

Abstract

Constraint Programming (CP) solvers classically explore the solution space using tree search-based heuristics. Monte-Carlo Tree-Search (MCTS), a tree-search based method aimed at sequential decision making under uncertainty, simultaneously estimates the reward associated to the sub-trees, and gradually biases the exploration toward the most promising regions. This paper examines the tight combination of MCTS and CP on the job shop problem (JSP). The contribution is twofold. Firstly, a reward function compliant with the CP setting is proposed. Secondly, a biased MCTS node-selection rule based on this reward is proposed, that is suitable in a multiple-restarts context. Its integration within the Gecode constraint solver is shown to compete with JSP-specific CP approaches on difficult JSP instances.
Fichier principal
Vignette du fichier
Paper_67_camera_ready.pdf (191.23 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00863453 , version 1 (18-09-2013)

Identifiers

  • HAL Id : hal-00863453 , version 1

Cite

Manuel Loth, Michèle Sebag, Youssef Hamadi, Marc Schoenauer, Christian Schulte. Hybridizing Constraint Programming and Monte-Carlo Tree Search: Application to the Job Shop problem. LION7 - Learning and Intelligent OptimizatioN Conference, Jan 2013, Catania, Italy. pp.315-320. ⟨hal-00863453⟩
583 View
474 Download

Share

Gmail Mastodon Facebook X LinkedIn More