| dc.contributor | 資管系 | |
| dc.creator (作者) | Lo, C.-C.;Deng, Guang-Feng | |
| dc.creator (作者) | 鄧廣豐 | zh_TW |
| dc.date (日期) | 2007 | |
| dc.date.accessioned | 13-Jul-2015 16:29:17 (UTC+8) | - |
| dc.date.available | 13-Jul-2015 16:29:17 (UTC+8) | - |
| dc.date.issued (上傳時間) | 13-Jul-2015 16:29:17 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/76519 | - |
| dc.description.abstract (摘要) | In this paper, an Ant Colony Optimization (ACO) based Ant Crew Scheduling Model (ACSM) is proposed to solve airline crew scheduling problems. In the proposed ACSM, airline crew scheduling problems are first formulated as traveling salesman problems with flight graph representation. Then, the ACO algorithm is applied to search near-optimal solutions for airline crew schedules. The validity of the proposed ACSM is verified by implementing it in real study cases. The results from the implementation and evaluation confirm that the proposed ACSM is suitable for the airline crew scheduling problems with good performance. © 2007 IEEE. | |
| dc.format.extent | 176 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Proceedings - Third International Conference on Natural Computation, ICNC 2007,Volume 4, 論文編號 4344781, Pages 797-801 | |
| dc.relation (關聯) | 3rd International Conference on Natural Computation, ICNC 2007,24 August 2007 through 27 August 2007,Haikou, Hainan | |
| dc.subject (關鍵詞) | Airline crew scheduling problems; Near-optimal solutions; Air transportation; Combinatorial optimization; Problem solving; Scheduling; Traveling salesman problem; Learning algorithms | |
| dc.title (題名) | Using ant colony optimization algorithm to solve airline crew scheduling problems | |
| dc.type (資料類型) | conference | en |
| dc.identifier.doi (DOI) | 10.1109/ICNC.2007.797 | |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1109/ICNC.2007.797 | |
