.png){kind=icon}
返回
A multi-objective genetic algorithm for yard crane scheduling problem with multiple work lines
.png){kind=icon}
PRE
AI
DOI：10.1007/s10845-013-0792-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Due to increasing ships and quay cranes, container terminals operations become more and more busy. The traditional handling based on work line is converted into pool strategy, namely loading and unloading containers with multiple work lines are operating simultaneously. In the paper we discuss the yard crane scheduling problem with multiple work lines in container terminals. We develop a multi-objective 0-1 integer programming model considering the minimum total completion time of all yard cranes and the maximization balanced distribution of the completion time at the same time. With the application of adaptive weight GA approach, the problem can be solved by a multi-objective hybrid genetic algorithm and the Pareto solutions can be finally got. Using the compromised approach, the nearest feasible solution to ideal solution is chosen to be the best compromised Pareto optimal solution of the multi-objective model. The numerical example proves the applicability and effectiveness of the proposed method to the multi-objective yard crane scheduling problem.
Keyword:
Yard crane scheduling
Multiple work lines
Multi-objective 0-1 integer programming (MO0-1IP)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.4
论文数:
3.5K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏
查看更多内容