- 19
- 0
- 约5.34千字
- 约 9页
- 2016-11-07 发布于贵州
- 举报
基于Dijksta算法解决仓库选址问题的探究
基于Dijkstra算法解决仓库选址问题的探究
经济管理学院营销070222 顾学松
摘要:最短路径问题是图论解决的典型实际问题之一,可用来解决管路铺设、线路安装、厂区布局和设备更新,仓库选址等实际问题。本文介绍了图论最短路径问题及其算法,并应用图论最短路径问题的分析方法,
关键词:最短路径;Dijkstra算法;选址
Abstract: The shortest path problem is a typical practical problems solved by graph theory, which can be used to solve problem such as the pipe laying, line installation, plant layout and equipment updates, storage location and other practical problems. This article describes the shortest path problem on graph theory and algorithm, and uses this method to solve warehouse location problem. Examples
原创力文档

文档评论(0)