A dynamic programming approach for the pipe network layout problem

Shiono, Naoshi; Suzuki, Honoh; Saruwatari, Yasufumi

doi:10.1016/j.ejor.2019.02.036

Cited by 13 publications

(12 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This way will be a great defect in efficiency and accuracy. Velden IOP Publishing doi:10.1088/1742-6596/2569/1/012017 3 et al [7] proposed a pipe routing method that used the idea of a dynamic programming algorithm. However, these methods have their limitations, such as requiring a lot of memory space, not guaranteeing a solution, and needing expert knowledge.…”

Section: Related Workmentioning

confidence: 99%

Pipe Routing Design for Aero-Engine Using Monte Carlo Tree Search Method

Xu,

Fan,

Meng

et al. 2023

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

Pipe routing design (PRD) is a complex process that involves a large search space and requires experienced professionals. Despite advancements in aero-engine design, PRD remains a stage that is not completely automated. In this article, we present a new approach to PRD by formulating it as a Markov decision process and proposing a pipe routing design method based on Monte Carlo Tree Search (PRD-MCTS). Firstly, this paper uses an intelligent algorithm to look for enough paths for each pair of joints. Secondly, PRD-MCTS regards each path as a candidate choice, and then PRD-MCTS randomly chooses a path and calculates the probability of collision-free routing until the set time. The method selects the path with the highest probability and updates the environment for the next selection. A simplified environment from the aero engine verifies the correctness of the methods.

show abstract

Section: Related Workmentioning

confidence: 99%

Pipe Routing Design for Aero-Engine Using Monte Carlo Tree Search Method

Xu,

Fan,

Meng

et al. 2023

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

show abstract

“…𝑓 ̃3(𝑠 (11,12,13) (11,13,15) (10,12,14) (6,7,8) 4 (12,13,14) (14,16,18) (13,15,17) (11,13,15) (10,11,12) 5 (14,15,16) (15,17,19) (16,18,20) (14,16,18) (15,17,19) (13,14,15) 6 (18,19,20) (17,19,21) (17,19,21) (17,19,…”

Section: Table 3 Fuzzy Number Of Additional Years Of Life For Residents Of the Village (3)mentioning

confidence: 99%

“…Shiono and et al2019 14 provided the optimization model with the aim of designing a pipe network. An underground pipe network for geographically must be prepared concerning the many possible roads below which pipes are put.…”

Section: Introductionmentioning

confidence: 99%

A Fuzzy Dynamic Programming for the Optimal Allocation of Health Centers in some Villages around Baghdad

Khalaf

2022

Baghdad Sci.J

View full text Add to dashboard Cite

The Planning and Resource Development Department of the Iraqi Ministry of Health is very interested in improving medical care, health education, and village training programs. Accordingly, and through the available capabilities of the ministry, itdesires to allocate seven health centers to four villages in Baghdad, Iraq therefore the ministry needs to determine the number of health centers allocated to each of these villages which achieves the greatest degree of the overall effectiveness of the seven health centers in a fuzzy environment. The objective of this study is to use a fuzzy dynamic programming(DP) method to determine the optimal allocation of these centers, which allows the greatest overall effectiveness of these health centers to be achieved, which is the expected increase in the average life years in the village population in a fuzzy environment. The results of this studyareproved after a real-life problem was solved that the proposed method is an effective mathematical model for making a series of related decisions, and it provides us with a systematic procedure to determine the optimal combination of decisions.

show abstract

“…The velocity and nonnegative constraints are similar to those in Equations (8) and (9). Besides, the head loss of each main or subordinate pipe segment (H sub,ip ) should be less than or equal to h ip and the maximum allowable head loss (H t,ip ).…”

Section: Model Solutionmentioning

confidence: 99%

“…The reliability requirement is usually addressed by considering a base structure for the networks, including tree-type and looped layout [2,7]. Due to the relatively lower cost, the tree-type WDN is the most well-tried and the most used in rural water supply projects [8,9]. Optimization of tree-type WDN is a multidisciplinary task involving different requirements of hydraulics, quality, reliability and availability [5,10,11].…”

Section: Introductionmentioning

confidence: 99%

Optimization of Pressurized Tree-Type Water Distribution Network Using the Improved Decomposition–Dynamic Programming Aggregation Algorithm

Cheng

Chen

Cheng

et al. 2019

Water

View full text Add to dashboard Cite

Pressurized tree-type water distribution network (WDN) is widely used in rural water supply projects. Optimization of this network has direct practical significance to reduce the capital cost. This paper developed a discrete nonlinear model to obtain the minimum equivalent annual cost (EAC) of pressurized tree-type WDN. The pump head and pipe diameter were taken into account as the double decision variables, while the pipe head loss and flow velocity were the constraint conditions. The model was solved by using the improved decomposition–dynamic programming aggregation (DDPA) algorithm and applied to a real case. The optimization results showed that the annual investment, depreciation and maintenance cost (W1) were reduced by 22.5%; however, the pumps’ operational cost (p) increased by 17.9% compared to the actual layout. Overall, the optimal EAC was reduced by 15.2% with the optimized pump head and optimal diameter distribution of the network. This method demonstrated an intrinsic trade-off between investment and operational cost, and provided an efficient decision support tool for least-cost design of pressurized tree-type WDN.

show abstract

A dynamic programming approach for the pipe network layout problem

Cited by 13 publications

References 28 publications

Pipe Routing Design for Aero-Engine Using Monte Carlo Tree Search Method

Pipe Routing Design for Aero-Engine Using Monte Carlo Tree Search Method

A Fuzzy Dynamic Programming for the Optimal Allocation of Health Centers in some Villages around Baghdad

Optimization of Pressurized Tree-Type Water Distribution Network Using the Improved Decomposition–Dynamic Programming Aggregation Algorithm

Contact Info

Product

Resources

About