巢湖学院学报 ›› 2019, Vol. 21 ›› Issue (6): 51-58.doi: 10.12152/j.issn.1672-2868.2019.06.007
• 数理科学 • 上一篇 下一篇
安徽师范大学 数学与统计学院，安徽 芜湖 241002
收稿日期:
出版日期:
发布日期:
通讯作者:
作者简介:
基金资助:
School of Mathematics & Statistics, Anhui Normal University, Wuhu Anhui 241002
Received:
Online:
Published:
Contact:
About author:
摘要： 本研究以合肥市二环及周边区域的数据为例，通过构建集合覆盖模型并采用贪心算法求解出了地下物流系统网络节点的分布。对比以前通过0-1 整数规划算法求解出的网络节点分布，研究成果更符合实际情况。
关键词: 城市地下物流系统, 网络节点, 集合覆盖模型, 贪心算法
Abstract: In this paper, we solve the network nodes of underground logistics system by constructing a set coverage model and using greedy algorithm based on the data of Hefei忆s Second Ring and its surrounding areas. By comparing with the results from the 0-1 integer programming algorithm, these results are more in accordance with the real situation.
Key words: urban underground logistics system, network node, set coverage model, greedy algorithm
中图分类号:
方龙祥, 于雪雨. 基于贪心算法的城市地下物流系统网络节点选址[J]. 巢湖学院学报, 2019, 21(6): 51-58.
FANG Long-xiang, YU Xue-yu. The Choice of Network Nodes of Urban Underground Logistics System Based on Greedy Algorithm[J]. Journal of Chaohu University, 2019, 21(6): 51-58.
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: http://xb.chu.edu.cn/CN/10.12152/j.issn.1672-2868.2019.06.007
http://xb.chu.edu.cn/CN/Y2019/V21/I6/51
Cited
