資料載入處理中...
臺灣人文及社會科學引文索引資料庫系統
:::
網站導覽
國圖首頁
聯絡我們
操作說明
English
行動版
(18.118.152.10)
登入
字型:
**字體大小變更功能,需開啟瀏覽器的JAVASCRIPT,如您的瀏覽器不支援,
IE6請利用鍵盤按住ALT鍵 + V → X → (G)最大(L)較大(M)中(S)較小(A)小,來選擇適合您的文字大小,
如為IE7以上、Firefoxy或Chrome瀏覽器則可利用鍵盤 Ctrl + (+)放大 (-)縮小來改變字型大小。
來源文獻查詢
引文查詢
瀏覽查詢
作者權威檔
引用/點閱統計
我的研究室
資料庫說明
相關網站
來源文獻查詢
/
簡易查詢
/
查詢結果列表
/
詳目列表
:::
詳目顯示
第 1 筆 / 總合 1 筆
/1
頁
來源文獻資料
外文摘要
引文資料
題名:
Ant Colony Optimization for Railway Driver Crew Scheduling: from Modeling to Implementation
書刊名:
工業工程學刊
作者:
黃山琿
/
楊大輝
/
王榮祖
作者(外文):
Huang, Shan-huen
/
Yang, Ta-hui
/
Wang, Rong-tsu
出版日期:
2011
卷期:
28:6
頁次:
頁437-449
主題關鍵詞:
蟻群最佳化演算法
;
時空圖
;
人員排班問題
;
車輛途程問題
;
Ant colony optimization
;
Time–space diagram
;
Crew scheduling problem
;
Ehicle routing problem
原始連結:
連回原系統網址
相關次數:
被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
排除自我引用:0
共同引用:0
點閱:34
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.
以文找文
期刊論文
1.
Dorigo, Marco、Gambardella, Luca Maria(1997)。Ant Colony System: A cooperative learning approach to the traveling salesman problem。IEEE Transactions on Evolutionary Computation,1(1),53-66。
2.
Chu, S. C. K.、Chan, E. C. H.(1998)。Crew Scheduling of Light Rail Transit in Hong Kong: from Modeling to Implementation。Computers & Operations Research,25(11),887-894。
3.
Lucic, P.、Teodorovic, D.(1998)。A Fuzzy Set Theory Approach to the Aircrew Rostering Problem。Fuzzy Sets and Systems,95,261-271。
4.
Lučić, P.,、Tehdorovic, D.(1999)。Simulated annealing for the multi-objective aircrew rostering problem。Transportation Research,33(1),19-45。
5.
Brusco, M. J.、Jacobs, L. W.(1998)。Elimination Redundant Columns in Continuous Tour Scheduling Problems。European Journal of Operational Research,111,518-525。
6.
Alfares, H. K.(1998)。An Efficient Two-phase Algorithm For Cyclic Days-off Scheduling。Computers Operational Research,25(11),913-923。
7.
Golden, B. L.、Wong, R.(1981)。Capacitated arc routing problems。Networks,11,305-315。
8.
Laporte, G.(1997)。Modeling and solving several classes of arc routing problems as traveling salesman problems。Computers and Operations Research,24,1057-1061。
9.
Chen, C. H.、Ting, C. J.(2006)。An Improved Ant Colony System Algorithm for the Vehicle Routing Problem。Journal of the Chinese Institute of Industrial Engineers,23(2),115-126。
10.
Chaharsooghi, S. Kamal、Kermani, A. H. Meimand(2008)。An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP)。Appl Math Comput,200(1),167-177。
其他
1.
J.E. Beasley and B. Cao(1998)。A dynamic programming based algorithm for the crew scheduling problem。
2.
N. Beaumont(1997)。Scheduling staff using mixed integer programming。
3.
A. Caprara, M. Fischetti, P. Toth, D. Vigo and P.L. Guida(1997)。Algorithms for railway crew management。
4.
S. Ceria, P. Nobili and A. Sassano(1998)。A Lagrangianbased heuristic for large-scale set covering problems。
5.
C.W. Chiang(2009)。Ant colony optimization for VLSI floorplanning with clustering constraints。
6.
W.C. Chiang and R.A. Russell(1996)。Simulated annealing metaheuristics for the vehicle routing problem with time windows。
7.
H.D. Chu, E. Gelman and E.L. Johnson(1997)。Solving large scale crew scheduling problems。
8.
N.C. Demirel and M.D. Toksari(2006)。Optimization of the quadratic assignment problem using an ant colony algorithm。
9.
M. Dror(2000)。Arc Routing: Theory, Solutions and Applications。
10.
L.M. Gambardella, E. Taillard and G. Agazzi(1999)。MACS-VRPTW: a multiple ant colony system for vehicle routing problem with time windows。
11.
A. Haghani and S. Jung(2005)。A dynamic vehicle routing problem with time-dependent travel times。
12.
D. Huisman(2007)。A column generation approach for the rail crew re-scheduling problem。
13.
S. Ichoua, M. Gendreau and J.Y. Potvin(2003)。Vehicle dispatching with time-dependent travel times。
14.
J.K. Lenstra and A.H.G. Rinnooy Kan(1976)。On general routing problems。
15.
B. Maenhout and M. Vanhoucke(2010)。A hybrid scatter search heuristic for personalized crew rostering in the airline industry。
16.
C.P. Medard and N. Sawhney(2007)。Airline crew scheduling from planning to operations。
17.
M. Mesquita and A. Paias(2008)。Set partitioning/ covering-based approaches for the integrated vehicle and crew scheduling problem。
18.
H.T. Ozdemir and C.K. Mohan(2001)。Flight graph based genetic algorithm for crew scheduling in airlines。
19.
C.T. Su, J.T. Wong and S.C. Tsou(2005)。A process parameters determination model by integrating artificial neural network and ant colony optimization。
20.
C.G. Walker, J.N. Snowdon and D.M. Ryan(2005)。Simultaneous disruption recovery of a train timetable and crew roster in real time。
21.
S. Yan, T.H. Yang and H.H. Chen(2004)。Airline shortterm maintenance manpower supply planning。
22.
T.H. Yang, S. Yan and H.H. Chen(2003)。An airline maintenance manpower planning model with flexible strategies。
推文
當script無法執行時可按︰
推文
推薦
當script無法執行時可按︰
推薦
引用網址
當script無法執行時可按︰
引用網址
引用嵌入語法
當script無法執行時可按︰
引用嵌入語法
轉寄
當script無法執行時可按︰
轉寄
top
:::
相關期刊
相關論文
相關專書
相關著作
熱門點閱
無相關期刊論文
無相關博士論文
無相關書籍
無相關著作
1.
The Application of Goal Programming to the Scheduling Problem of the Professional Baseball League
QR Code