Effect of solution representations on Tabu search in scheduling applications

Chen Fu Chen, Muh-Cherng Wu*, Keng Han Lin

*Corresponding author for this work

研究成果: Article同行評審

9 引文 斯高帕斯(Scopus)

摘要

This research investigates the application of meta-heuristic algorithms to a scheduling problem called permutation manufacturing-cell flow shop (PMFS) from two perspectives. First, we examine the effect of using different solution representations (Snew and Sold) while applying Tabu-search algorithm. Experimental results reveal that Tabu-Snew outperforms Tabu-Sold. The rationale why Tabu-Snew is superior is further examined by characterizing the intermediate outcomes of the evolutionary processes in these two algorithms. We find that the superiority of S new is due to its relatively higher degree of freedom in modeling Tabu neighborhood. Second, we propose a new algorithm GA-Tabu-Snew, which empirically outperforms the state-of-the-art meta-heuristic algorithms in solving the PMFS problem. This research highlights the importance of solution representation in the application of meta-heuristic algorithm, and establishes a significant milestone in solving the PMFS problem.

原文English
頁(從 - 到)2817-2825
頁數9
期刊Computers and Operations Research
40
發行號12
DOIs
出版狀態Published - 23 七月 2013

指紋 深入研究「Effect of solution representations on Tabu search in scheduling applications」主題。共同形成了獨特的指紋。

引用此