设为首页 |  加入收藏
首页期刊介绍编 委 会投稿须知稿 约征订启事合作办刊联系我们English
 
拥堵集装箱堆场箱位分配优化模型与算法
作者:江南 余宏志 谭周提 
单位:中南大学 交通运输工程学院, 湖南 长沙410075
关键词:集装箱  存储分配  箱位分配  堆场  货场 
分类号:
出版年·卷·期(页码):2011·33·第11期(0-)
摘要:

 

拥堵型集装箱堆场中,寻求最佳箱位分配的理论及实现方法,使得倒箱作业尽量减少。针对堆场场地紧张和大部分箱属于零散货主或零散去向情况,设计箱码垛模型。该模型能有效减少异类箱叠压现象,同时充分利用堆场空间。设计堆场箱存储结构及码箱取箱算法,前者解决箱分类问题,后者则提供码垛模型具体应用的方法。随机全序解决了大点箱问题,使得箱及箱位的使用均衡。设计算法解决堆场碎片问题,为堆场作业空闲时段进行堆场整理提供方法。算例表明:码箱取箱算法能够充分实现箱码垛模型的目标,结果符合人们传统管理思维方式,即:追求同类箱尽可能码垛在一起;多种异类箱叠压时,同类箱尽量聚在一起;被压住的异类箱种类尽可能少。

 

The research is to find the theory and method of optimal storage allocation in a jammed container yard in order to minimize re-shuffling. To cope with the intense situation of the container yard and most containers being of many small shippers and cargo, the container laying model was designed, which could reduce heterogeneous containers overlapping and make full use of the yard space. The container storage structure and the algorithms of fetching and laying containers were designed, the former solved the container classification problem and the later proposed a method for application of the container laying model. The stochastic total order solved the problem of long-term containers, thus balancing the usage of containers and the yard space. The algorithm was designed for yard fragments, which provided a method for merger between yard fragments during idle time of yard. Numerical runs show that the algorithms of fetching and laying containers can best realize the goal of the container laying model and the result tallies with traditional human management ideas, that is to say, homogeneous containers are stored together as far as possible and when heterogeneous containers are being piled up, homogeneous containers are tried to be stored together and the smallest number of types of heterogeneous containers are buried.
参考文献:
服务与反馈:
文章下载】【发表评论】【查看评论】【加入收藏
提示:您还未登录,请登录!点此登录
 
友情链接   更多

地址:北京复兴路10号  中国铁道学会《铁道学报》编辑部    邮编:100844      电话:(010)51848021 / 51847501 
传真:(010)51892424       邮箱:tdxb@vip.163.com   京ICP备09031577号