构建地下物流系统网络
|
摘要
构建地下物流系统,缓解大城市拥堵已经成为了一个热点问题.主要内容包括:根据货物流量OD矩阵,以等比例方式计算了放入地下的货运收发总量为6.32万吨;综合考虑物流园区到需求点的距离和收发货运量因素,基于遗传模拟退火的聚类算法确定了4个一级节点及其服务范围,转运率分别为43%,57%,40%,66%.在每个区域,以服务半径和货运量为约束条件,共确定了24个二级节点;提出直连点和子点的概念,穷举各节点的连结方式,应用可行域的概念,在不影响转运率的前提下,调整二级节点的位置来优化轨道位置,计算得最优成本为206万元/天;提出建立中心节点的两种运输货物的方式以及网络连通度和网络容量等评价指标,分析了轨道的抗干扰能力;根据合理假设提出了网络建设顺序的优先原则,依据30年后整个地下网络的负载,给出了轨道可能的建设顺序.
The Construction underground logistics system and alleviating congestion in large cities has become a hot topic. The main contents of this article include: According to the OD matrix of cargos, the total amount of cargos put under the ground in equal proportion is set to be 630 thousand tons. Considering the distance from the logistics park to the demand point and the cargo's delivery, 4 first-level nodes and their service range are determined based on the genetic simulated annealing clustering algorithm, whose transport rates are 43%,57%,40%, 66% respectively; In each area, with the constraint of service radius and freight volume,24 second-level nodes were identified. The concept of direct connection points and subpoints is put forward, and based on the method of exhaustion of the connection mode of the nodes, the concept of feasible domain is applied to the optimization the position of the second-level node without affecting the transport rate; The total cost is 2.6 million yuan per day. Two ways to establish central nodes are proposed and the evaluation index of network connectivity and network capacity are used to analyze the anti-interference ability of the underground track.With reasonable assumptions, the priority principle of network construction is presented, and based on the load of the entire underground network in 30 years the possible construction order is suggested.
The Construction underground logistics system and alleviating congestion in large cities has become a hot topic. The main contents of this article include: According to the OD matrix of cargos, the total amount of cargos put under the ground in equal proportion is set to be 630 thousand tons. Considering the distance from the logistics park to the demand point and the cargo's delivery, 4 first-level nodes and their service range are determined based on the genetic simulated annealing clustering algorithm, whose transport rates are 43%,57%,40%, 66% respectively; In each area, with the constraint of service radius and freight volume,24 second-level nodes were identified. The concept of direct connection points and subpoints is put forward, and based on the method of exhaustion of the connection mode of the nodes, the concept of feasible domain is applied to the optimization the position of the second-level node without affecting the transport rate; The total cost is 2.6 million yuan per day. Two ways to establish central nodes are proposed and the evaluation index of network connectivity and network capacity are used to analyze the anti-interference ability of the underground track.With reasonable assumptions, the priority principle of network construction is presented, and based on the load of the entire underground network in 30 years the possible construction order is suggested.
引文
[1]郁磊,史峰,王辉,胡斐MATLAB智能算法30个案例分析[M].北京航空航天大学出版社,2011:188-196.
[2]汤志高,王继利,曹颖瑛等.邮路规划与邮车调度最优化理论研究[J].数学的实践与认识,2008,38(14):201-209.
[3]朱道元.研究生数学建模精品案例[M].科学出版社,2014:304-343.
[4]金钢,师群昌,刘小麟.邮政运输中邮路的规划和邮车调度问题的研究[J].数学的实践与认识,2008,38(14):184-191.
[2]汤志高,王继利,曹颖瑛等.邮路规划与邮车调度最优化理论研究[J].数学的实践与认识,2008,38(14):201-209.
[3]朱道元.研究生数学建模精品案例[M].科学出版社,2014:304-343.
[4]金钢,师群昌,刘小麟.邮政运输中邮路的规划和邮车调度问题的研究[J].数学的实践与认识,2008,38(14):184-191.