期刊文献+

基于蚁群算法的集装箱堆场起重机优化调度 被引量:2

Crane Scheduling in Container Yards Based on Ant Colony Optimization Algorithm
下载PDF
导出
摘要 集装箱堆场起重机(场桥)优化调度是在确定场桥配置数量的基础上,对场桥进行任务分派,使得场桥的行走时间最短。通过动态地调整信息素更新方式、限制信息表的范围来克服蚁群算法容易停滞的缺点。利用改进的蚁群算法对场桥的任务调度问题进行了探讨,并实现了求解。仿真结果表明,蚁群算法求解场桥调度问题时,得到了较好的结果,提高了场桥的工作效率。 The scheduling in container yards is a key step for container terminal.The pheromone is updated dynamically and restricted to averting precocity and stagnation in ant colon algorithm.It is required that some cranes should cooperate with other resources to finish the work of container yard.The application of a modified ant colony optimization here yields exact solutions,that is,the algorithm can construct solutions for crane scheduling efficiently and reduce some of the terminal cost.It is also instructive to study port logistics in the future.
出处 《控制工程》 CSCD 北大核心 2009年第S2期135-138,共4页 Control Engineering of China
基金 上海市教委科研创新重点基金资助项目(08ZZ78) 上海市教委重点学科建设基金资助项目(J50602)
关键词 集装箱堆场 起重机 调度 蚁群算法 container yards crane scheduling ant colony algorithm
  • 相关文献

参考文献8

  • 1刘哲,李建国.基于带时间窗口车辆路径问题的蚁群算法[J].控制工程,2006,13(2):127-129. 被引量:10
  • 2韩晓龙.集装箱港口龙门吊的最优路径问题[J].上海海事大学学报,2005,26(2):39-41. 被引量:24
  • 3Kim K H,Kim K Y.An optimal routing algorithm for a transfer crane in port container terminals. Transportation Science . 1999
  • 4Ebru K,Bish.A multiple-crane-constrained scheduling problem in a container terminal. European Journal of Operational Research . 2003
  • 5Kap-Hwan Kim,Young-Man Park.A crane scheduling method for port container terminals. European Journal of Operational Research . 2004
  • 6Ng W C,Mak K L.Yard crane scheduling in port container terminals. Journal of Applied Mathematics . 2005
  • 7Richard Linn,,Chuqian Zhang.A heuristic for dynamicyard crane deployment in a container terminal. IEEtransactions . 2003
  • 8DORIGO M,GAMBARDELLA LM.Ant colony system:a cooperative learning approach to the traveling salesman problem. IEEE Trans on Ev-olutionary Computation . 1997

二级参考文献11

  • 1NARASIMHAN A. Analysis and algorithm for transtainer routing problem in container port operation [ J ]. Transportation Science,2002,36 (1): 63 -78.
  • 2马振华.现代应用数学手册--运筹学与最优化理论卷[M].北京:清华大学出版社,1998..
  • 3CHUNG Y G, RANDHAWA S U, MCDOWELL E D. A simulation analysis for a transtainer-based container handling facility [ J ].Computers and Industrial Engineering, 1985, 14 ( 2 ): 113 - 125.
  • 4KAP H K. An optimal routing algorithm for a transfer crane in port container terminals [ J ]. Transportation Science , 1999,33 ( 1 ): 17-33.
  • 5Taillard D,Badeau P,Gendreau M F,et al.Atabusearch heuristic for the vehicle routing problem with soft time windows[J].Transportation Science,1997,31(2):170-186.
  • 6GambardellaLM,Taillard E D,AgazziG.MACS-VRPTW:a multiple ant colony system for vehicle routing problems with time windows[A].In Corne D,Dorigo M,Glover F.New Ideas in Optimization[C].London:McGraw Hill,1999.
  • 7Dorigo M,Stutzle T.Ant colony optimization[M].Cambridge,Massachusetts,Lodon:MIT Press,2004.
  • 8Changchien W S,Wu C S.An ant colony system for vehicle routing problems with time window[A].Proceedings of the Seventh Conference on Artificial Intelligence and Applications[C].Taiwan:TAAI2002,C6-1,2002.
  • 9Chiang W C,Russell R A.A reactive tabu search metaheuristic for the vehicle routing problem with time windows[J].INFORMS Journal on Computing,1997,9:417-430.
  • 10Rochat Y,Taillard E.Probabilistic diversification and intensification in local search for vehicle routing[J].Journal of Heuristic,1995,(1):147-167.

共引文献32

同被引文献16

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部