摘要
本文基于最优化理论,研究地下物流系统的数学模型构建问题.首先做出合理假设,在此基础上利用集合覆盖模型确定一级和二级节点的数量及位置.基于鲍摩-瓦尔夫模型,以总成本最小为目标函数确定各级节点之间的管道建设,Matlab编程遗传算法求解模型,得到最优路线.考虑到建设期间应满足实际交通需求递增的可能,依据运输量对节点进行模糊聚类,确定每个建设期的建设路线,行成动态的时序演进图.最后结合求解的过程和结果,进行总结分析.
This paper studies the mathematical modeling of underground logistics system based on the theory of optimization.First,we introduce reasonable hypotheses.On this basis,we determine the number and location of the first and second level nodes by the set covering model.Based on the Baumol-Wolfe model,minimizing the total cost as the objective function determines the pipeline construction among the nodes at all levels,the Matlab programming genetic algorithm is used to solve the model,and to get the optimal path.Considering the situation of increasing actual traffic demand,we cluster nodes by traffic volume,confirm the construction route for each construction period,and establish a dynamic sequence evolution diagram.Finally,we summarize and analyze the process and results of the solution.
作者
王玉学
汪子强
WANG Yu-xue;WANG Zi-qiang(Faculty of Mathematics and Statistics,Northeast Petroleum University,Daqing 163318)
出处
《工程数学学报》
CSCD
北大核心
2020年第6期664-672,共9页
Chinese Journal of Engineering Mathematics
基金
东北石油大学引导性创新基金(2018YDL-19).