Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
