Methodology for Pipeline Route Selection Using the NSGA II and Distance Transform Algorithms

Author(s):  
Sigurjon N. Kjaernested ◽  
Magnus Th. Jonsson ◽  
Halldor Palsson

The objective of this study is to develop a methodology for use in geothermal pipeline route selection. Special emphasis is placed on finding the shortest route and minimizing the visual affects of the pipeline. Two different approaches are taken to solving the problem. In the first method a distance transform algorithm is used both for visual effects ranking and to obtain the optimal path. Subsequently a genetic algorithm is used to modify the route with regards to necessary expansion units. Included in the tool is site selection for separators and pipeline gathering points based on visual effects, incline, inaccessible areas and total distance to boreholes. The second method uses the Non-dominated sorting genetic algorithm II (NSGA II) to obtain the optimal path with regards visual effects, route length and pipeline gradient. This method uses the distance transform ranking method along with constraints on route length to generate the initial population for the genetic algorithm. The methods are implemented for the Hverahlið geothermal area.

2021 ◽  
Author(s):  
Subrata Bhowmik

Abstract Optimal route selection for the subsea pipeline is a critical task for the pipeline design process, and the route selected can significantly affect the overall project cost. Therefore, it is necessary to design the routes to be economical and safe. On-bottom stability (OBS) and fixed obstacles like existing crossings and free spans are the main factors that affect the route selection. This article proposes a novel hybrid optimization method based on a typical Machine Learning algorithm for designing an optimal pipeline route. The proposed optimal route design is compared with one of the popular multi-objective optimization method named Genetic Algorithm (GA). The proposed pipeline route selection method uses a Reinforcement Learning (RL) algorithm, a particular type of machine learning method to train a pipeline system that would optimize the route selection of subsea pipelines. The route optimization tool evaluates each possible route by incorporating Onbottom stability criteria based on DNVGL-ST-109 standard and other constraints such as the minimum pipeline route length, static obstacles, pipeline crossings, and free-span section length. The cost function in the optimization method simultaneously handles the minimization of length and cost of mitigating procedures. Genetic Algorithm, a well established optimization method, has been used as a reference to compare the optimal route with the result from the proposed Reinforcement Learning based optimization method. Three different case studies are performed for finding the optimal route selection using the Reinforcement Learning (RL) approach considering the OBS criteria into its cost function and compared with the Genetic Algorithm (GA). The RL method saves upto 20% pipeline length for a complex problem with 15 crossings and 31 free spans. The RL optimization method provides the optimal routes, considering different aspects of the design and the costs associated with the various factors to stabilize a pipeline (mattress, trenching, burying, concrete coating, or even employing a more massive pipe with additional steel wall thickness). OBS criteria significantly influence the best route, indicating that the tool can reduce the pipeline's design time and minimize installation and operational costs of the pipeline. Conventionally the pipeline route optimization is performed by a manual process where the minimum roule length and static obstacles are considered to find an optimum route. The engineering is then performed to fulfill the criteria of this route, and this approach may not lead to an optimized engineering cost. The proposed Reinforced Learning method for route optimization is a mixed type, faster, and cost-efficient approach. It significantly minimizes the pipeline's installation and operational costs up to 20% of the conventional route selection process.


2017 ◽  
Vol 37 (3) ◽  
pp. 261-270 ◽  
Author(s):  
Du Lin ◽  
Bo Shen ◽  
Yurong Liu ◽  
Fuad E. Alsaadi ◽  
Ahmed Alsaedi

Purpose The purpose of this paper is to improve the performance of the genetic algorithm-based compliant robot path planning (GACRPP) in complex dynamic environment by proposing an improved bidirectional rapidly exploring random tree (Bi-RRT)-based population initialization method. Design/methodology/approach To achieve GACRPP in complex dynamic environment with high performance, an improved Bi-RRT-based population initialization method is proposed. First, the grid model is adopted to preprocess the working space of mobile robot. Second, an improved Bi-RRT is proposed to create multi-cluster connections between the starting point and the goal point. Third, the backtracking method is used to generate the initial population based on the multi-cluster connections generated by the improved Bi-RRT. Subsequently, some comparative experiments are implemented where the performances of the improved Bi-RRT-based population initialization method are compared with other population initialization methods, and the comparison results of the improved genetic algorithm (IGA) combining with the different population initialization methods are shown. Finally, the optimal path is further smoothed with the help of the technique of quadratic B-spline curves. Findings It is shown in the experiment results that the improved Bi-RRT-based population initialization method is capable of deriving a more diversified initial population with less execution time and the IGA combining with the proposed population initialization method outperforms the one with other population initialization methods in terms of the length of optimal path and the execution time. Originality/value In this paper, the Bi-RRT is introduced as a population initialization method into the GACRPP problem. An improved Bi-RRT is proposed for the purpose of increasing the diversity of initial population. To characterize the diversity of initial population, a new notion of breadth is defined in terms of Hausdorff distance between different paths.


2011 ◽  
Vol 338 ◽  
pp. 106-110
Author(s):  
Guang Li ◽  
Wen Tie Niu ◽  
Da Wei Zhang ◽  
Wei Guo Gao

The automatic generation of flow path is the key and most difficult task in Hydraulic Manifold Blocks (HMB) design. This paper divides the HMB layout space into grids, and sets the HMB boundaries and existing flow paths to obstacles, and the paths generated using maze algorithm are regarded as the initial population of genetic algorithm. The optimal path with the shortest path and least turnings can be obtained using genetic algorithm. The ports of flow path can be connected after the generation of technical holes based on the blind holes. The design parameters of holes, such as starting point coordinates, orientations and depths, can be obtained through a series of algorithms, and then drive the secondary development system HMBDesigner based on SolidWorks to generate three-dimensional solid model. This paper also discusses the generation method of multi-port flow path and multiple flow paths.


2010 ◽  
Vol 121-122 ◽  
pp. 792-796 ◽  
Author(s):  
Chun Lei Zhang

The traditional algorithms of shortest path, different path and etc can only solve the path optimization problems of static network. Based on the fact of actual transport network as dynamic random network, the paper used method of shortest route to optimize the path. The solution of shortest route was on the basis of genetic algorithm. The paper designed operators of crossover, mutation and selection. In addition, the specific example of dynamic random network route selection based on the proposed algorithm also verified the feasibility of the algorithm.


2014 ◽  
Vol 998-999 ◽  
pp. 789-792 ◽  
Author(s):  
Yu Zhong Liu ◽  
Hua Ping Yu ◽  
Bing Huang ◽  
Yuan Fang Zhang

Optimal path selection is a fundamental problem in tourism, the influence factors of which only including the rout length, but also including weather, transportation and the scenery of attractions and other relevant factors. Therefore, route selection only based on the route length cannot capture the actual requirement. The paper studies the multi-weights (such as weather, route length, attractions scenery and etc.) in route selection, and then proposed an improved ant colony algorithm based on multi-weights (ACA-MW), which uses the multi-weights ant and the genetic variation to search optimal path. Simulated experiment of the ACA-MW shows high performance, the improved algorithm is effective. In tourism, ACA-MW can do well in optimal path selection problem.


2020 ◽  
Vol 12 (18) ◽  
pp. 7318
Author(s):  
Wei Meng ◽  
Xiufen Zhang

End-of-life (EOL) electromechanical products often have multiple failure characteristics and material hazard attributes. These factors create uncertain disassembly task sequences and affect the remanufacturing cost, environmental sustainability, and disassembly efficiency of the remanufacturing disassembly line system. To address this problem, a novel multi-constraint remanufacturing disassembly line balancing model (MC-RDLBM) is constructed in this article, which accounts for the failure characteristics of the parts and material hazard constraints. To assign the disassembly task reasonably, a disassembly priority decision-making model was presented to describe the relationship between the failure layer, the material hazards layer, and the economic feasibility layer. Furthermore, the multi-objective non-dominated sorting genetic algorithm II (NSGA-II) optimization for the MC-RDLBM is improved. To increase the convergence speed of the algorithm, an initial population construction method is designed, which includes the component failure and material hazards. Moreover, a novel genetic algorithm evolution rule with a Pareto non-dominant relation and crowded distance constraint is established, which expands the search scope of the chromosome’s autonomous evolution and avoids local convergence. Furthermore, a Pareto grade-based evaluation strategy for non-dominant solutions is proposed to eliminate the invalid remanufacturing disassembly task sequences. Finally, a case study verified the effectiveness and feasibility of the proposed method.


Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 344
Author(s):  
Alejandro Humberto García Ruiz ◽  
Salvador Ibarra Martínez ◽  
José Antonio Castán Rocha ◽  
Jesús David Terán Villanueva ◽  
Julio Laria Menchaca ◽  
...  

Electricity is one of the most important resources for the growth and sustainability of the population. This paper assesses the energy consumption and user satisfaction of a simulated air conditioning system controlled with two different optimization algorithms. The algorithms are a genetic algorithm (GA), implemented from the state of the art, and a non-dominated sorting genetic algorithm II (NSGA II) proposed in this paper; these algorithms control an air conditioning system considering user preferences. It is worth noting that we made several modifications to the objective function’s definition to make it more robust. The energy-saving optimization is essential to reduce CO2 emissions and economic costs; on the other hand, it is desirable for the user to feel comfortable, yet it will entail a higher energy consumption. Thus, we integrate user preferences with energy-saving on a single weighted function and a Pareto bi-objective problem to increase user satisfaction and decrease electrical energy consumption. To assess the experimentation, we constructed a simulator by training a backpropagation neural network with real data from a laboratory’s air conditioning system. According to the results, we conclude that NSGA II provides better results than the state of the art (GA) regarding user preferences and energy-saving.


Author(s):  
Nawei Liu ◽  
Fei Xie ◽  
Zhenhong Lin ◽  
Mingzhou Jin

In this study, 98 regression models were specified for easily estimating shortest distances based on great circle distances along the U.S. interstate highways nationwide and for each of the continental 48 states. This allows transportation professionals to quickly generate distance, or even distance matrix, without expending significant efforts on complicated shortest path calculations. For simple usage by all professionals, all models are present in the simple linear regression form. Only one explanatory variable, the great circle distance, is considered to calculate the route distance. For each geographic scope (i.e., the national or one of the states), two different models were considered, with and without the intercept. Based on the adjusted R-squared, it was observed that models without intercepts generally have better fitness. All these models generally have good fitness with the linear regression relationship between the great circle distance and route distance. At the state level, significant variations in the slope coefficients between the state-level models were also observed. Furthermore, a preliminary analysis of the effect of highway density on this variation was conducted.


Sign in / Sign up

Export Citation Format

Share Document