具有实际约束的设施选址层次聚类框架

IF 1.7 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS IET Cyber-Physical Systems: Theory and Applications Pub Date : 2021-08-08 DOI:10.1049/cps2.12021
Tianze Lin, Yang Liu, Boyang Liu, Yu Wang, Shengnan Wu, Wenming Zhe
{"title":"具有实际约束的设施选址层次聚类框架","authors":"Tianze Lin,&nbsp;Yang Liu,&nbsp;Boyang Liu,&nbsp;Yu Wang,&nbsp;Shengnan Wu,&nbsp;Wenming Zhe","doi":"10.1049/cps2.12021","DOIUrl":null,"url":null,"abstract":"<p>Facility location selection plays a critical role in the planning of logistics networks. It selects the addresses of facility nodes from a candidate set of locations to optimise multiple targets such as transportation efficiency and economic cost considering the practical constraints of the real world. Thus, it is often formulated as a combinational optimisation problem, which is solved by either mixed integer programing algorithms or heuristic methods. However, these approaches are limited by several issues such as a high computational cost and weak generalisation flexibility. In this work, a novel hierarchical clustering framework is proposed for facility location selection, which can flexibly support a wide variety of optimisation targets and the combinations of multiple practical constraints that are vital in the real logistics scenarios. Beyond the original hierarchical clustering algorithm, it incorporates a looking-forward mechanism that alleviates the ‘greedy trap’ by utilising global information. These advantages enable the proposed method to generate reliable solutions with high time efficiency. As demonstrated by the experimental results on real JD Logistics data, the proposed method outperforms the widely adopted GGA and VNS algorithms. It also has a much lower computation cost compared to the SCIP solver, while the quality of solutions are within an acceptable range.</p>","PeriodicalId":36881,"journal":{"name":"IET Cyber-Physical Systems: Theory and Applications","volume":null,"pages":null},"PeriodicalIF":1.7000,"publicationDate":"2021-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/cps2.12021","citationCount":"2","resultStr":"{\"title\":\"Hierarchical clustering framework for facility location selection with practical constraints\",\"authors\":\"Tianze Lin,&nbsp;Yang Liu,&nbsp;Boyang Liu,&nbsp;Yu Wang,&nbsp;Shengnan Wu,&nbsp;Wenming Zhe\",\"doi\":\"10.1049/cps2.12021\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Facility location selection plays a critical role in the planning of logistics networks. It selects the addresses of facility nodes from a candidate set of locations to optimise multiple targets such as transportation efficiency and economic cost considering the practical constraints of the real world. Thus, it is often formulated as a combinational optimisation problem, which is solved by either mixed integer programing algorithms or heuristic methods. However, these approaches are limited by several issues such as a high computational cost and weak generalisation flexibility. In this work, a novel hierarchical clustering framework is proposed for facility location selection, which can flexibly support a wide variety of optimisation targets and the combinations of multiple practical constraints that are vital in the real logistics scenarios. Beyond the original hierarchical clustering algorithm, it incorporates a looking-forward mechanism that alleviates the ‘greedy trap’ by utilising global information. These advantages enable the proposed method to generate reliable solutions with high time efficiency. As demonstrated by the experimental results on real JD Logistics data, the proposed method outperforms the widely adopted GGA and VNS algorithms. It also has a much lower computation cost compared to the SCIP solver, while the quality of solutions are within an acceptable range.</p>\",\"PeriodicalId\":36881,\"journal\":{\"name\":\"IET Cyber-Physical Systems: Theory and Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2021-08-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/cps2.12021\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET Cyber-Physical Systems: Theory and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1049/cps2.12021\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Cyber-Physical Systems: Theory and Applications","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/cps2.12021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 2

摘要

设施选址在物流网络规划中起着至关重要的作用。考虑到现实世界的实际约束,它从候选地点集中选择设施节点的地址,以优化运输效率和经济成本等多个目标。因此,它通常被表述为一个组合优化问题,通过混合整数规划算法或启发式方法来解决。然而,这些方法受到计算成本高和泛化灵活性弱等问题的限制。在这项工作中,提出了一种新的分层聚类框架,用于设施选址,该框架可以灵活地支持各种优化目标和多种实际约束的组合,这些约束在实际物流场景中至关重要。在原有的分层聚类算法的基础上,它结合了一种前瞻性机制,通过利用全局信息来缓解“贪婪陷阱”。这些优点使所提出的方法能够生成可靠的解,并且具有较高的时间效率。在JD物流实际数据上的实验结果表明,该方法优于目前广泛采用的GGA和VNS算法。与SCIP求解器相比,它的计算成本要低得多,而解的质量在可接受的范围内。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Hierarchical clustering framework for facility location selection with practical constraints

Facility location selection plays a critical role in the planning of logistics networks. It selects the addresses of facility nodes from a candidate set of locations to optimise multiple targets such as transportation efficiency and economic cost considering the practical constraints of the real world. Thus, it is often formulated as a combinational optimisation problem, which is solved by either mixed integer programing algorithms or heuristic methods. However, these approaches are limited by several issues such as a high computational cost and weak generalisation flexibility. In this work, a novel hierarchical clustering framework is proposed for facility location selection, which can flexibly support a wide variety of optimisation targets and the combinations of multiple practical constraints that are vital in the real logistics scenarios. Beyond the original hierarchical clustering algorithm, it incorporates a looking-forward mechanism that alleviates the ‘greedy trap’ by utilising global information. These advantages enable the proposed method to generate reliable solutions with high time efficiency. As demonstrated by the experimental results on real JD Logistics data, the proposed method outperforms the widely adopted GGA and VNS algorithms. It also has a much lower computation cost compared to the SCIP solver, while the quality of solutions are within an acceptable range.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IET Cyber-Physical Systems: Theory and Applications
IET Cyber-Physical Systems: Theory and Applications Computer Science-Computer Networks and Communications
CiteScore
5.40
自引率
6.70%
发文量
17
审稿时长
19 weeks
期刊最新文献
Guest Editorial: IoT-based secure health monitoring and tracking through estimated computing SEIR-driven semantic integration framework: Internet of Things-enhanced epidemiological surveillance in COVID-19 outbreaks using recurrent neural networks A machine learning model for Alzheimer's disease prediction Securing the Internet of Medical Things with ECG-based PUF encryption Status, challenges, and promises of data-driven battery lifetime prediction under cyber-physical system context
×
引用
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