Ant colony system for solving Quay Crane Scheduling Problem in container terminal

A. Lajjam, M. E. Merouani, A. Medouri
{"title":"Ant colony system for solving Quay Crane Scheduling Problem in container terminal","authors":"A. Lajjam, M. E. Merouani, A. Medouri","doi":"10.1109/GOL.2014.6887437","DOIUrl":null,"url":null,"abstract":"The Quay Crane Scheduling Problem (QCSP) is one of the most important issues treated in container terminals because of its influence on the efficiency of port. The main goal behind this planning problem is to find the handling sequence of tasks at ship bays by a set of cranes assigned to a container vessel such that the time spent by vessels at berth is minimized. This study focused on optimizing quay crane scheduling in port container terminal to enhance their efficiency. So we provide a mixed-integer programming (MIP) model that takes into account non-crossing constraints, safety margin constraints and precedence constraints. To give a solution to this problem, we used a probabilistic technique for solving computational problems; this optimization methodology based on ant behaviors is named the Ant Colony Optimization (ACO).","PeriodicalId":265851,"journal":{"name":"2014 International Conference on Logistics Operations Management","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Logistics Operations Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GOL.2014.6887437","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

The Quay Crane Scheduling Problem (QCSP) is one of the most important issues treated in container terminals because of its influence on the efficiency of port. The main goal behind this planning problem is to find the handling sequence of tasks at ship bays by a set of cranes assigned to a container vessel such that the time spent by vessels at berth is minimized. This study focused on optimizing quay crane scheduling in port container terminal to enhance their efficiency. So we provide a mixed-integer programming (MIP) model that takes into account non-crossing constraints, safety margin constraints and precedence constraints. To give a solution to this problem, we used a probabilistic technique for solving computational problems; this optimization methodology based on ant behaviors is named the Ant Colony Optimization (ACO).
蚁群系统求解集装箱码头码头起重机调度问题
码头起重机调度问题是集装箱码头处理的重要问题之一,它直接关系到港口的效率。该规划问题的主要目标是找到分配给集装箱船舶的一组起重机在船舶码头的任务处理顺序,从而使船舶在泊位上花费的时间最小化。本文主要研究港口集装箱码头码头起重机调度的优化问题,以提高码头起重机的效率。为此,提出了一种考虑非交叉约束、安全裕度约束和优先约束的混合整数规划模型。为了解决这个问题,我们使用了一种概率技术来解决计算问题;这种基于蚁群行为的优化方法被称为蚁群优化(ant Colony optimization, ACO)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信