完整後設資料紀錄
DC 欄位語言
dc.contributor.authorWu, Tung-Yingen_US
dc.contributor.authorWu, I-Chenen_US
dc.contributor.authorLiang, Chao-Chinen_US
dc.date.accessioned2015-07-21T08:31:24Z-
dc.date.available2015-07-21T08:31:24Z-
dc.date.issued2013-01-01en_US
dc.identifier.isbn978-1-4799-2528-5en_US
dc.identifier.issn2376-6816en_US
dc.identifier.urihttp://dx.doi.org/10.1109/TAAI.2013.27en_US
dc.identifier.urihttp://hdl.handle.net/11536/125130-
dc.description.abstractFlexible job-shop scheduling problem (FJSP) is very important in both fields of production management and combinatorial optimization. This paper focuses on the multi-objective flexible job shop scheduling problem (MO-FJSP) with three objectives which minimizing makespan, total workload and maximal workload, respectively, with Pareto manner. In addition, Monte-Carlo Tree Search (MCTS) is successful in computer Go and many other games. Hence, solving FJSP by MCTS is a new attempt. In this paper, we propose an MCTS algorithm for FJSP, by incorporating Variable Neighborhood Descent Algorithm and other techniques like Rapid Action Value Estimates Heuristic and Transposition Table. Our algorithm finds Pareto solutions of the benchmark problems proposed by Kacem et al. within 116 seconds: 4 solutions in 4x5, 3 in 10x7, 4 in 8x8, 4 in 10x10 and 2 in 15x10. These solutions are the same as the best found to date. Although one article claimed to have an extra 8x8 solution, that article did not find some of the above solutions.en_US
dc.language.isoen_USen_US
dc.subjectMonte-Carlo Tree Searchen_US
dc.subjectMulti-Objective Flexible Job Shop Scheduling Problemen_US
dc.subjectEvolutionary Algorithmen_US
dc.subjectRapid Action Value Estimatesen_US
dc.subjectVariable Neighborhood Descent Algorithmen_US
dc.titleMulti-Objective Flexible Job Shop Scheduling Problem Based on Monte-Carlo Tree Searchen_US
dc.typeProceedings Paperen_US
dc.identifier.doi10.1109/TAAI.2013.27en_US
dc.identifier.journal2013 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI)en_US
dc.citation.spage73en_US
dc.citation.epage78en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000353341700013en_US
dc.citation.woscount0en_US
顯示於類別:會議論文