On the study of transportation path planning problem using minimum spanning tree and maximum-flow minimum-cut theorem
| Autor: | Ye-Zheng Chen, 陳曄徵 |
|---|---|
| Rok vydání: | 2017 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 105 In the problem of transportation path planning, the thermal power plant coal transportation path planning is a very complex problem. The complex transportation path forms the coal-transportation network. In order to solve the problem of coal transportation path planning in domestic famous thermal power plant, this paper analyzes the coal-transportation network of thermal power plant, with the minimum spanning tree to build coal-transportation network. Analyzes the transport mode of all coal-transportation path. Proposed a coal-transportation path algorithm, to achieve the purpose of searching for the shortest coal-transportation path in the coal-transportation network. In the process of coal transportation, find the maximum transport efficiency of each coal-transportation path. Proposed coal-transportation path maximum-flow minimum-cut algorithm, find the maximum flow of each coal-transportation path, to achieve the maximum transport efficiency. The final simulation results are output to complete the planning coal-transportation path string, coal-transportation path weight and maximum flow, to solve the thermal power plant transportation path planning problem. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|