### 博碩士論文 102426007 完整後設資料紀錄

 DC 欄位 值 語言 DC.contributor 工業管理研究所 zh_TW DC.creator 吳柏賢 zh_TW DC.creator Po-hsien Wu en_US dc.date.accessioned 2015-11-13T07:39:07Z dc.date.available 2015-11-13T07:39:07Z dc.date.issued 2015 dc.identifier.uri http://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=102426007 dc.contributor.department 工業管理研究所 zh_TW DC.description 國立中央大學 zh_TW DC.description National Central University en_US dc.description.abstract 本篇論文主要是在探討運用啟發式變數產生法解決機組人員排班問題，在求解機組人員排班問題中，變數產生法將問題分為主問題及子問題，主問題為集合涵蓋問題，子問題為含資源限制的最短路徑問題，主問題我們運用簡算法進行求解，子問題則運用自行發展的啟發式演算法進行求解，本文的目標在於避免當問題比較大時，運用精確法求解子問題時發生維數災難，為了避免發生維數災難故本文使用啟發式演算法來求解子問題。 zh_TW dc.description.abstract This paper is mainly discussing the use of a heuristic column generation to solve crew scheduling problem. In solving crew scheduling problem column generation will divide the problem into master problem and sub problem. The master problem is set covering problem and the sub problem is a resource constraints shortest path problem. We use simplex method to solve master problem. The sub problem is solved by a heuristic which developed on my own. The objective of this paper is preventing the curse of dimensionality. When the problem is large and solving sub problem by exact method occur the curse of dimensionality. In order to provide the curse of dimensionality we use a heuristic method to solve sub problem. en_US DC.subject 機組人員排班問題 zh_TW DC.subject 變數產生法 zh_TW DC.subject 資源限制最短路徑問題 zh_TW DC.subject 啟發式演算法 zh_TW DC.subject Crew scheduling problem en_US DC.subject Column generation en_US DC.subject Resource constraint shortest path problem en_US DC.subject Heuristic approach en_US DC.title 運用啟發式變數產生法求解機組人員排班問題 zh_TW dc.language.iso zh-TW zh-TW DC.title A Heuristic Column Generation to Solve Crew Scheduling Problem en_US DC.type 博碩士論文 zh_TW DC.type thesis en_US DC.publisher National Central University en_US