| 莆田市废物处理厂选址问题的图论方法 |
| |
| 引用本文： | 张新军.莆田市废物处理厂选址问题的图论方法[J].莆田学院学报,2014(2):5-9,54. |
| |
| 作者姓名： | 张新军 |
| |
| 作者单位： | 莆田学院数学学院,福建莆田351100 |
| |
| 基金项目： | 福建省教育厅（B类）项目（JB12180）;莆田学院教育教学改革立项项目（JG2012020） |
| |
| 摘 要： | 废物处理厂选址问题一直是每个城市规划的首要问题之一。针对莆田市区具体情况,将莆田市区地图简化,根据废物处理厂的选址条件以及政府的有关规定,挑选出几个废物处理厂候选地址,将问题进行数学建模,利用图论中的算法,找出最合适的废物处理厂地址。
|
| 关 键 词： | 莆田市 废物处理厂 最短路径 选址问题 Dijkstra算法 图论 |
The Location Problem of the Waste Plants in Putian with the Graph Theory |
| |
| ZHANG Xin-jun.The Location Problem of the Waste Plants in Putian with the Graph Theory[J].journal of putian university,2014(2):5-9,54. |
| |
| Authors: | ZHANG Xin-jun |
| |
| Institution: | ZHANG Xin-jun (College of Mathematics, Putian University, Putian Fujian 351100, China) |
| |
| Abstract: | The location problem of the waste plants was one of the most important issues in each city. For the specific circumstances of Putian, with the map of Putian simplified, a number of candidate locations were selected for the waste plants according to the location of waste plant conditions and the relevant provisions of the Government. The mathematical model was established for this problem and the Dijkstra＇s algorithm was used in graph theory to find the most suitable location for the waste plant. |
| |
| Keywords: | Putian city waste plants the most short-path location problem Dijkstra algorithm graph theory |
| 本文献已被 CNKI 维普 等数据库收录！ |
