Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 32 No. 1 (2025) 72 https://internationalpubls.com Urban Drainage Network Structure Optimization Using Emperor Penguin Optimization Algorithm J. Suganthi1*, I. Paulraj Jayasimman2 1*Research scholar, Academy of Maritime Education and Training (AMET), Deemed to be University, India. Email: sugisuresh27@yahoo.in 2Associate Professor, Department of Mathematics, Academy of Maritime Education and Training (AMET), Deemed to be University, India. 2ipjayasimman@ametuniv.ac.in 1*Corresponding Author Article History: Received: 08-07-2024 Revised: 21-08-2024 Accepted: 04-09-2024 Abstract: Urban drainage systems are an essential component of urban infrastructure that plays a critical role in managing stormwater and preventing flooding in urban areas. With the changing climate and urbanization, the challenges faced by urban drainage systems are becoming increasingly complex. Additionally, aging infrastructure further exacerbates the problem, creating anurban sewage line that must be made more resilient. Redundancy is just a fundamental characteristic of such a robust urban drainage network. Redundancy in urban drainage systems can help to ensure that the system continues to function during extreme weather events or emergencies, reducing the likelihood of flooding and damage. However, the exact locations where redundancy should be increased and its contribution to resilience are not well understood. In recent years, several studies have focused on developing frameworks for optimising urban drainage structures which account pipeline redundancy.One similar research presented a paradigm for constructing the ideal network layout for urban drainage infrastructure, which considers pipeline redundancy under consideration. The original architecture and structure of the urban drainage network was developed using emperor penguin optimizer algorithms and graph theory in the research. Complicated system modelling was done to find extra water pathways or redundancy which might well be implemented to boost resistance. The suggested approach has been utilised to the test region in Dongying City, Shandong Province, China, and its findings revealed even under rainfall above the design specification, the entire overflow capacity of such urban drainage network including pipeline redundancy significantly decreased about 20-30%, compared to the network without pipeline redundancies. The interest in creating optimization algorithms had also increased recently that can be used to design and manage urban infrastructure systems. One such algorithm is the Emperor Penguin Optimization (EPO) algorithm. EPO was a recently developed swarm-based optimization An algorithm which simulates Emperor penguins behaviour in their search for food in Antarctica. The algorithm has shown promising results in solving complex optimization problems in different fields, including engineering, computer science, and management. The EPO algorithm's key features include an emperor search strategy, local search, and randomization, enabling that to efficiently and successfully examine the search process. The algorithm's emperor penguin search strategy enables it to dynamically adjust the search parameters based on the problem's characteristics and progress. The local search feature allows it to escape local optima and explore the search space further. Finally, the randomization feature adds stochasticity to the search process, helping to ensure that the algorithm can avoid getting stuck in a sub-optimal solution. In this article, we aim to explore the potential of EPO as a tool for optimizing Urban drainage solutions which take mailto:sugisuresh27@yahoo.in mailto:2ipjayasimman@ametuniv.ac.in Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 32 No. 1 (2025) 73 https://internationalpubls.com into account pipeline redundancy. We will start by reviewing the existing Literature upon that optimization in urban drainage facilities, particularly the application of particle swarm optimization, genetic algorithms, and ant colony enhancement. The EPO algorithm will next be described in full including its working principle, key features, and the steps involved in applying it to an optimization problem. Finally, we will present a case study that applies the EPO technique was developed to optimise the network model of such an urban drainage infrastructure taking into account pipeline redundancies, and compare the results with other optimization algorithms. Through this, we aim to demonstrate the potential of EPO as a powerful tool for designing and managing urban infrastructure systems, particularly for enhancing the resilience of urban drainage systems. The study will provide valuable insights into the optimal design of urban drainage technologies which take into account pipeline redundancy, helping policymakers and urban planners make informed decisions about improvingthe adaptability of urban drainage networks. The findings can contribute to the development of sustainable and resilient urban infrastructure systems, which are essential for ensuring the well-being and prosperity of urban residents. Keywords: Urban Drainage Network, Emperor Penguin Optimization Algorithm, Hydraulic Layout, Storm Water Management Model 1. Introduction The recommended experimental framework, primarily depicted in Figure 1, consists of three major components. The initial stage is to use a graph theory technique for determine the basic structure of both the urban drainage network. In its second step, an emperor penguin algorithm is employed to obtain the optimal hydraulic design. The third step involves using complex network examination to identify crucial nodes that can increase loop and redundancy, and analyzing the system's resiliency effectiveness. The analysis primarily concentrates upon the above structure’s effectiveness inside the event of a functional breakdown, employing two specified metrics: mean flood duration (MFD) and total overflow volume (TOV) [14,15]. Whenever the outflow discharge surpasses the capacity of drainage, the amount of rainwater which runs through the drainage system has been referred to as TOV, while MFD refers to the average duration of the flood. Fig.1.An elevated summary of such proposed research paradigm. Termination requirements (1): include all subsequence’s; termination condition (2): confirm that all patterns in have been hydraulically constructed. SWMM stands for storm water management system [28]; TOV refers for total overflowing flow, and MFD refers for median flood timeframe. Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 32 No. 1 (2025) 74 https://internationalpubls.com A. METHODOLOGY AND DATASETS The portion explains the approaches utilized before implementing those towards a research location in “Dongying, Shandong Province, China”, like pattern choosing, hydraulic layout, and complicated network evaluation. B. METHODOLOGY The infrastructure of urban drainage systems primarily based upon a framework of design choosing and hydraulic planning, using complex network evaluation used further to enhance the network model. C. SELECTION OF LAYOUT Choosing a structure comprises deciding the spot as well as amount of water pipes, selecting suitable pipelines, and determining the pattern of flow of water. Graph theory techniques [17,25]. Aare commonly used to assist with layout selection. A network was made up of connections and vertices, where vertices also edges represent manholes and pipes, respectively. The starting graph contains every possible pipeline, as well as the loop-by-loop chopping approach is used to gradually remove edges from the undirected base graph to build a workable tree architecture [6,28]. Figure 2 depicts the process utilised in this study for layout selection, which involves the following steps: (1) creating the base graph G (V, E) and recognising every loops inside the main graph; (2) selecting a loop and eliminating a border from the loop while maintaining connectivity of the remaining edges; (3) checking for any remaining loops in the graph and repeating step (2); (4) obtaining every subgraphs which won’t comprise any loops (Fig. 2). Fig 2.Selection of Layout D. HYDRAULIC DESIGNING The hydraulic layout was generally utilized to determine the size and slopes in order to reduce the requirement of filling stations and pressurised pipelines. 1. OBJECTIVE FUNCTION Difficulty on optimising the urban drainage network might be described like follows: 1 ( , ) N i i i i i Minimize F C D H L = =  (1) Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 32 No. 1 (2025) 75 https://internationalpubls.com wherein F indicates the optimization technique, N signifies the overall numbers of pipelines𝑖: iD represent the diameter, iH is the submerged depths, and iL is the pipeline lengths. 2. DESIGN CONSTRAINTS The hydraulic layout of such urban drainage infrastructure should comply towards the appropriate flow velocity, pipe diameter, and buried depths restrictions: min maxD D D  (2) down upD D (3) 1 2 3{ }, , , ,s ZD D D D D D =  (4) min maxv v v  (5) min maxdh H dh  (6) In which minD represents the minimal pipeline diameter, maxD defines the maximal pipeline diameter, D represents the flowing pipeline diameter, downD denotes the downstream pipeline diameter, and upD represents the upstream pipeline diameter 𝑣 denotes the flow rates, minv seems to be the minimum flow speed, maxv seems to be the maximum flowing velocity, mindh seems to be the buried depths, 𝐻 denotes the depth buried, also maxdh represents its greatest depth buried. 3. EMPEROR PENGUIN OPTIMIZER The emperor penguin optimizer (EPO) method was indeed the unique meta-heuristic technique invented by Dhiman around 2018 that is motivated from emperor penguin huddling habits. Emperor penguins snuggle together just to stay warm during the hard Antarctic winters, when temperatures might drop below dangerously lower degrees. The huddling activity of emperor penguins was distinctive and also is affected by a variety of elements such like distance, temperature, and efficient movements inside the cuddle. The EPO methodology was founded on above and other parameters, with the observer and update equations emulating temperature and distance, respectively. This algorithm has been tested on several optimization problems and has shown to be effective. The basic goal of emperor penguin huddling is just to optimise the environmental temperatures inside the cuddle and preserve energy. The temperature T was proportional towards the huddle polygon R circle, which means that as the radius of the huddle increases, the temperature also increases. 𝑇 = { 0. 𝑖𝑓 𝑅 > 1 1. 𝑖𝑓 𝑅 < 1 , (7) T0is a temperature profile It's in charge of the drilling and extraction procedures. It really is calculated as specified: 0 , MI T T CI MI = − − (8) Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 32 No. 1 (2025) 76 https://internationalpubls.com where 0T represents the temperature distributions surrounding the cluster, MI represents the maximal quantity of repetitions, and represents the current iteration CI . The separation among the best-determined optimum approach and the emperor penguin Whenever the huddle boundary was formed, D gets calculated. ,( ) ( ) ). (.epD S A P x C P x= − (9) Where, ( )S A denotes emperor penguin social forces. ( )P x signifies the emperor penguin's current position vector. 𝐴, 𝐶denotes neighbour anti-collision factors. ( )epP x signifies the vector of most optimum solutions discovered. A and C are in charge of fine-tuning the distance D, and they may be computed using the following equations: 1,C rand= (10) 0 2 0)( ,( )gA M T P ac rand T=  +  − (11) ) ,( ( ) ( )g epP ac P x P x= − (12) Where,𝑀 is the mobility parameter that maintains a collision distance between search agents’ avoidance. The polygon grid accuracy is defined as ( )gP ac by comparing the difference between emperor and penguins. The calculation of S(A), which directs the optimal search agent towards the best direction, can be determined using Equation (13). On the other hand, Equation (14) is used to update the position of the search agent. ( ) 2 / ,( ) . x l xS A f e e− −= − (13) ,( ( )1) epP x P x A D+ = −  (14) where f and l are parameters that influence exploration and exploitation. P(x+1) indicates the emperor penguin's next updated position. Table 1 shows the proposed values for the parameters utilised in the EPO algorithm, according to [1]. Figure 3 depicts the “flow chart of the EPO algorithm”, whereas following are the major processes in executing EPO: Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 32 No. 1 (2025) 77 https://internationalpubls.com Table 1: Parameter settings for the emperor penguin optimizer (EPO) algorithm [1]. Parameter M Rand 1 Rand 2 f l Minimum value Set to 2 0 0 2 1.5 Maximum value 1 1 3 2 Step 1:Set the starting variables for rand1, rand2, R, T, T0, A, C, S(A), M, f, and l. Step 2:produce initial values for important parameters P(x) and compute their fitness values (objective function). Step 3:determine the best initial optimum solution based on the computed fitness. Step 4:Begin the first iteration by computing the new T0, S(A), Pg(ac), and A values. Step 5:Determine the amount of D and apply it to the best option. Pep(x) is used to compute the new and updated solutionsP(x+1). Step 6:choose the greatest new ideal solution and save it in Pep (x). Moreover, save the appropriate best fitness. Step 7:If the iterations have not ended, return to Step 4 and repeat until the maximum number of iterations has been achieved. Step 8:Examine the fitness array to discover the best fitness and present the answer. Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 32 No. 1 (2025) 78 https://internationalpubls.com Figure 3. Flow chart of EPO A. EVALUATION OF COMPLEX NETWORK Acomplex two-layer networking evaluation was created, comprising a global networking examination conducted to every nodes as well as a local system evaluation performed to every node independently (Fig. 4). Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 32 No. 1 (2025) 79 https://internationalpubls.com Fig. 4The connection among global networking evaluation and local networks evaluation B. GLOBAL NETWORK ANALYSIS The application of global network evaluation can be useful in identifying crucial nodes in urban drainage systems. closeness centrality, like as betweenness centrality and Centrality measures [2,5] are commonly used to evaluate the role of specific nodes in the network and their impact on the overall system. For large water distribution systems, the demand can be estimated using betweenness centrality [22]. In sewage systems, the edge betweenness centrality [8] can be adjusted to indicate what regularly an edge appears inside the quickest route among the supply vertices as well as the output. The research makes specific changes towards the centrality measurements. Betweenness centrality was characterised by the frequency that a particular node emerges upon that network's smallest route. Closeness centrality, on the opposite hand, was determined as such average distances from a nodes towards the exit. These modifications can help to further analyze and identify the “critical nodes inside the urban drainage system. ( ) ( ) st B s t v V st v C v     =  (15) 𝐶𝑐(𝑣) = 1 ∑ 𝑑𝐺(𝑣,𝑡)𝑡∈𝐺 (16) 𝐼 = 𝑤1 × 𝐶𝐵(𝑣) + 𝑤2 × 𝐶𝑐(𝑣) (17) where ( )BC v is the centrality betweenness; s, v, t are nodes; V denotes the node set; ( )st v denotes the number of shortest pathways from s to t through v; st denotes the number of shortest paths from s to t; 𝐶𝑐(𝑣) is the centrality of proximity; G is the graph; 𝑑𝐺(𝑣, 𝑡) is the shortest path linking nodes v and t in G; I is node value; and 𝑤1and 𝑤2are weights calculated by the Analytic Hierarchy Process. 𝑤1is 0.2 and w𝑤2 is 0.8 in this investigation”. Analytic Hierarchy Process analysis was performed Zhang [30]. 4. EVALUATION OF LOCAL NETWORK Local network evaluation, that comprises degree (d), indegree ( ind ), out-degree ( outd ), as well as the maximum degree ( md ), was a concentrated Evaluation of nodes having greater scores resulting on global system evaluation. The degree indicates how numerous edges were connected toward a node. Communications on Applied Nonlinear Analysis ISSN: 1074-133X Vol 32 No. 1 (2025) 80 https://internationalpubls.com In-degree represents how all those sides approach the cluster; out-degree represents how often edges leave the cluster; and maximal degree represents the maximal amount of edgesthat may connect to the node: in outd d d= + (18) If d = dm, redundancies may be raised; otherwise, redundancy can indeed be enhancedif d