scholarly journals Ship Pipe Routing Design Using NSGA-II and Coevolutionary Algorithm

2016 ◽  
Vol 2016 ◽  
pp. 1-21 ◽  
Author(s):  
Wentie Niu ◽  
Haiteng Sui ◽  
Yaxiao Niu ◽  
Kunhai Cai ◽  
Weiguo Gao

Pipe route design plays a prominent role in ship design. Due to the complex configuration in layout space with numerous pipelines, diverse design constraints, and obstacles, it is a complicated and time-consuming process to obtain the optimal route of ship pipes. In this article, an optimized design method for branch pipe routing is proposed to improve design efficiency and to reduce human errors. By simplifying equipment and ship hull models and dividing workspace into three-dimensional grid cells, the mathematic model of layout space is constructed. Based on the proposed concept of pipe grading method, the optimization model of pipe routing is established. Then an optimization procedure is presented to deal with pipe route planning problem by combining maze algorithm (MA), nondominated sorting genetic algorithm II (NSGA-II), and cooperative coevolutionary nondominated sorting genetic algorithm II (CCNSGA-II). To improve the performance in genetic algorithm procedure, a fixed-length encoding method is presented based on improved maze algorithm and adaptive region strategy. Fuzzy set theory is employed to extract the best compromise pipeline from Pareto optimal solutions. Simulation test of branch pipe and design optimization of a fuel piping system were carried out to illustrate the design optimization procedure in detail and to verify the feasibility and effectiveness of the proposed methodology.

Multi-Region Combined Heat and Power Economic Emission Dispatch (MRCHPEED) is an important chore in operational and planning problem. The valve point impact and restricted useful zone of regular thermal generators have been contemplated. In this work, Nondominated Sorting Genetic Algorithm-II (NSGA-II) is proposed for illuminating confounded MRCHPEED problem where power and heat generations have been distributed amongst the all committed units so that fuel cost and outflow echelon have been streamlined in chorus though gratifying every single operational requirement. The research consequence of a two-region investigation framework achieved from the prescribed technique are coordinated up to those acquired from Strength Pareto Evolutionary Algorithm 2 (SPEA 2).


2022 ◽  
Vol 204 ◽  
pp. 111999
Author(s):  
Hanting Wu ◽  
Yangrui Huang ◽  
Lei Chen ◽  
Yingjie Zhu ◽  
Huaizheng Li

2012 ◽  
Vol 2012 ◽  
pp. 1-8 ◽  
Author(s):  
K. Vijayakumar

Congestion management is one of the important functions performed by system operator in deregulated electricity market to ensure secure operation of transmission system. This paper proposes two effective methods for transmission congestion alleviation in deregulated power system. Congestion or overload in transmission networks is alleviated by rescheduling of generators and/or load shedding. The two objectives conflicting in nature (1) transmission line over load and (2) congestion cost are optimized in this paper. The multiobjective fuzzy evolutionary programming (FEP) and nondominated sorting genetic algorithm II methods are used to solve this problem. FEP uses the combined advantages of fuzzy and evolutionary programming (EP) techniques and gives better unique solution satisfying both objectives, whereas nondominated sorting genetic algorithm (NSGA) II gives a set of Pareto-optimal solutions. The methods propose an efficient and reliable algorithm for line overload alleviation due to critical line outages in a deregulated power markets. The quality and usefulness of the algorithm is tested on IEEE 30 bus system.


2020 ◽  
Vol 2020 ◽  
pp. 1-12 ◽  
Author(s):  
Maoqing Zhang ◽  
Lei Wang ◽  
Zhihua Cui ◽  
Jiangshan Liu ◽  
Dong Du ◽  
...  

Fast nondominated sorting genetic algorithm II (NSGA-II) is a classical method for multiobjective optimization problems and has exhibited outstanding performance in many practical engineering problems. However, the tournament selection strategy used for the reproduction in NSGA-II may generate a large amount of repetitive individuals, resulting in the decrease of population diversity. To alleviate this issue, Lévy distribution, which is famous for excellent search ability in the cuckoo search algorithm, is incorporated into NSGA-II. To verify the proposed algorithm, this paper employs three different test sets, including ZDT, DTLZ, and MaF test suits. Experimental results demonstrate that the proposed algorithm is more promising compared with the state-of-the-art algorithms. Parameter sensitivity analysis further confirms the robustness of the proposed algorithm. In addition, a two-objective network topology optimization model is then used to further verify the proposed algorithm. The practical comparison results demonstrate that the proposed algorithm is more effective in dealing with practical engineering optimization problems.


Symmetry ◽  
2020 ◽  
Vol 12 (2) ◽  
pp. 260 ◽  
Author(s):  
Radosław Winiczenko ◽  
Krzysztof Górnicki ◽  
Agnieszka Kaleta

A precise determination of the mass diffusion coefficient and the mass Biot number is indispensable for deeper mass transfer analysis that can enable finding optimum conditions for conducting a considered process. The aim of the article is to estimate the mass diffusion coefficient and the mass Biot number by applying nondominated sorting genetic algorithm (NSGA) II genetic algorithms. The method is used in drying. The maximization of coefficient of correlation (R) and simultaneous minimization of mean absolute error (MAE) and root mean square error (RMSE) between the model and experimental data were taken into account. The Biot number and moisture diffusion coefficient can be determined using the following equations: Bi = 0.7647141 + 10.1689977s − 0.003400086T + 948.715758s2 + 0.000024316T2 − 0.12478256sT, D = 1.27547936∙10−7 − 2.3808∙10−5s − 5.08365633∙10−9T + 0.0030005179s2 + 4.266495∙10−11T2 + 8.33633∙10−7sT or Bi = 0.764714 + 10.1689091s − 0.003400089T + 948.715738s2 + 0.000024316T2 − 0.12478252sT, D = 1.27547948∙10−7 − 2.3806∙10−5s − 5.08365753∙10−9T + 0.0030005175s2 + 4.266493∙10−11T2 + 8.336334∙10−7sT. The results of statistical analysis for the Biot number and moisture diffusion coefficient equations were as follows: R = 0.9905672, MAE = 0.0406375, RMSE = 0.050252 and R = 0.9905611, MAE = 0.0406403 and RMSE = 0.050273, respectively.


2020 ◽  
Author(s):  
Jing Xu ◽  
François Anctil ◽  
Marie-Amélie Boucher

Abstract. Forecast uncertainties are unfortunately inevitable when conducting the deterministic analysis of a dynamical system. The cascade of uncertainty originates from different components of the forecasting chain, such as the chaotic nature of the atmosphere, various initial conditions and boundaries, inappropriate conceptual hydrologic modeling, and the inconsistent stationarity assumption in a changing environment. Ensemble forecasting proves to be a powerful tool to represent error growth in the dynamical 5 system and to capture the uncertainties associated with different sources. However, space still exists for improving their predictive skill and credibility through proper hydrologic post-processing. We tested the post-processing skills of Affine kernel dressing (AKD) and Non-dominated sorting genetic algorithm II (NSGA-II). Those two methods are theoretically/technically distinct, yet however, share the same feature that both of them relax the parametric assumption of the underlying distribution of the data (i.e., streamflow ensemble forecast). AKD transformed ensemble and the Pareto fronts 10 generated with NSGA-II demonstrated the superiority of post-processed ensemble in efficiently eliminating forecast biases and maintaining a proper dispersion with the increasing forecasting horizon.


2018 ◽  
Vol 8 (11) ◽  
pp. 2253 ◽  
Author(s):  
Yang Xue

In many areas, such as mobile robots, video games and driverless vehicles, path planning has always attracted researchers’ attention. In the field of mobile robotics, the path planning problem is to plan one or more viable paths to the target location from the starting position within a given obstacle space. Evolutionary algorithms can effectively solve this problem. The non-dominated sorting genetic algorithm (NSGA-II) is currently recognized as one of the evolutionary algorithms with robust optimization capabilities and has solved various optimization problems. In this paper, NSGA-II is adopted to solve multi-objective path planning problems. Three objectives are introduced. Besides the usual selection, crossover and mutation operators, some practical operators are applied. Moreover, the parameters involved in the algorithm are studied. Additionally, another evolutionary algorithm and quality metrics are employed for examination. Comparison results demonstrate that non-dominated solutions obtained by the algorithm have good characteristics. Subsequently, the path corresponding to the knee point of non-dominated solutions is shown. The path is shorter, safer and smoother. This path can be adopted in the later decision-making process. Finally, the above research shows that the revised algorithm can effectively solve the multi-objective path planning problem in static environments.


2017 ◽  
Vol 2017 ◽  
pp. 1-17 ◽  
Author(s):  
Vimal Savsani ◽  
Vivek Patel ◽  
Bhargav Gadhvi ◽  
Mohamed Tawhid

Most of the modern multiobjective optimization algorithms are based on the search technique of genetic algorithms; however the search techniques of other recently developed metaheuristics are emerging topics among researchers. This paper proposes a novel multiobjective optimization algorithm named multiobjective heat transfer search (MOHTS) algorithm, which is based on the search technique of heat transfer search (HTS) algorithm. MOHTS employs the elitist nondominated sorting and crowding distance approach of an elitist based nondominated sorting genetic algorithm-II (NSGA-II) for obtaining different nondomination levels and to preserve the diversity among the optimal set of solutions, respectively. The capability in yielding a Pareto front as close as possible to the true Pareto front of MOHTS has been tested on the multiobjective optimization problem of the vehicle suspension design, which has a set of five second-order linear ordinary differential equations. Half car passive ride model with two different sets of five objectives is employed for optimizing the suspension parameters using MOHTS and NSGA-II. The optimization studies demonstrate that MOHTS achieves the better nondominated Pareto front with the widespread (diveresed) set of optimal solutions as compared to NSGA-II, and further the comparison of the extreme points of the obtained Pareto front reveals the dominance of MOHTS over NSGA-II, multiobjective uniform diversity genetic algorithm (MUGA), and combined PSO-GA based MOEA.


Author(s):  
Petr Krejci ◽  
Cestmir Ondrusek

Magnetic couplings (Figure 1) are widely used to torque transmission between two shafts without any mechanical contact. They are especially well suited for used in hazardous environments, to transmit torque through a separation wall. An additional advantage of a magnetic coupling is that slipping occurs when excessive torque is applied, this can be used to prevent mechanical failure due to torque overloads. This paper deals with influence of temperature on behavior of magnetic coupling and magnetic coupling design optimization. The permanent magnets that are used for torque transmission cannot be used close to Currie point, which is a point of loss of magnetic characteristics. We intend to use the magnetic coupling for pump of radioactive liquid materials for transmutation devices, where the temperature is close to four hundred centigrade. Because of we suggest the design changes for elimination of temperature influence. This paper presents the finite element (FE) parametric model of magnetic coupling, experimental verification of FE model and optimization of the inner part of magnetic coupling in order to increase the maximal torque. The genetic algorithm method in connection with FEM model of magnetic coupling was used for the design optimization procedure.


Sign in / Sign up

Export Citation Format

Share Document