检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]大连海事大学交通运输管理学院,辽宁大连116026
出 处:《交通运输系统工程与信息》2012年第1期153-159,共7页Journal of Transportation Systems Engineering and Information Technology
基 金:国家自然科学基金资助(71072081)
摘 要:所谓混堆模式下集装箱堆场箱位指派问题,是指混堆模式下,在待作业箱区为已知情况的前提下,确定集装箱在指定箱区中的最优堆存位置,以最大限度地控制堆场倒箱率,提高堆场装卸作业效率.在滚动式计划的基础上,充分考虑了不同作业箱型与倒箱作业的内在联系,依据堆场混堆的作业规则定义了作业箱优先等级,以新增集装箱压箱数最小为目标对此问题构建了箱位指派优化模型,基于问题自身的特点设计了相应的启发式算法进行求解,通过实际算例进行验证.验证结果表明,该模型及算法比港口现有混堆堆存策略有较大改进.This study focuses on the container slot allocation problem with the mixed storage mode. To assign containers to the optimum positions of the loading yards, the optimized allocation aims at reducing the container relocation rate and enhancing the loading efficiency. The inner-relationship between container types and the relocation operation are examined in this paper. The containers' processing priority is defined according to rolling plan and rules of mixed storage yards. The container slot allocation model is then developed to minimize the newly-added numbers of those stacked containers. The heuristic algorithm is adopted to solve this model based on the characteristics of this kind of problem. The experiment shows that the optimization model and algorithm are more effective than the current original storage planning in container yards.
分 类 号:U693.7[交通运输工程—港口、海岸及近海工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3