中文核心期刊
CSCD来源期刊
中国科技核心期刊
RCCSE中国核心学术期刊

重庆交通大学学报(自然科学版) ›› 2016, Vol. 35 ›› Issue (4): 152-157.DOI: 10.3969/j.issn.1674-0696.2016.04.30

• 交通运输工程 • 上一篇    下一篇

基于集装箱簇的场桥调度模型与算法

梁承姬1,周聪1,鲁渤2   

  1. (1.上海海事大学 科学研究院物流研究中心,上海201306;2.中国科学院大学 管理学院,北京 100190)
  • 收稿日期:2015-11-13 修回日期:2015-12-31 出版日期:2016-08-20 发布日期:2016-08-20
  • 作者简介:第一作者:梁承姬(1970—),女,吉林龙井人,教授,博士,主要从事物流系统运作计划与优化、口岸物流流程模拟与重组等方面的研究。E-mail:liangcj@shmtu.edu.cn。
  • 基金资助:
    国家自然科学基金项目(71471110,71301101,2014M550084)

Model and Algorithm for Yard Crane Scheduling Based on Container Groups

LIANG Chengji1, ZHOU Cong1, LU Bo2   

  1. (1. Logistics Research Center, Scientific Research Academy, Shanghai Maritime University, Shanghai 201306, P.R.China;2. School of Management, University of Chinese Academy of Sciences, Beijing 100190, P.R.China)
  • Received:2015-11-13 Revised:2015-12-31 Online:2016-08-20 Published:2016-08-20

摘要: 为了提高场桥的作业效率,针对带有装卸顺序的集装箱簇,考虑场桥作业时的安全距离和互不跨越等约束条件,建立了场桥装卸完工时间最小为目标函数的混合整数规划模型。并根据问题自身的特点,设计了基于集装箱簇的染色体,用遗传算法进行求解。最后通过数值实验对模型与算法的有效性进行了验证。

关键词: 交通运输工程, 场桥调度, 集装箱簇, 装卸顺序, 安全距离, 遗传算法

Abstract: 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 proved by numerical experiments.

Key words: traffic and transportation engineering, yard crane scheduling, container groups, handling sequence, safe distance, genetic algorithm

中图分类号: