新丝绸之路交通物流中心设计中的高效信息通信技术

Zh. Ismailov, D. Kononov, M. Furugyan
{"title":"新丝绸之路交通物流中心设计中的高效信息通信技术","authors":"Zh. Ismailov, D. Kononov, M. Furugyan","doi":"10.1109/AICT50176.2020.9368751","DOIUrl":null,"url":null,"abstract":"Problems of planning the execution of a set of jobs arising during the design and operation of backbone networks and transport and logistics centers are considered. This problem is formalized as the problem of finding the best schedule in a multi-agent system. Various options of problems of job planning and correction of deadlines depending on available throughput and processing capabilities are considered (all jobs are non-preemptive; all jobs allow interruptions and switching from one machine to another; part of jobs allows interruptions and switching, and part does not allow; in addition to machines non-renewable resource is also used). The mathematical solution is based on the reduction of incoming and outgoing flows to transport and logistics centers with a minimum cost in the backbone network. The areas of using the obtained results in the design systems of transport and logistics centers are proposed.","PeriodicalId":136491,"journal":{"name":"2020 IEEE 14th International Conference on Application of Information and Communication Technologies (AICT)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Efficient Information and Communication Technologies in the Design of Transport and Logistics Centers of the New Silk Road\",\"authors\":\"Zh. Ismailov, D. Kononov, M. Furugyan\",\"doi\":\"10.1109/AICT50176.2020.9368751\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Problems of planning the execution of a set of jobs arising during the design and operation of backbone networks and transport and logistics centers are considered. This problem is formalized as the problem of finding the best schedule in a multi-agent system. Various options of problems of job planning and correction of deadlines depending on available throughput and processing capabilities are considered (all jobs are non-preemptive; all jobs allow interruptions and switching from one machine to another; part of jobs allows interruptions and switching, and part does not allow; in addition to machines non-renewable resource is also used). The mathematical solution is based on the reduction of incoming and outgoing flows to transport and logistics centers with a minimum cost in the backbone network. The areas of using the obtained results in the design systems of transport and logistics centers are proposed.\",\"PeriodicalId\":136491,\"journal\":{\"name\":\"2020 IEEE 14th International Conference on Application of Information and Communication Technologies (AICT)\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 14th International Conference on Application of Information and Communication Technologies (AICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AICT50176.2020.9368751\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 14th International Conference on Application of Information and Communication Technologies (AICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICT50176.2020.9368751","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

考虑了骨干网络和运输物流中心的设计和运营过程中出现的一系列工作的规划执行问题。这个问题形式化为在多智能体系统中寻找最佳调度的问题。根据可用的吞吐量和处理能力,考虑了作业规划和修正截止日期问题的各种选择(所有作业都是非抢占式的;所有的工作都允许中断和从一台机器切换到另一台机器;部分工作允许中断和切换,部分不允许;除了机器,不可再生资源也被使用)。数学解决方案是基于在骨干网中以最小的成本减少运输和物流中心的进出流量。提出了在运输和物流中心设计系统中使用所得结果的领域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Efficient Information and Communication Technologies in the Design of Transport and Logistics Centers of the New Silk Road
Problems of planning the execution of a set of jobs arising during the design and operation of backbone networks and transport and logistics centers are considered. This problem is formalized as the problem of finding the best schedule in a multi-agent system. Various options of problems of job planning and correction of deadlines depending on available throughput and processing capabilities are considered (all jobs are non-preemptive; all jobs allow interruptions and switching from one machine to another; part of jobs allows interruptions and switching, and part does not allow; in addition to machines non-renewable resource is also used). The mathematical solution is based on the reduction of incoming and outgoing flows to transport and logistics centers with a minimum cost in the backbone network. The areas of using the obtained results in the design systems of transport and logistics centers are proposed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Blockchain-based open infrastructure for URL filtering in an Internet browser 2D Amplitude-Only Microwave Tomography Algorithm for Breast-Cancer Detection Information Extraction from Arabic Law Documents An Experimental Design Approach to Analyse the Performance of Island-Based Parallel Artificial Bee Colony Algorithm Automation Check Vulnerabilities Of Access Points Based On 802.11 Protocol
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1