運用啟發式變數產生法求解機組人員排班問題;A Heuristic Column Generation to Solve Crew Scheduling Problem

NCUIR > School of Management at National Central University > Graduate Institute of Industrial Management > Electronic Thesis & Dissertation > Item 987654321/69245

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/69245

Title:	運用啟發式變數產生法求解機組人員排班問題;A Heuristic Column Generation to Solve Crew Scheduling Problem
Authors:	吳柏賢;Wu,Po-hsien
Contributors:	工業管理研究所
Keywords:	機組人員排班問題;變數產生法;資源限制最短路徑問題;啟發式演算法;Crew scheduling problem;Column generation;Resource constraint shortest path problem;Heuristic approach
Date:	2015-11-13
Issue Date:	2016-01-05 17:04:28 (UTC+8)
Publisher:	國立中央大學
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.
Appears in Collections:	[Graduate Institute of Industrial Management] Electronic Thesis & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	489	View/Open

社群 sharing

Loading...