基于SP-MCTS算法的混合流水车间机器人调度

Jian Guo, Yaoyao Shi, Wei Zhang, Yasong Pu, Junfeng Zhang

科研成果: 期刊稿件文章同行评审

4 引用 (Scopus)

摘要

For the complexity of scheduling process caused by parallel equipments, machine eligibility constraints and material handling robots in hybrid flow shop, the modified Single-player Monte-Carlo Tree Search(SP-MCTS)algorithm was proposed, which included the selection policy blending standard deviation, the expansion of single branch and simulation with heuristic rules. In this algorithm, the hybrid flow shop scheduling problem with robotic transportation was transformed into the shortest time branch path problem in the process of hybrid flow shop state evolution, and Markov Decision Processes(MDP)dynamic model for Hybrid Flow Shop scheduling problem with Robotic Transportation(HFSRT)was established. During the process of optimization, the selection policy was used to evaluate the potential of branches, search high potential branches and expand traversing multiple branch nodes. On this basis, the heuristic rules were used to explore the branch, and a scheduling solution was obtained. Besides, the pruning method was applied to narrow the search range in the search process, and a single branch expansion was used to avoid multiple explorations in identical paths and improve the availability of computing resources. Benchmark examples were applied to test the proposed algorithm, which proved that SP-MCTS algorithm had certain superiority in solving the multi-stage and multi-device hybrid flow shop scheduling problem.

投稿的翻译标题SP-MCTS algorithm for hybrid flow shop scheduling problem with robotic transportation
源语言繁体中文
页(从-至)2208-2218
页数11
期刊Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS
25
9
DOI
出版状态已出版 - 1 9月 2019

关键词

  • Hybrid flow shop
  • Mont Calro tree search
  • Robot
  • Scheduling policy
  • Single-player Monte-Carlo tree search algorithm

指纹

探究 '基于SP-MCTS算法的混合流水车间机器人调度' 的科研主题。它们共同构成独一无二的指纹。

引用此