基于多代理系统的集装箱码头优先级运输操作解决方案

L. Rodrigues, G. Dimuro, A. C. R. Costa, L. Emmendorfer
{"title":"基于多代理系统的集装箱码头优先级运输操作解决方案","authors":"L. Rodrigues, G. Dimuro, A. C. R. Costa, L. Emmendorfer","doi":"10.1109/WESAAC.2011.13","DOIUrl":null,"url":null,"abstract":"This paper proposes the use of a multiagent system-based solution for a proposed robotic-based automation system for the shipment operations of containers with shipment priorities in the port terminal located in Rio Grande City, Brazil. We faced with a problem of optimal policy formulation for teams of resource-limited robotic loaders in stochastic environments, which is composed of two strongly-coupled sub problems: a resource allocation problem and a policy optimization problem. The containers are required to be shared between the loaders, considering the following constraints: the containers have different weights and shipment priorities, the loaders have a maximum load that they can support during a journey, and, due to several reasons (e.g: administrative rules, maintenance schedule), the loaders are made available to the shipping operation only sequentially. We show how to combine the two problems, by formulating a policy optimization problem over the loading/unloading operations for each loader, as it becomes available. To solve the problem of container allocation to the next available loader we use a reduction of the Knapsack Problem. Then, we use Markov Decision Processes to decide on the shipment operations preformed by that loader in the terminal yard. These two processes are connected, since the container allocation process determines the states of the Markov chain that each loader actually visits. We simulated the resulting shipment operations using Net Logo.","PeriodicalId":365578,"journal":{"name":"2011 Workshop and School of Agent Systems, their Environment and Applications","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Multiagent System-Based Solution for Shipment Operations with Priorities in a Container Terminal\",\"authors\":\"L. Rodrigues, G. Dimuro, A. C. R. Costa, L. Emmendorfer\",\"doi\":\"10.1109/WESAAC.2011.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes the use of a multiagent system-based solution for a proposed robotic-based automation system for the shipment operations of containers with shipment priorities in the port terminal located in Rio Grande City, Brazil. We faced with a problem of optimal policy formulation for teams of resource-limited robotic loaders in stochastic environments, which is composed of two strongly-coupled sub problems: a resource allocation problem and a policy optimization problem. The containers are required to be shared between the loaders, considering the following constraints: the containers have different weights and shipment priorities, the loaders have a maximum load that they can support during a journey, and, due to several reasons (e.g: administrative rules, maintenance schedule), the loaders are made available to the shipping operation only sequentially. We show how to combine the two problems, by formulating a policy optimization problem over the loading/unloading operations for each loader, as it becomes available. To solve the problem of container allocation to the next available loader we use a reduction of the Knapsack Problem. Then, we use Markov Decision Processes to decide on the shipment operations preformed by that loader in the terminal yard. These two processes are connected, since the container allocation process determines the states of the Markov chain that each loader actually visits. We simulated the resulting shipment operations using Net Logo.\",\"PeriodicalId\":365578,\"journal\":{\"name\":\"2011 Workshop and School of Agent Systems, their Environment and Applications\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Workshop and School of Agent Systems, their Environment and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WESAAC.2011.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Workshop and School of Agent Systems, their Environment and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WESAAC.2011.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文建议使用基于多代理系统的解决方案,为巴西大城市里约热内卢港口码头的集装箱运输操作提供基于机器人的自动化系统。研究了随机环境下资源有限的装载机机器人团队的最优策略制定问题,该问题由资源分配问题和策略优化问题两个强耦合子问题组成。考虑到以下限制,集装箱需要在装载机之间共享:集装箱具有不同的重量和运输优先级,装载机在旅途中可以支持的最大负载,并且由于一些原因(例如:管理规则,维护计划),装载机只能顺序地用于运输操作。我们将展示如何结合这两个问题,方法是在每个加载器可用时,针对加载/卸载操作制定一个策略优化问题。为了解决集装箱分配给下一个可用装载器的问题,我们使用了对背包问题的简化。然后,我们使用马尔可夫决策过程来决定该装载机在码头堆场进行的装运操作。这两个进程是相连的,因为容器分配进程决定了每个加载器实际访问的马尔可夫链的状态。我们使用Net Logo模拟了最终的装运操作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Multiagent System-Based Solution for Shipment Operations with Priorities in a Container Terminal
This paper proposes the use of a multiagent system-based solution for a proposed robotic-based automation system for the shipment operations of containers with shipment priorities in the port terminal located in Rio Grande City, Brazil. We faced with a problem of optimal policy formulation for teams of resource-limited robotic loaders in stochastic environments, which is composed of two strongly-coupled sub problems: a resource allocation problem and a policy optimization problem. The containers are required to be shared between the loaders, considering the following constraints: the containers have different weights and shipment priorities, the loaders have a maximum load that they can support during a journey, and, due to several reasons (e.g: administrative rules, maintenance schedule), the loaders are made available to the shipping operation only sequentially. We show how to combine the two problems, by formulating a policy optimization problem over the loading/unloading operations for each loader, as it becomes available. To solve the problem of container allocation to the next available loader we use a reduction of the Knapsack Problem. Then, we use Markov Decision Processes to decide on the shipment operations preformed by that loader in the terminal yard. These two processes are connected, since the container allocation process determines the states of the Markov chain that each loader actually visits. We simulated the resulting shipment operations using Net Logo.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信