:::

詳目顯示

回上一頁
題名:以基因演算法求解最小化設置時間單機排程問題
書刊名:商管科技季刊
作者:蘇純繪翁瑞聰
作者(外文):Su, Chwen-tzengWong, Jui-tsung
出版日期:2004
卷期:5:3
頁次:頁275-288
主題關鍵詞:流程式相依設置時間問題基因演算法SDST
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:13
  • 點閱點閱:19
     本研究主要是以啟發式演算法,求解單機的流程式相依設置時間問題(Sequence-Dependent Setup Times,SDST)。此演算法以基因演算法為基礎,加入洞悉法則的長期記憶來解SDST問題,主要是使基因演算法在搜解過程中避免下一代族群落入不必要的解空間裡。在經過測試後,本研究之演算法的確可使收斂過程不易落入區域最佳解,使得求解品質優於其他的啟發式演算法,但由於長期記憶的關係,使得在求解時間上較慢。
     In this study, Sequence-Dependent Setup Times (SDST) problems can be solved by heuristic algorithm based on Genetic Algorithm. Adding long memory of Fathom Rule to solve SDST problems is to avoid next generation population falling into inessential solution space. After testing, the algorithm of this study is certain to make converged progress not to fall down local optima solution, and the quality of solution is better than other heuristic algorithm. Because of long memory, CPU time becomes slower.
期刊論文
1.Cerny, V.(1985)。Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm。Journal of Optimization Theory and Applications,45(1),41-51。  new window
2.Du, J.、Leung, J. Y. T.(1990)。Minimizing total tardiness on one machine is NP-hard。Mathematics of Operations Research,15,483-495。  new window
3.Clarke, G. U.、Wright, J. W.(1964)。Scheduling of Vehicles from a Central Depot to a Number of Delivery Points。Operations Research,12(4),568-581。  new window
4.韓復華、楊智凱(19960600)。門檻接受法在TSP問題上之應用。運輸計劃,25(2),163-187。new window  延伸查詢new window
圖書
1.Baker, K. R.(1974)。Introduction to Sequencing and Scheduling。New York, NY:John Wiley & Sons。  new window
2.Goldberg, David Edward(1989)。Genetic Algorithms in Search, Optimization, and Machine Learning。Boston, MA:Addison-Wesley。  new window
其他
1.吳泰熙、張欽智(1997)。以禁忌搜尋法則求解推銷員行問題。  延伸查詢new window
2.羅中育(2000)。田口品質工程應用於模擬退火法參數組合之研究--以旅行推銷員問題(TSP)為例。  延伸查詢new window
3.Armentano, V. A., & Ronconi, D. P.(1999)。Tabu search for total tardiness minimization in flowshop scheduling problems。  new window
4.Fishetti, M., Salazar, J. J., & Toth, P.(1993)。Branch and Cut Algorithm for the symmetric Generalised Travelling Salesman. Problem。  new window
5.Glassey, C. R.(1968)。Minimum changeover scheduling of several products on one machine。  new window
6.Gomory, R. E.(1963)。Solving linear programming problems in integers。  new window
7.Hansen, M., & Karp, R.(1962)。A dynamic programming approach to sequencing problems。  new window
8.Jellouli, O., & Chatelet, E.(2000)。Dynamic programming approach for the generalized traveling salesman problem。  new window
9.Kirkpatrick, A.(1984)。Optimization by simulated annealing: quantitative studies。  new window
10.Knox, J.(199)。Tabu search performance on the symmetric TSP。  new window
11.Brucker, P., Hilbig, T., & Hurink, J.(1999)。A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags。  new window
12.Panwalkar, S. S.(1973)。Sequencing research and the industrial scheduling problem。  new window
13.Ragatz, G. L.(1989)。Scheduling to minimize tardiness on a single machine with sequence dependent setup times。  new window
14.Volgenant, T., & Jonker, R.(1982)。A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top