摘要
为了提高场桥的作业效率,针对带有装卸顺序的集装箱簇,考虑场桥作业时的安全距离和互不跨越等约束条件,建立了场桥装卸完工时间最小为目标函数的混合整数规划模型。并根据问题自身的特点,设计了基于集装箱簇的染色体,用遗传算法进行求解。最后通过数值实验对模型与算法的有效性进行了验证。
To improve the operation efficiency of yard crane, considering such constraints of compulsory safety distance and forbidden intercrossing in case of the handling of container group, for the purpose of the container group under handling order, a MIP model was established for yard crane scheduling problem in order to minimize the operation time of container groups subject to handling sequence during the fixed span. According to the characteristics of the problem, a genetic algorithm was developed and the chromosome representation was structured on the handling sequence of container groups. Finally, the MIP model and solution algorithm were oroved by numerical experiments.
出处
《重庆交通大学学报（自然科学版）》
CAS
北大核心
2016年第4期152-157,共6页
Journal of Chongqing Jiaotong University(Natural Science)
基金
国家自然科学基金项目(71471110
71301101
2014M550084)
关键词
交通运输工程
场桥调度
集装箱簇
装卸顺序
安全距离
遗传算法
traffic and transportation engineering
yard crane scheduling
container groups
handling sequence
safe distance
genetic algorithm
