当前位置:网站首页>Mathematical modeling -- the laying of water pipes
Mathematical modeling -- the laying of water pipes
2022-07-29 02:03:00 【abcwsp】
The laying of water pipes
Description of water pipe laying problem
During the implementation of the water supply project for every village , From the perspective of ensuring the quality of water supply and convenient equipment maintenance , A central water supply station needs to be built in a certain area ,12 A primary water supply station and 168 Two secondary water supply stations , The location coordinates of water supply stations at all levels are shown in the annex table 1 Shown , The type A It means central water supply station , type V Represents the primary water supply station , type P It is a secondary water supply station . Attachment diagram 1 It is the geographical location map of water supply stations at all levels .
Now the central water supply station A The tap water at is transmitted to the primary water supply station and the secondary water supply station through pipelines . According to the design requirements , From the central station A The pipeline laid to the primary water supply station is I Type pipe , The pipeline laid from the primary water supply station to the secondary water supply station is II Type pipe .
The technical requirements for the laying of water pipes are as follows :
- 1. The central water supply station can only be connected with the primary water supply station ( layout I Type pipe ), It cannot be directly connected to the secondary water supply station , But the primary water supply stations can be connected ( layout I Type pipe ).
- 2. The primary water supply station can be connected with the secondary water supply station ( layout II Type pipe ), And the secondary water supply stations can also be connected ( layout II Type pipe ).
- 3. The connecting pipes between water supply stations at all levels must start from the location coordinates of the upper water supply station or the same water supply station , Do not connect from a point in the middle of any pipe .
- 4. Between two adjacent water supply stations ( If there are pipes connected ) The required pipe length can be simplified as Euclidean distance .
Please combine the above pipe laying requirements , Mathematical modeling , Complete the following questions
- problem 1: From the central water supply station A set out , How to lay the water pipeline to minimize the total mileage of the pipeline ? The laying scheme is given in figures , And give I Type pipe and II Total mileage of type I pipeline .
- problem 2: because II The market supply of type a pipeline is insufficient , There is an urgent need to reduce the number of II Total mileage of type I pipeline , The preliminary plan is to upgrade two secondary water supply stations to primary water supply stations . Ask which two secondary water supply stations to choose , How should the water pipe be laid so that it can be laid II The total mileage of type a pipeline is at least ? Relative problem 1 The plan ,II How many kilometers has the total mileage of type a pipeline been reduced ?
- problem 3: In question 1 On the basis of , If in reality, due to the influence of power , The pipeline laid from the primary water supply station can only supply water at most 40 km ( It is calculated according to the total mileage of pipeline transmission from the primary water supply station ), But from the central water supply station A The water supply of the pipeline laid from the start is not limited by this distance . In order to supply water to all water supply stations , Several secondary water supply stations need to be upgraded to primary water supply stations , However, the pipeline laid from the water supply station after upgrading can only supply water at most 40 km . Ask how many secondary water supply stations to upgrade at least , It can supply water to all water supply stations ? How many kilometers is the minimum total mileage of laying pipelines under this configuration ?

Modeling ideas and scheme design
Symbol description

Problem one analysis
For question 1 , The minimum total mileage of the pipeline laid from the central water supply station in the demand solution , Transform it into a minimum spanning tree problem (MST problem ) To solve the . This article takes Prim Algorithm , Take the water station as the node , The distance between water stations is used as the weight of edges , Solve the minimum spanning tree of the total mileage of the pipeline . The global optimal solution without hierarchy should not be considered here , That is, the primary water supply station and the secondary water supply station are the same nodes , Some tap water will be transmitted from the secondary water supply station to the primary water supply station or the tap water will converge , This distribution does not form circulation , And it does not conform to the distribution of dendritic pipes in real life . Requirements of problem-based design , Adopt the dendritic form with less pipeline mileage to design the pipeline laying , First consider the pipeline from the central water supply station to each primary water supply station , Then consider the pipeline from the primary water supply station to each secondary water supply station , That is, first determine I The minimum spanning tree of a pipeline , To determine the II The minimum spanning tree of a pipeline .
Question 1 Results



Question two

Results show ...
Code
...
边栏推荐
- 基于 ICA 与 DL 的语音信号盲分离
- 【流放之路-第四章】
- Reinforcement learning (III): dqn, nature dqn, double dqn, with source code interpretation
- leetcode/乘积小于K 的连续子数组的个数
- MPEG音频编码三十年
- 数学建模——红酒品质分类
- LM13丨形态量化-动量周期分析
- Solution of Lenovo notebook camera unable to open
- Where will Jinan win in hosting the first computing power conference?
- Introduction to shared data center agent
猜你喜欢

【流放之路-第七章】

数据平台数据接入实践

【7.21-26】代码源 - 【体育节】【丹钓战】【最大权值划分】

Have you ever encountered the situation that the IP is blocked when crawling web pages?

MPEG音频编码三十年
![[golang] synchronization lock mutex](/img/72/d3e46a820796a48b458cd2d0a18f8f.png)
[golang] synchronization lock mutex

Reinforcement learning (III): dqn, nature dqn, double dqn, with source code interpretation
![[the road of Exile - Chapter 2]](/img/98/0a0558dc385141dbb4f97bc0e68b70.png)
[the road of Exile - Chapter 2]

For a safer experience, Microsoft announced the first PC with a secure Pluto chip
![[web technology] 1395 esbuild bundler HMR](/img/74/be75c8f745f18b374ed15c8e1b4466.png)
[web technology] 1395 esbuild bundler HMR
随机推荐
【流放之路-第八章】
StoneDB 邀请您参与开源社区月会!
[the road of Exile - Chapter 8]
Reinforcement learning (III): dqn, nature dqn, double dqn, with source code interpretation
[7.21-26] code source - [square count] [dictionary order minimum] [Z-type matrix]
[网鼎杯 2020 朱雀组]Nmap
Comprehensive explanation of "search engine crawl"
The basic concept of transaction and the implementation principle of MySQL transaction
【流放之路-第七章】
Wonderful use of data analysis
[7.21-26] code source - [sports festival] [Dan fishing war] [maximum weight division]
Event express | Apache Doris Performance Optimization Practice Series live broadcast course is open at the beginning. You are cordially invited to participate!
[public class preview]: application exploration of Kwai gpu/fpga/asic heterogeneous platform
leetcode/乘积小于K 的连续子数组的个数
[the road of Exile - Chapter 2]
Super technology network security risk assessment service, comprehensively understand the security risks faced by the network system
动态内存与智能指针
[golang] synchronization lock mutex
MPEG音频编码三十年
Regular filtering data learning notes (①)