期刊文献+

集卡动态调度路径优化算法 被引量:18

Path optimization algorithm of dynamic scheduling for container truck
原文传递
导出
摘要 从整体调度的角度出发,分析了整个码头作业面的动态调度方案,提出了一种新的集装箱卡车(集卡)动态调度路径的自适应蚁群算法。运用码头GPRS系统,以集卡速度、流量、位置等相关数据建立了感知链。通过判断阻塞状况和调整可行点集,确定了信息素浓度更新策略与转移概率计算方法。针对码头路网的复杂性和蚁群算法的实时计算效率,设计了蚁群算法的步骤。将信息熵引入到蚁群算法中,运用MATLAB软件,对集卡的动态调度方案进行了仿真计算。计算结果表明:当初始集卡速度分别为50、75km.h-1,初始集卡流量分别为800、1 000veh.h-1时,集卡行驶的最短路径为4.3km,行驶时间为0.057h;集卡行驶的最优路径为8.3km,行驶时间为0.111h。可见,该算法能有效缓解码头阻塞问题,提高集卡利用率和码头作业效率。 From the point of integrated scheduling, the dynamic scheduling method of whole terminal operating field was analyzed, and a new adaptive ant colony optimization of dynamic scheduling for container truck was put out. The GPRS system of terminal was used, and the perception chain was set up by using related data such as the speed, flow and position of container truck. Through judging obstruction status and adjusting feasible point set, the calculation methods of updating strategy and transition probability for pheromone concentration were determined. Aiming at the complexity of terminal road network and the real-time calculation efficiency of ant colony optimization, the steps of ant colony optimization were designed. The information entropy was introduced into ant colony optimization, the MATLAB software was used, and the simulation calculation of dynamic scheduling method for container truck was carried out. Simulation result shows that when the initial speeds of container trucks are 50, 75 km · h^-1 respectively and the initial flows of container trucks are 800, 1 000 veh · h^-1 respectively, the shortest driving path of container truck is 4.3 km, and the driving time is 0. 057 h. The optimal driving path of container truck is 8.3 km, and the driving time is 0. 111 h. By using the proposed algorithm, the obstruction problem of terminal can be remitted effectively, and the utilization ratio of container truck and the operating efficiency of terminal can increase obviously. 3 tabs, 2 figs, 16 refs.
出处 《交通运输工程学报》 EI CSCD 北大核心 2012年第3期86-91,共6页 Journal of Traffic and Transportation Engineering
基金 "十一五"国家科技支撑计划项目(2009BAG18B03) 中央高校基本科研业务费专项资金项目(2009QN013)
关键词 港口运输 码头调度 集卡分配 最优路径 蚁群算法 信息熵 port transportation terminal scheduling container truck allocation optimal path ant colony optimization information entropy
  • 相关文献

参考文献16

二级参考文献37

  • 1刘志硕,申金升.基于解均匀度的车辆路径问题的自适应蚁群算法[J].系统仿真学报,2005,17(5):1079-1083. 被引量:21
  • 2李志威,张旭梅.基于动态扫描和蚂蚁算法的物流配送网络优化研究[J].管理工程学报,2006,20(4):9-12. 被引量:10
  • 3CHRISTIANSEN M, FAGERHOLT K, RONEN D. Ship routing and scheduling: status and perspectives[J]. Transportation Science, 2004, 38(1): 1-18.
  • 4DANIEL A. Routing andscheduling with time windows: models and algorithms for tramp sea cargos and rail car blocks[D]. Atlanta: Georgia Institute of Technology, 2006.
  • 5TINGS C, TZENG G H. Ship scheduling and cost analysis for route planning in liner ahipping[J]. Maritime Economics and Logistics, 2008, 5(4): 378-392.
  • 6A.GARWAL R, ERGUN O. Skip scheduling artd network design for cargo routing in liner shipping [J]. Transportation Science, 2008, 42(2) : 175-196.
  • 7YAN Shang-yao, CHEN C Y, LIN S C. Ship scheduling and container shipment planning for liners in short-term operations[J]. Journal of Marine Science and Technology, 2009, 14(4) : 417-435.
  • 8DORIGO M, DI CARO G, GAMBARDELLA L M. Ant algorithms for discrete optimization[J]. Artificial Life, 1999, 5(2): 137-172.
  • 9CHIRA C, PINTEA C M, DUMITRESCU D. An agent- based approach to combinatorial optimization[J]. International Journal of Computers, Communications and Control, 2008, 3(S): 212-217.
  • 10DORIGO M, BLUM C. Ant colony optimization theory: a survey[J]. Theoretical Computer Science, 2005, 344 (2/3) : 243-278.

共引文献71

同被引文献125

引证文献18

二级引证文献75

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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