物流中心最大覆盖多目标优化信息融合及其应用

IF 0.9 Q4 MANAGEMENT
Xiaoya Deng
{"title":"物流中心最大覆盖多目标优化信息融合及其应用","authors":"Xiaoya Deng","doi":"10.4018/ijisscm.287865","DOIUrl":null,"url":null,"abstract":"From past the development direction of logistics centers covering problem, the main solution is almost always relying on modern computer and gradually developed intelligent algorithm, at the same time, the previous understanding of dynamic covering location model is not \"dynamic\", in order to improve the unreasonable distribution of logistics centers deployment time, improve the service coverage, coverage as the optimization goal to logistics centers, logistics centers as well as each one can be free to move according to certain rules of \"dot\", according to the conditions set by the site moved to a more reasonable. The innovation of all algorithms in this paper lies in that the logistics centers themselves are regarded as the subject of free \"activities\", and they are allowed to move freely according to these rules by setting certain moving rules. Simulation results show that the algorithm has good coverage effect and can meet the requirements of logistics centers for coverage effect.","PeriodicalId":44506,"journal":{"name":"International Journal of Information Systems and Supply Chain Management","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Multi-Objective Optimization Information Fusion and Its Applications for Logistics Centers Maximum Coverage\",\"authors\":\"Xiaoya Deng\",\"doi\":\"10.4018/ijisscm.287865\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"From past the development direction of logistics centers covering problem, the main solution is almost always relying on modern computer and gradually developed intelligent algorithm, at the same time, the previous understanding of dynamic covering location model is not \\\"dynamic\\\", in order to improve the unreasonable distribution of logistics centers deployment time, improve the service coverage, coverage as the optimization goal to logistics centers, logistics centers as well as each one can be free to move according to certain rules of \\\"dot\\\", according to the conditions set by the site moved to a more reasonable. The innovation of all algorithms in this paper lies in that the logistics centers themselves are regarded as the subject of free \\\"activities\\\", and they are allowed to move freely according to these rules by setting certain moving rules. Simulation results show that the algorithm has good coverage effect and can meet the requirements of logistics centers for coverage effect.\",\"PeriodicalId\":44506,\"journal\":{\"name\":\"International Journal of Information Systems and Supply Chain Management\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2022-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Information Systems and Supply Chain Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/ijisscm.287865\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MANAGEMENT\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Information Systems and Supply Chain Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/ijisscm.287865","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 2

摘要

从过去物流中心覆盖问题的发展方向来看,主要解决方案几乎总是依靠现代计算机和逐渐发展起来的智能算法,同时,以往对动态覆盖区位模型的理解并不是“动态的”,为了改善物流中心不合理的布局部署时间,提高服务覆盖范围,将覆盖范围作为物流中心的优化目标,物流中心以及每一个都可以按照一定的规则自由移动“点”,根据场地设定的条件进行更合理的移动。本文所有算法的创新之处在于将物流中心本身视为自由“活动”的主体,通过设定一定的移动规则,允许物流中心按照这些规则自由移动。仿真结果表明,该算法具有良好的覆盖效果,能够满足物流中心对覆盖效果的要求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-Objective Optimization Information Fusion and Its Applications for Logistics Centers Maximum Coverage
From past the development direction of logistics centers covering problem, the main solution is almost always relying on modern computer and gradually developed intelligent algorithm, at the same time, the previous understanding of dynamic covering location model is not "dynamic", in order to improve the unreasonable distribution of logistics centers deployment time, improve the service coverage, coverage as the optimization goal to logistics centers, logistics centers as well as each one can be free to move according to certain rules of "dot", according to the conditions set by the site moved to a more reasonable. The innovation of all algorithms in this paper lies in that the logistics centers themselves are regarded as the subject of free "activities", and they are allowed to move freely according to these rules by setting certain moving rules. Simulation results show that the algorithm has good coverage effect and can meet the requirements of logistics centers for coverage effect.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.90
自引率
43.80%
发文量
59
期刊介绍: The International Journal of Information Systems and Supply Chain Management (IJISSCM) provides a practical and comprehensive forum for exchanging novel research ideas or down-to-earth practices which bridge the latest information technology and supply chain management. IJISSCM encourages submissions on how various information systems improve supply chain management, as well as how the advancement of supply chain management tools affects the information systems growth. The aim of this journal is to bring together the expertise of people who have worked with supply chain management across the world for people in the field of information systems.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信