CN112395718A - Pipe network layout generation method and device of energy system - Google Patents

Pipe network layout generation method and device of energy system Download PDF

Info

Publication number
CN112395718A
CN112395718A CN202011280548.8A CN202011280548A CN112395718A CN 112395718 A CN112395718 A CN 112395718A CN 202011280548 A CN202011280548 A CN 202011280548A CN 112395718 A CN112395718 A CN 112395718A
Authority
CN
China
Prior art keywords
pipe network
pipe
network layout
road network
layout model
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202011280548.8A
Other languages
Chinese (zh)
Other versions
CN112395718B (en
Inventor
代景龙
马家琳
杨杰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xinao Xinzhi Technology Co ltd
Original Assignee
Ennew Digital Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Ennew Digital Technology Co Ltd filed Critical Ennew Digital Technology Co Ltd
Priority to CN202011280548.8A priority Critical patent/CN112395718B/en
Publication of CN112395718A publication Critical patent/CN112395718A/en
Application granted granted Critical
Publication of CN112395718B publication Critical patent/CN112395718B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/10—Geometric CAD
    • G06F30/18—Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/20—Design optimisation, verification or simulation
    • G06F30/27—Design optimisation, verification or simulation using machine learning, e.g. artificial intelligence, neural networks, support vector machines [SVM] or training a model
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2111/00—Details relating to CAD techniques
    • G06F2111/04—Constraint-based CAD
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
    • Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
    • Y04S10/00—Systems supporting electrical power generation, transmission or distribution
    • Y04S10/50—Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Geometry (AREA)
  • Evolutionary Computation (AREA)
  • Computer Hardware Design (AREA)
  • General Engineering & Computer Science (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Artificial Intelligence (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Medical Informatics (AREA)
  • Software Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The embodiment of the invention discloses a method and a device for generating a pipe network layout of an energy system, electronic equipment and a medium. The method comprises the following steps: acquiring road network related information and load data of a target area; constructing a pipe network layout model based on the road network related information and the load data, wherein the pipe network layout model comprises a target function and a constraint condition; and generating a pipe network layout result based on the pipe network layout model. The embodiment can reduce the energy loss of the steam pipe network, improve the energy utilization rate and is beneficial to improving the energy efficiency and the economic performance of the energy station.

Description

Pipe network layout generation method and device of energy system
Technical Field
The embodiment of the invention relates to the field of energy, in particular to a pipe network layout generation method and device of an energy system, electronic equipment and a medium.
Background
The steam pipe network is a key transmission channel for transmitting the steam of the energy station to steam users, and the structure of the steam pipe network has important influence on the energy efficiency and the economic performance of the energy station.
The structure of the steam pipe network is designed by designers mostly, and the situation that the structural design of the steam pipe network is not reasonable exists. From this, steam pipe network can have a large amount of energy losses in the pipe network transportation process, leads to steam pipe network operating efficiency lower, seriously influences the efficiency of energy station, consequently confirms a reasonable in design's steam pipe network structure, to reducing steam pipe network energy loss, improve energy efficiency and have the significance.
Disclosure of Invention
This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary of the disclosure is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
Some embodiments disclosed in the present invention provide a method, an apparatus, an electronic device, and a medium for generating a pipe network layout of an energy system, so as to solve the technical problems mentioned in the background section above.
In a first aspect, some embodiments of the present disclosure provide a method for generating a pipe network layout of an energy system, where the method includes: acquiring road network related information and load data of a target area; constructing a pipe network layout model based on the road network related information and the load data, wherein the pipe network layout model comprises a target function and a constraint condition; and generating a pipe network layout result based on the pipe network layout model.
In a second aspect, some embodiments of the present disclosure provide an apparatus for generating a pipe network layout of an energy system, where the apparatus includes: an acquisition unit configured to acquire road network related information and load data of a target area; a building unit configured to build a pipe network layout model based on the road network related information and the load data, wherein the pipe network layout model includes an objective function and a constraint condition; and the generating unit is configured to generate a pipe network layout result based on the pipe network layout model.
In a third aspect, some embodiments of the present disclosure provide an electronic device, including: one or more processors; a storage device having one or more programs stored thereon which, when executed by one or more processors, cause the one or more processors to implement the method as described in the first aspect.
In a fourth aspect, some embodiments of the present disclosure provide a computer readable medium having a computer program stored thereon, wherein the program, when executed by a processor, implements the method as described in the first aspect.
One of the above embodiments disclosed by the invention has the following beneficial effects: and constructing a pipe network layout model by acquiring the road network related information and the load data of the target area. Then, the constructed pipe network layout model is solved, and the structure can be determined by using the pipe network layout result. The method disclosed by the invention constructs the model based on the actual data of the target area, the obtained pipe network layout result is more in line with the actual demand, the energy loss of the steam pipe network can be reduced, the energy utilization rate is improved, and the energy efficiency and the economic performance of the energy station are improved. In addition, the accuracy of the generated pipe network layout result can be improved by using the pipe network layout model and adopting a preset optimization algorithm.
Drawings
The above and other features, advantages and aspects of the disclosed embodiments will become more apparent from the following detailed description when taken in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numbers refer to the same or similar elements. It should be understood that the drawings are schematic and that elements and elements are not necessarily drawn to scale.
Fig. 1 is a schematic diagram of an application scenario of a pipe network layout generation method of an energy system according to some embodiments of the present disclosure;
fig. 2 is a flow diagram of some embodiments of a method for generating a grid layout for an energy system according to the present disclosure;
fig. 3 is a schematic structural diagram of some embodiments of a grid layout generating device of an energy system according to the present disclosure;
FIG. 4 is a schematic block diagram of an electronic device suitable for use in implementing some embodiments of the present disclosure.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it is to be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure.
It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings. The embodiments and features of the embodiments disclosed in the present invention may be combined with each other without conflict.
It should be noted that the terms "first", "second", and the like in the present disclosure are only used for distinguishing different devices, modules, or units, and are not used for limiting the order or interdependence of the functions performed by the devices, modules, or units.
It is noted that references to "a", "an", and "the" modifications in the disclosure are exemplary rather than limiting, and that those skilled in the art will understand that "one or more" unless the context clearly dictates otherwise.
The names of messages or information exchanged between devices in the disclosed embodiments are for illustrative purposes only and are not intended to limit the scope of such messages or information.
The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Fig. 1 is a schematic diagram of an application scenario of a pipe network layout generation method of an energy system according to some embodiments of the present disclosure.
In the application scenario of fig. 1, first, the computing device 101 may obtain road network related information 102 and load data 103 of a target area. Computing device 101 may then build a pipe network layout model 104 based on road network related information 102 and load data 103. Finally, computing device 101 may generate a pipe network layout result 105 based on pipe network layout model 104.
The computing device 101 may be hardware or software. When the computing device is hardware, it may be implemented as a distributed cluster composed of multiple servers or terminal devices, or may be implemented as a single server or a single terminal device. When the computing device is embodied as software, it may be installed in the hardware devices enumerated above. It may be implemented, for example, as multiple software or software modules to provide distributed services, or as a single software or software module. And is not particularly limited herein.
It should be understood that the number of computing devices in FIG. 1 is merely illustrative. There may be any number of computing devices, as implementation needs dictate.
Continuing to refer to fig. 2, a flow 200 of some embodiments of a grid layout generation method of an energy system according to the present disclosure is shown. The method may be performed by the computing device 101 of fig. 1. The method for generating the pipe network layout of the energy system comprises the following steps:
step 201, obtaining road network related information and load data of the target area.
In an embodiment, an executive body (e.g., the computing device 101 shown in fig. 1) of the energy system grid layout generating method may obtain the grid related information and the load data of the target area through a wired connection manner or a wireless connection manner. For example, the execution body may receive road network related information and load data input by a user as the road network related information and the load data. For another example, the execution subject may acquire road network related information and load data from a local database as the road network related information and the load data. Here, the road network related information includes: the system comprises universal energy station coordinate information, road network node coordinate information and land parcel center point coordinate information. The load data includes at least one of: user steam parameters, flow data, and pressure data.
It should be noted that the wireless connection means may include, but is not limited to, a 3G/4G connection, a WiFi connection, a bluetooth connection, a WiMAX connection, a Zigbee connection, a uwb (ultra wideband) connection, and other wireless connection means now known or developed in the future.
Step 202, building a pipe network layout model based on the road network related information and the load data.
In an embodiment, the execution agent may construct a pipe network layout model based on the road network related information and the load data. Here, the pipe network layout model may be a model having a deep neural network structure. The pipe network layout model comprises an objective function and a constraint condition.
In an embodiment, the objective function is as follows:
minC＝Cv+CO；
wherein C represents the total planned cost; cvRepresenting the annual average investment cost of the pipe network; cORepresenting the cost of pipe damage.
In an embodiment, the annual average pipe network investment cost is determined according to the following formula:
Figure BDA0002780625170000051
wherein d isijRepresenting the pipe diameter level of a connecting pipeline ij between a road network node i and a road network node j, wherein the pipe diameter level is an integer variable and d is more than or equal to 0ijNot more than Maxdia, wherein Maxdia is the maximum pipe diameter level; p represents the pipe unit price; l represents the pipe life; r represents a residual value rate; arcs represents a set of connectable pipes ij in the road network; dijRepresents the length between the pipes ij;
the pipe loss cost is determined according to the following formula:
Figure BDA0002780625170000052
wherein G isijRepresents the steam flow of conduit ij; λ represents an on-way drag coefficient; ρ represents the fluid density.
In an embodiment, the constraints comprise at least one of: pipe diameter horizontal constraint, flow pressure loss coupling constraint, plot pipeline constraint, plot flow constraint, node flow balance, pressure and flow.
In the embodiment, the pipe section connection and the pipe diameter relation are restrained, and the specific formula is as follows:
Figure BDA0002780625170000053
wherein x isijIndicating whether pipe ij is connected or not, is an integer variable, 1 indicates connection, and 0 indicates no connection.
In an embodiment, the energy station capacity constraint is expressed by the following specific formula:
Figure BDA0002780625170000054
wherein IES _ cap _0 represents the maximum steam capacity of the energy station; i is0Representing a node set connected with a node energy station No. 0; g0jAnd the steam flow of the 0j pipeline with the first section being the node of the energy station is represented.
In the embodiment, the number of pipes is constrained by the following specific formula:
Figure BDA0002780625170000061
wherein MaxL represents the maximum number of pipelines at the outlet of the energy station.
In an embodiment, the node pipe inflow number is constrained by the following specific formula:
Figure BDA0002780625170000062
wherein N represents a set of all nodes, including energy station nodes and plot nodes; i isjRepresenting a set of nodes connected to node j.
In the embodiment, the pipe section flow constraint is expressed by the following specific formula:
Figure BDA0002780625170000063
in the embodiment, the coupling constraint of the pressure loss of the pipe section and the flow and pipe diameter is as follows:
Figure BDA0002780625170000064
wherein, PiRepresents the pressure at node i; pjRepresenting the pressure at node j.
In an embodiment, the number of inflow pipes of the plot nodes is constrained by the following specific formula:
Figure BDA0002780625170000065
wherein, BkRepresenting a set of nodes belonging to a parcel k; block represents a set of blocks.
In an embodiment, the plot pressure constraint is expressed by the following specific formula:
Figure BDA0002780625170000066
wherein, PjRepresenting the lower pressure limit of the plot k.
In the embodiment, the land mass flow balance constraint is specifically as follows:
Figure BDA0002780625170000067
wherein G isk，loadRepresenting the load capacity of plot k.
In an embodiment, the node pressure constraint is specified by the following equation:
Figure BDA0002780625170000071
in the embodiment, the road network node flow balance constraint is specifically represented as follows:
Figure BDA0002780625170000072
wherein N isnetAnd representing a road network node set, and not comprising energy station nodes and land block nodes.
And 203, generating a pipe network layout result based on the pipe network layout model.
In an embodiment, the execution body may generate a pipe network layout result based on the pipe network layout model. Here, the pipe network layout model may adopt a preset optimization algorithm, and the optimization algorithm is used to optimize a result generated by the pipe network layout model to obtain a pipe network layout result of the target area.
As an example, the preset optimization algorithm may be an aln algorithm framework based on the extension of the Large neighbor Search algorithm. The optimization algorithm is executed as follows: firstly, inputting an initialized feasible solution x and an initial test temperature Tstart、TendThe temperature attenuation coefficient (the value range of the temperature attenuation coefficient c is more than or equal to 0 and less than or equal to 1), and c (x) represents the objective function value of the pipe network layout model; second, the roulette selects the destroy operator d e.omega-And the repair operator r ∈ omega+，xt＝r(d(x))，xtRepresents the locally optimal solution, Ω, of the present search-Represents a set of destroy methods, Ω+Represents a set of repair methods; third, in response to determining acceptance (x) based on the first step simulated annealing Metropolis criteriatX) to obtain x ═ xt(ii) a The fourth step, the current temperature T is T ═ TstartHas xb＝x，xbRepresenting the currently obtained optimal solution; a fifth step of, in response to the determination of c (x)t)＜c(xb) To obtain xb＝xt(ii) a Sixthly, updating the weight set rho of the hierarchy method-And weight set of repair methodRho of+T ═ c × T; a seventh step of responding to T ≦ TendOr reaching the preset iteration times and returning to xbAnd ending the algorithm; and step eight, responding to the situation that the step seven is not met, and returning to execute the step two.
The probability of roulette as set out above is calculated as follows:
Figure BDA0002780625170000073
Figure BDA0002780625170000081
the Metropolis criteria set out above can be expressed as follows: assuming the current state x (n), the state changes to x (n +1) when the system is disturbed, and the system energy E (n) changes to E (n + 1). Thus, the acceptance probability of a system changing from x (n) to x (n +1) is defined as p:
Figure BDA0002780625170000082
and (3) receiving a poor solution by the simulated annealing probability, introducing a temperature control parameter T, and adjusting the receiving probability T as the temperature decays, wherein c is a decay coefficient.
The set of weights ρ for the update hierarchy method set forth above-And weight set ρ of repair method+The implementation mode is as follows:
ρ-＝λρ-+(1-λ)ψ，
ρ+＝λρ++(1-λ)ψ，
wherein, λ is an attenuation coefficient, and is used for controlling the update speed of the operator weight; psi is the awarding value of the operator, the larger the value is, the better the domain searching performance of the operator is, and the scoring mechanism is as follows:
Figure BDA0002780625170000083
alternatively, if an operator is slow to compute, the fraction of the operator can be adjusted as time goes by to balance the quality of time and solution.
In the embodiment, compared with heuristic algorithms such as simulated annealing and the like, the ALNS framework is compatible with diversified operators and can be regarded as a mixed heuristic method to support searching in a larger field, so that the result is more robust and cannot easily fall into local optimum. Meanwhile, the ALNS can evaluate and select the domain with better effect in the single-step domain set.
One of the above embodiments disclosed by the invention has the following beneficial effects: and constructing a pipe network layout model by acquiring the road network related information and the load data of the target area. Then, the constructed pipe network layout model is solved, and the structure can be determined by using the pipe network layout result. The method disclosed by the invention constructs the model based on the actual data of the target area, the obtained pipe network layout result is more in line with the actual demand, the energy loss of the steam pipe network can be reduced, the energy utilization rate is improved, and the energy efficiency and the economic performance of the energy station are improved. In addition, the accuracy of the generated pipe network layout result can be improved by using the pipe network layout model and adopting a preset optimization algorithm.
With further reference to fig. 3, as an implementation of the above method for the above figures, the present disclosure provides some embodiments of a pipe network layout generating apparatus of an energy system, where the embodiments of the apparatus correspond to those of the method described above in fig. 2, and the apparatus may be specifically applied to various electronic devices.
As shown in fig. 3, the pipe network layout generating apparatus 300 of the energy system according to the embodiment includes: an acquisition unit 301, a construction unit 302 and a generation unit 303. An acquisition unit 301 configured to acquire road network related information and load data of a target area; a building unit 302 configured to build a pipe network layout model based on the road network related information and the load data, wherein the pipe network layout model includes an objective function and a constraint condition; a generating unit 303 configured to generate a pipe network layout result based on the pipe network layout model.
In some optional implementations of the embodiment, the road network related information includes: the system comprises universal energy station coordinate information, road network node coordinate information and land parcel center point coordinate information.
In some optional implementations of the embodiment, the load data comprises at least one of: user steam parameters, flow data, and pressure data.
In some optional implementations of embodiments, the objective function is as follows:
minC＝Cv+CO；
wherein C represents the total planned cost; cvRepresenting the annual average investment cost of the pipe network; cORepresenting the cost of pipe damage.
In some optional implementations of embodiments, the annual average pipe network investment cost is determined according to the following formula:
Figure BDA0002780625170000091
wherein d isijRepresenting the pipe diameter level of a connecting pipeline ij between a road network node i and a road network node j, wherein the pipe diameter level is an integer variable and d is more than or equal to 0ijNot more than Maxdia, wherein Maxdia is the maximum pipe diameter level; p represents the pipe unit price; l represents the pipe life; r represents a residual value rate; arcs represents a set of connectable pipes ij in the road network; dijRepresents the length between the pipes ij;
the pipe loss cost is determined according to the following formula:
Figure BDA0002780625170000101
wherein G isijRepresents the steam flow of conduit ij; λ represents an on-way drag coefficient; ρ represents the fluid density.
In some optional implementations of the embodiment, the constraint comprises at least one of: pipe diameter horizontal constraint, flow pressure loss coupling constraint, plot pipeline constraint, plot flow constraint, node flow balance, pressure and flow.
In some optional implementation manners of the embodiment, a preset optimization algorithm is adopted based on the pipe network layout model, and the optimization algorithm is used for optimizing a result generated by the pipe network layout model to obtain a pipe network layout result of the target area.
It will be understood that the units described in the apparatus 300 correspond to the various steps in the method described with reference to fig. 2. Thus, the operations, features and resulting advantages described above with respect to the method are also applicable to the apparatus 300 and the units included therein, and are not described herein again.
Referring now to FIG. 4, a block diagram of an electronic device (e.g., computing device 101 of FIG. 1)400 suitable for use in implementing some embodiments of the present disclosure is shown. The server illustrated in fig. 4 is only an example and should not bring any limitations to the function and scope of use of the disclosed embodiments of the present invention.
As shown in fig. 4, electronic device 400 may include a processing device (e.g., central processing unit, graphics processor, etc.) 401 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)402 or a program loaded from a storage device 408 into a Random Access Memory (RAM) 403. In the RAM 403, various programs and data necessary for the operation of the electronic apparatus 400 are also stored. The processing device 401, the ROM 402, and the RAM 403 are connected to each other via a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.
Generally, the following devices may be connected to the I/O interface 405: input devices 406 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; an output device 407 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 408 including, for example, tape, hard disk, etc.; and a communication device 409. The communication means 409 may allow the electronic device 400 to communicate wirelessly or by wire with other devices to exchange data. While fig. 4 illustrates an electronic device 400 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided. Each block shown in fig. 4 may represent one device or may represent multiple devices as desired.
In particular, according to some embodiments of the present disclosure, the processes described above with reference to the flow diagrams may be implemented as computer software programs. For example, some embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In some such embodiments, the computer program may be downloaded and installed from a network through the communication device 409, or from the storage device 408, or from the ROM 402. Which when executed by the processing means 401, performs the above-described functions defined in the methods of some embodiments of the present disclosure.
It should be noted that the computer readable medium mentioned above in some embodiments of the present disclosure may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In some embodiments of the disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In some embodiments of the present disclosure, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
In some embodiments, the clients, servers may communicate using any currently known or future developed network Protocol, such as HTTP (HyperText Transfer Protocol), and may interconnect with any form or medium of digital data communication (e.g., a communications network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the Internet (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed network.
The computer readable medium may be embodied in the apparatus; or may exist separately without being assembled into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: acquiring road network related information and load data of a target area; constructing a pipe network layout model based on the road network related information and the load data, wherein the pipe network layout model comprises a target function and a constraint condition; and generating a pipe network layout result based on the pipe network layout model.
Computer program code for carrying out operations for embodiments of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in some embodiments of the present disclosure may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor includes an acquisition unit, a construction unit, and a generation unit. Here, the names of these units do not constitute a limitation to the unit itself in some cases, and for example, the acquisition unit may also be described as a "unit that acquires road network related information and load data of the target area".
The functions described herein above may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), systems on a chip (SOCs), Complex Programmable Logic Devices (CPLDs), and the like.
The foregoing description is only exemplary of the preferred embodiments of the present disclosure and is provided for the purpose of illustrating the general principles of the technology. It will be appreciated by those skilled in the art that the scope of the invention in the embodiments disclosed in the present application is not limited to the embodiments with specific combinations of the above-mentioned features, but also covers other embodiments with any combination of the above-mentioned features or their equivalents without departing from the inventive concept. For example, the above features and (but not limited to) technical features with similar functions disclosed in the embodiments of the present disclosure are mutually replaced to form the technical solution.

Claims (10)

1. A method for generating a pipe network layout of an energy system is characterized by comprising the following steps:
acquiring road network related information and load data of a target area;
constructing a pipe network layout model based on the road network related information and the load data, wherein the pipe network layout model comprises a target function and a constraint condition;
and generating a pipe network layout result based on the pipe network layout model.
2. The method according to claim 1, wherein the road network related information comprises: the system comprises universal energy station coordinate information, road network node coordinate information and land parcel center point coordinate information.
3. The method according to claim 1, wherein the load data includes at least one of the following: user steam parameters, flow data, and pressure data.
4. The method according to claim 1, wherein the objective function is as follows:
minC＝Cv+CO；
wherein C represents the total planned cost; cvRepresenting the annual average investment cost of the pipe network; cORepresenting the cost of pipe damage.
5. The method according to claim 4, wherein the annual average pipe network investment cost is determined according to the following formula:
Figure FDA0002780625160000011
wherein d isijRepresenting the pipe diameter level of a connecting pipeline ij between a road network node i and a road network node j, wherein the pipe diameter level is an integer variable and d is more than or equal to 0ijNot more than Maxdia, wherein Maxdia is the maximum pipe diameter level; p represents the pipe unit price; l represents the pipe life; r represents a residual value rate; arcs represents a set of connectable pipes ij in the road network; dijRepresents the length between the pipes ij;
the pipe loss cost is determined according to the following formula:
Figure FDA0002780625160000021
wherein G isijRepresents the steam flow of conduit ij; λ represents an on-way drag coefficient; ρ represents the fluid density.
6. The method according to claim 1, wherein the constraint condition includes at least one of: pipe diameter horizontal constraint, flow pressure loss coupling constraint, plot pipeline constraint, plot flow constraint, node flow balance, pressure and flow.
7. The method according to claim 1, wherein a preset optimization algorithm is used based on the pipe network layout model, and the optimization algorithm is used for optimizing a result generated by the pipe network layout model to obtain a pipe network layout result of the target area.
8. A pipe network layout generating device of an energy system is characterized by comprising:
an acquisition unit configured to acquire road network related information and load data of a target area;
a building unit configured to build a pipe network layout model based on the road network related information and the load data, wherein the pipe network layout model includes an objective function and a constraint condition;
and the generating unit is configured to generate a pipe network layout result based on the pipe network layout model.
9. An electronic device, comprising:
one or more processors;
a storage device having one or more programs stored thereon;
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-7.
10. A computer-readable medium, on which a computer program is stored, wherein the program, when executed by a processor, implements the method of any one of claims 1-7.
CN202011280548.8A 2020-11-16 2020-11-16 Pipe network layout generation method and device of energy system Active CN112395718B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011280548.8A CN112395718B (en) 2020-11-16 2020-11-16 Pipe network layout generation method and device of energy system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011280548.8A CN112395718B (en) 2020-11-16 2020-11-16 Pipe network layout generation method and device of energy system

Publications (2)

Publication Number Publication Date
CN112395718A true CN112395718A (en) 2021-02-23
CN112395718B CN112395718B (en) 2023-12-19

Family

ID=74601099

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011280548.8A Active CN112395718B (en) 2020-11-16 2020-11-16 Pipe network layout generation method and device of energy system

Country Status (1)

Country Link
CN (1) CN112395718B (en)

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160098502A1 (en) * 2014-10-03 2016-04-07 Schlumberger Technology Corporation Multiphase flow simulator sub-modeling
JP2017126313A (en) * 2016-01-13 2017-07-20 富士電機株式会社 Plant design support device, plant design support method, and plant design support program
JP2018112862A (en) * 2017-01-11 2018-07-19 株式会社日立製作所 Plumbing route creating device, plumbing route creating method, and program
CN109344555A (en) * 2018-11-30 2019-02-15 中国石油大学(北京) A kind of collection transmission pipe network design method and device
US20190072395A1 (en) * 2017-09-07 2019-03-07 Wichita State University Beacon-based indoor wayfinding system with automated beacon placement
EP3508557A1 (en) * 2018-01-09 2019-07-10 Paralloy Limited Pipes for chemical processing
CN110991092A (en) * 2020-01-03 2020-04-10 中冶赛迪技术研究中心有限公司 Complementary energy integrated utilization calculation method and system
CN111209703A (en) * 2020-01-03 2020-05-29 云南电网有限责任公司电力科学研究院 Delay-considered regional steam heat supply network topological structure optimization method and system
CN111832138A (en) * 2020-05-19 2020-10-27 华电电力科学研究院有限公司 Regional pipe network topology optimization method

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160098502A1 (en) * 2014-10-03 2016-04-07 Schlumberger Technology Corporation Multiphase flow simulator sub-modeling
JP2017126313A (en) * 2016-01-13 2017-07-20 富士電機株式会社 Plant design support device, plant design support method, and plant design support program
JP2018112862A (en) * 2017-01-11 2018-07-19 株式会社日立製作所 Plumbing route creating device, plumbing route creating method, and program
US20190072395A1 (en) * 2017-09-07 2019-03-07 Wichita State University Beacon-based indoor wayfinding system with automated beacon placement
EP3508557A1 (en) * 2018-01-09 2019-07-10 Paralloy Limited Pipes for chemical processing
CN109344555A (en) * 2018-11-30 2019-02-15 中国石油大学(北京) A kind of collection transmission pipe network design method and device
CN110991092A (en) * 2020-01-03 2020-04-10 中冶赛迪技术研究中心有限公司 Complementary energy integrated utilization calculation method and system
CN111209703A (en) * 2020-01-03 2020-05-29 云南电网有限责任公司电力科学研究院 Delay-considered regional steam heat supply network topological structure optimization method and system
CN111832138A (en) * 2020-05-19 2020-10-27 华电电力科学研究院有限公司 Regional pipe network topology optimization method

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
CHRISTOPHER WALES等: "Reducing steam transport pipe temperatures in power plants", ENERGY, vol. 183, pages 127 - 141, XP085799876, DOI: 10.1016/j.energy.2019.06.059 *
徐鹏;葛斌;殷戈;: "蒸汽管网设计建模和优化", 华东电力, no. 03, pages 20 - 24 *
李瑜;崔国民;涂惟民;姜涛;: "蒸汽管网的建模和设计优化", 节能, no. 10, pages 14 - 17 *

Also Published As

Publication number Publication date
CN112395718B (en) 2023-12-19

Similar Documents

Publication Publication Date Title
CN113408797B (en) Method for generating multi-time sequence model of flow quantity prediction, method and device for sending information
CN113327598B (en) Model training method, voice recognition method, device, medium and equipment
CN109725988A (en) A kind of method for scheduling task and device
CN116703131B (en) Power resource allocation method, device, electronic equipment and computer readable medium
CN113344737B (en) Device control method, device, electronic device and computer readable medium
CN112365109B (en) Distribution path information generation method and device, electronic equipment and readable medium
CN115700548A (en) Method, apparatus and computer program product for user behavior prediction
CN116512980B (en) Power distribution method, device, equipment and medium based on internal resistance of power battery
CN111278085B (en) Method and device for acquiring target network
CN111459780B (en) User identification method and device, readable medium and electronic equipment
CN113255950B (en) Method and device for optimizing logistics network
CN112395718B (en) Pipe network layout generation method and device of energy system
CN112395719B (en) Pipe network layout method and device of energy system
CN111327472B (en) Method and device for acquiring target network
CN111898061B (en) Method, apparatus, electronic device and computer readable medium for searching network
CN113408970A (en) User information generation method and device, electronic equipment and computer readable medium
CN111582456A (en) Method, apparatus, device and medium for generating network model information
CN111741437B (en) Positioning method for addressing correction of satellite positioning and communication base station cloud terminal
CN116822259B (en) Evaluation information generation method and device based on scene simulation and electronic equipment
CN114697206B (en) Method, device, equipment and computer readable medium for managing nodes of Internet of things
WO2023202245A1 (en) Three-dimensional map data loading and sending method and apparatus, electronic device, and medium
CN116167894B (en) Water resource shortage warning method, device, electronic equipment and computer readable medium
CN116070947B (en) Simulation early warning method, device, equipment and medium for safety production event
CN116128398A (en) Information transmission method, apparatus, electronic device, and computer-readable medium
CN116521377B (en) Service computing unloading method, system, device, equipment and medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20231028

Address after: 065001 China (Hebei) Pilot Free Trade Zone Daxing Airport Area Langfang Airport Economic Zone Hangyidao Free Trade Zone Science and Technology Innovation Base 2101, Langfang City, Hebei Province

Applicant after: Xinao Xinzhi Technology Co.,Ltd.

Address before: 100020 10th floor, Motorola building, 1 Wangjing East Road, Chaoyang District, Beijing

Applicant before: ENNEW DIGITAL TECHNOLOGY Co.,Ltd.

GR01 Patent grant
GR01 Patent grant