摘要：In this paper, a modified Monte-Carlo tree search (MCTS) algorithm is proposed to solve two-sided assembly line balancing problem (TALBP). Firstly, a brief review on TSALBP is provided. Then the modified MCTS algorithm is introduced and its main features are also pointed out. The test is performed on the well-known benchmark set of problem instances. Experiments results show that our new algorithm significantly outperforms existing results, especially for large problems.
