:::

詳目顯示

回上一頁
題名:Ant Colony Optimization for Railway Driver Crew Scheduling: from Modeling to Implementation
書刊名:工業工程學刊
作者:黃山琿 引用關係楊大輝 引用關係王榮祖 引用關係
作者(外文):Huang, Shan-huenYang, Ta-huiWang, Rong-tsu
出版日期:2011
卷期:28:6
頁次:頁437-449
主題關鍵詞:蟻群最佳化演算法時空圖人員排班問題車輛途程問題Ant colony optimizationTime–space diagramCrew scheduling problemEhicle routing problem
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(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。  new window
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。  new window
3.Lucic, P.、Teodorovic, D.(1998)。A Fuzzy Set Theory Approach to the Aircrew Rostering Problem。Fuzzy Sets and Systems,95,261-271。  new window
4.Lučić, P.,、Tehdorovic, D.(1999)。Simulated annealing for the multi-objective aircrew rostering problem。Transportation Research,33(1),19-45。  new window
5.Brusco, M. J.、Jacobs, L. W.(1998)。Elimination Redundant Columns in Continuous Tour Scheduling Problems。European Journal of Operational Research,111,518-525。  new window
6.Alfares, H. K.(1998)。An Efficient Two-phase Algorithm For Cyclic Days-off Scheduling。Computers Operational Research,25(11),913-923。  new window
7.Golden, B. L.、Wong, R.(1981)。Capacitated arc routing problems。Networks,11,305-315。  new window
8.Laporte, G.(1997)。Modeling and solving several classes of arc routing problems as traveling salesman problems。Computers and Operations Research,24,1057-1061。  new window
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。  new window
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。  new window
其他
1.J.E. Beasley and B. Cao(1998)。A dynamic programming based algorithm for the crew scheduling problem。  new window
2.N. Beaumont(1997)。Scheduling staff using mixed integer programming。  new window
3.A. Caprara, M. Fischetti, P. Toth, D. Vigo and P.L. Guida(1997)。Algorithms for railway crew management。  new window
4.S. Ceria, P. Nobili and A. Sassano(1998)。A Lagrangianbased heuristic for large-scale set covering problems。  new window
5.C.W. Chiang(2009)。Ant colony optimization for VLSI floorplanning with clustering constraints。  new window
6.W.C. Chiang and R.A. Russell(1996)。Simulated annealing metaheuristics for the vehicle routing problem with time windows。  new window
7.H.D. Chu, E. Gelman and E.L. Johnson(1997)。Solving large scale crew scheduling problems。  new window
8.N.C. Demirel and M.D. Toksari(2006)。Optimization of the quadratic assignment problem using an ant colony algorithm。  new window
9.M. Dror(2000)。Arc Routing: Theory, Solutions and Applications。  new window
10.L.M. Gambardella, E. Taillard and G. Agazzi(1999)。MACS-VRPTW: a multiple ant colony system for vehicle routing problem with time windows。  new window
11.A. Haghani and S. Jung(2005)。A dynamic vehicle routing problem with time-dependent travel times。  new window
12.D. Huisman(2007)。A column generation approach for the rail crew re-scheduling problem。  new window
13.S. Ichoua, M. Gendreau and J.Y. Potvin(2003)。Vehicle dispatching with time-dependent travel times。  new window
14.J.K. Lenstra and A.H.G. Rinnooy Kan(1976)。On general routing problems。  new window
15.B. Maenhout and M. Vanhoucke(2010)。A hybrid scatter search heuristic for personalized crew rostering in the airline industry。  new window
16.C.P. Medard and N. Sawhney(2007)。Airline crew scheduling from planning to operations。  new window
17.M. Mesquita and A. Paias(2008)。Set partitioning/ covering-based approaches for the integrated vehicle and crew scheduling problem。  new window
18.H.T. Ozdemir and C.K. Mohan(2001)。Flight graph based genetic algorithm for crew scheduling in airlines。  new window
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。  new window
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。  new window
21.S. Yan, T.H. Yang and H.H. Chen(2004)。Airline shortterm maintenance manpower supply planning。  new window
22.T.H. Yang, S. Yan and H.H. Chen(2003)。An airline maintenance manpower planning model with flexible strategies。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE