頁籤選單縮合
題名 | Ant Colony Optimization for Railway Driver Crew Scheduling: from Modeling to Implementation=蟻群最佳化演算法求解鐵路司機人員排班問題 |
---|---|
作者 | 黃山琿; 楊大輝; 王榮祖; | 書刊名 | 工業工程學刊 |
卷期 | 28:6 2011.09[民100.09] |
頁次 | 頁437-449 |
分類號 | 440.8 |
關鍵詞 | 蟻群最佳化演算法; 時空圖; 人員排班問題; 車輛途程問題; Ant colony optimization; Time–space diagram; Crew scheduling problem; Ehicle routing problem; |
語文 | 英文(English) |
英文摘要 | This study addresses the crew-scheduling problems for railway drivers’ duty trips on a railway timetable represented as a time–space diagram. Based on the diagram, the railway driver-scheduling problem is then transformed into an arc routing problem (ARP). Because of the special properties and features of the problem, the ARP can be treated as a typical vehicle node routing problem. The Ant Colony Optimization algorithm is employed to solve the transformed problem. Real data from the Taiwan Railways Administration are used to test the proposed models and algorithm. The results showed that the dead-heading-allowed approach is able to obtain a better solution in terms of fewer drivers and shorter idle time. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。