Parallel Dynamic Optimization of Steel Risers

2010 ◽  
Vol 133 (1) ◽  
Author(s):  
Rafael L. Tanaka ◽  
Clóvis de A. Martins
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Natural Selection ◽  
Dynamic Optimization ◽  
Solution Space ◽  
Optimization Method ◽  
Optimization Techniques ◽  
Objective Functions ◽  
Definition Of

This paper addresses the use of optimization techniques in the design of a steel riser. Two methods are used: the genetic algorithm, which imitates the process of natural selection, and the simulated annealing, which is based on the process of annealing of a metal. Both of them are capable of searching a given solution space for the best feasible riser configuration according to predefined criteria. Optimization issues are discussed, such as problem codification, parameter selection, definition of objective function, and restrictions. A comparison between the results obtained for economic and structural objective functions is made for a case study. Optimization method parallelization is also addressed.

Comparative study of genetic algorithm and simulated annealing for optimal tolerance design formulated with discrete and continuous variables

2005 ◽  
Vol 219 (10) ◽  
pp. 735-758 ◽  
Author(s):  
P K Sing ◽  
S C Jain ◽  
P K Jain
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Design Problem ◽  
Optimal Solution ◽  
Solution Space ◽  
Optimization Techniques ◽  
Manufacturing Processes ◽  
Tolerance Design ◽  
Solution Algorithms ◽  
Selection Of

Optimal tolerance design has been the focus of extensive research for a few decades. This has resulted in several formulations and solution algorithms for systematic tolerance design considering various aspects. Availability of different alternative manufacturing processes or machines for realization of a dimension is frequently encountered. In such cases optimal tolerance design must also consider optimal selection of a set of manufacturing processes or machines as appropriate. Such a non-linear multivariate optimal tolerance design problem results in a combinatorial and multi-modal solution space. Optimal solution of this advanced tolerance design problem is difficult using traditional optimization techniques. The problem formulation becomes more complex with simultaneous selection of design and manufacturing tolerances. The focus of the current research is on the optimal solution of this advanced and complex tolerance design problem. Genetic algorithm and simulated annealing as non-traditional global optimization techniques have been used to obtain the solution. Application of the solution techniques has been demonstrated with the help of appropriate examples. Comparison of the results establishes that the genetic algorithm is the superior of the two approaches.

Optimization Method RasID-GA for Numerical Constrained Optimization Problems

2007 ◽  
Vol 11 (5) ◽  
pp. 469-477 ◽  
Author(s):  
Dongkyu Sohn ◽  
◽  
Shingo Mabu ◽  
Kotaro Hirasawa ◽  
Jinglu Hu
Keyword(s):  
Genetic Algorithm ◽  
Constrained Optimization ◽  
Optimization Problems ◽  
Random Search ◽  
Optimal Solution ◽  
Solution Space ◽  
Optimization Method ◽  
Penalty Functions ◽  
Objective Functions ◽  
Constrained Optimization Problems

This paper proposes Adaptive Random search with Intensification and Diversification combined with Genetic Algorithm (RasID-GA) for constrained optimization. In the previous work, we proposed RasID-GA which combines the best properties of RasID and Genetic Algorithm for unconstrained optimization problems. In general, it is very difficult to find an optimal solution for constrained optimization problems because their feasible solution space is very limited and they should consider the objective functions and constraint conditions. The conventional constrained optimization methods usually use penalty functions to solve given problems. But, it is generally recognized that the penalty function is hard to handle in terms of the balance between penalty functions and objective functions. In this paper, we propose a constrained optimization method using RasID-GA, which solves given problems without using penalty functions. The proposed method is tested and compared with Evolution Strategy with Stochastic Ranking using well-known 11 benchmark problems with constraints. From the Simulation results, RasID-GA can find an optimal solution or approximate solutions without using penalty functions.

scholarly journals CONSTRUCTAL DESIGN AND SIMULATED ANNEALING EMPLOYED FOR GEOMETRIC OPTIMIZATION OF A Y-SHAPED CAVITY INTRUDED INTO CONDUCTIVE WALL

2015 ◽  
Vol 14 (1) ◽  
pp. 79
Author(s):  
G. V. Gonzales ◽  
E. D. Dos Santos ◽  
L. R. Emmendorfer ◽  
L. A. Isoldi ◽  
E. S. D. Estrada ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Solid Wall ◽  
Internal Heat ◽  
Optimization Methods ◽  
Optimization Method ◽  
Internal Heat Generation ◽  
Geometric Optimization ◽  
Constructal Design ◽  
Optimal Shapes

he problem study here is concerned with the geometrical evaluation of an isothermal Y-shaped cavity intruded into conducting solid wall with internal heat generation. The cavity acts as a sink of the heat generated into the solid. The main purpose here is to minimize the maximal excess of temperature (θmax) in the solid. Constructal Design, which is based on the objective and constraints principle, is employed to evaluate the geometries of Y-shaped cavity. Meanwhile, Simulated Annealing (SA) algorithm is employed as optimization method to seek for the best shapes. To validate the SA methodology, the results obtained with SA are compared with those achieved with Genetic Algorithm (GA) and Exaustive Search (ES) in recent studies of literature. The comparison between the optimization methods (SA, GA and ES) showed that Simulated Annealing is highly effective in the search for the optimal shapes of the studied case.

Application of Genetic Algorithms in Inventory Control

2016 ◽  
pp. 1087-1098
Author(s):  
Vinod Kumar Mishra
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Natural Selection ◽  
Inventory Control ◽  
Future Trend ◽  
Production Engineering ◽  
Mathematical Sciences ◽  
Adaptive Heuristic ◽  
Definition Of ◽  
Key Terms

The genetic algorithm (GA) is an adaptive heuristic search procedures based on the mechanics of natural selection and natural genetics. Inventory control is widely used in the area of mathematical sciences, management sciences; system science, industrial engineering, production engineering etc. but they have wide differences in mathematical and computation maturity. This chapter enables the reader to understand the basic theory of genetic algorithm and how to apply the genetic algorithms for optimizing the parameters in inventory control The current and future trend of the research with the definition of key terms of genetic algorithm has also incorporated in this chapter.

An Approach to Improved Decentralized Design: The Modified Approximation-Based Decentralized Design (MADD) Framework

2007 ◽  
Author(s):  
Ashwin P. Gurnani ◽  
Kemper Lewis
Keyword(s):  
Nash Equilibrium ◽  
Bounded Rationality ◽  
Large Scale ◽  
Optimization Techniques ◽  
Objective Functions ◽  
Design Problems ◽  
Decentralized Design ◽  
The Impact ◽  
Rational Reaction Set

The design of large scale complex engineering systems requires interaction and communication between multiple disciplines and decentralized subsystems. One common fundamental assumption in decentralized design is that the individual subsystems only exchange design variable information and do not share objective functions or gradients. This is because the decentralized subsystems can either not share this information due to geographical constraints or choose not to share it due to corporate secrecy issues. Game theory has been used to model the interactions between distributed design subsystems and predict convergence and equilibrium solutions. These game theoretic models assume that designers make perfectly rational decisions by selecting solutions from their Rational Reaction Set (RRS), resulting in a Nash Equilibrium solution. However, empirical studies reject the claim that decision makers always make rational choices and the concept of Bounded Rationality is used to explain such behavior. In this paper, a framework is proposed that uses the idea of bounded rationality in conjunction with set-based design, metamodeling and multiobjective optimization techniques to improve solutions for convergent decentralized design problems. Through the use of this framework, entitled Modified Approximation-based Decentralized Design (MADD) framework, convergent decentralized design problems converge to solutions that are superior to the Nash equilibrium. A two subsystem mathematical problem is used as case study and simulation techniques are used to study the impact of the framework parameters on the final solution. The discipline specific objective functions within the case study problem are unconstrained and continuous — however, the implementation of the MADD framework is not restricted to such problems.

Adaptive Random Search with Intensification and Diversification Combined with Genetic Algorithm

2006 ◽  
Vol 10 (6) ◽  
pp. 921-930 ◽  
Author(s):  
Dongkyu Sohn ◽  
◽  
Hiroyuki Hatakeyama ◽  
Shingo Mabu ◽  
Kotaro Hirasawa ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Random Search ◽  
Optimization Method ◽  
Objective Functions ◽  
Adaptive Random Search ◽  
Searching Ability

A novel optimization method named RasID-GA (an abbreviation of Adaptive Random Search with Intensification and Diversification combined with Genetic Algorithm) is proposed in order to enhance the searching ability of conventional RasID, which is a kind of Random Search with Intensification and Diversification. In this paper, the timing of switching from RasID to GA, or from GA to RasID is also studied. RasID-GA is compared with parallel RasIDs and GA using 23 different objective functions, and it turns out that RasID-GA performs well compared with other methods.

The Application and Comparison of Two Different Optimization Algorithms in the Optimization Design of Hydrofoil

2012 ◽  
Vol 178-181 ◽  
pp. 2871-2876
Author(s):  
Chao Wang ◽  
Feng Feng ◽  
Xin Chang ◽  
Chun Yu Guo ◽  
Yang Hao Liu
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Optimization Design ◽  
Simulated Annealing Algorithm ◽  
Optimization Algorithms ◽  
Optimization Method ◽  
Flow Solver ◽  
Propeller Design ◽  
Section Design ◽  
Annealing Algorithm

Hydrofoil is the important part of ship design and diverse motion equipment. The optimization design of hydrofoil section on lift-to-drag radio with genetic algorithm (GA) and simulated annealing algorithm are demonstrated, and the method on the hydrofoil section design of the propeller design will be done. Objective function and fitness of every individual are provided by flow solver of panel method. The optimization method on design of hydrofoil section on lift-to-drag is successfully used. The optimization results show the combination of optimization algorithm is feasible at the optimal design of hydrofoil sections. What’s more, a comparison between two different optimization algorithms is made, a conclusion that the simulated annealing algorithm is better then the genetic algorithm is obtained.

scholarly journals Optimizing Virtual Private Network Design Using a New Heuristic Optimization Method

2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Hongbing Lian ◽  
András Faragó
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Design Optimization ◽  
Optimization Problem ◽  
Optimization Methods ◽  
Optimization Method ◽  
Virtual Private Network ◽  
Successful Model ◽  
Search Speed ◽  
Private Network

In virtual private network (VPN) design, the goal is to implement a logical overlay network on top of a given physical network. We model the traffic loss caused by blocking not only on isolated links, but also at the network level. A successful model that captures the considered network level phenomenon is the well-known reduced load approximation. We consider here the optimization problem of maximizing the carried traffic in the VPN. This is a hard optimization problem. To deal with it, we introduce a heuristic local search technique called landscape smoothing search (LSS). This study first describes the LSS heuristic. Then we introduce an improved version called fast landscape smoothing search (FLSS) method to overcome the slow search speed when the objective function calculation is very time consuming. We apply FLSS to VPN design optimization and compare with well-known optimization methods such as simulated annealing (SA) and genetic algorithm (GA). The FLSS achieves better results for this VPN design optimization problem than simulated annealing and genetic algorithm.

scholarly journals Implementation of Genetic Algorithms and Momentum Backpropagation in Classification of Subtype Cells Acute Myeloid Leukimia

2020 ◽  
Vol 14 (2) ◽  
pp. 189
Author(s):  
Dian Mustikaningrum ◽  
Retantyo Wardoyo
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
White Blood Cells ◽  
Optimization Method ◽  
Optimization Techniques ◽  
Learning Rate ◽  
Algorithm Optimization ◽  
Selection Parameter ◽  
Acute Myeloid ◽  
Random Trial

 Acute Myeloid Leukimia (AML) is a type of cancer which attacks white blood cells from myeloid. AML subtypes M1, M2, and M3 are affected by the same type of cells called myeloblasts, so it needs more detailed analysis to classify.Momentum Backpropagation  is used to classified. In its application, optimal selection of architecture, learning rate, and momentum is still done by random trial. This is one of the disadvantage of Momentum Backpropagation. This study uses a genetic algorithm (GA) as an optimization method to get the best architecture, learning rate, and momentum of artificial neural network. Genetic algorithms are one of the optimization techniques that emulate the process of biological evolution.The dataset used in this study is numerical feature data resulting from the segmentation of white blood cell images taken from previous studies which has been done by Nurcahya Pradana Taufik Prakisya. Based on these data, an evaluation of the Momentum Backpropagation process was conducted the selection parameter in a random trial with the genetic algorithm. Furthermore, the comparison of accuracy values was carried out as an alternative to the ANN learning method that was able to provide more accurate values with the data used in this study.The results showed that training and testing with genetic algorithm optimization of ANN parameters resulted in an average memorization accuracy of 83.38% and validation accuracy of 94.3%. Whereas in other ways, training and testing with momentum backpropagation random trial resulted in an average memorization accuracy of 76.09% and validation accuracy of 88.22%.

scholarly journals A new model for logistic and transportation of fashion goods in the presence of stochastic market demands considering restricted retailers capacity

2019 ◽  
Author(s):  
Aidin Delgoshaei ◽  
Hengameh Norozi ◽  
Abolfazl Mirzazadeh ◽  
Maryam Farhadi ◽  
Golnaz Hooshmand Pakdel ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Case Studies ◽  
Programming Model ◽  
Real Data ◽  
Objective Functions ◽  
Mathematical Programming Model ◽  
Multi Objective ◽  
Scheduling Method ◽  
Stochastic Market

In today’s world, using fashion goods is a vital of human. In this research, we focused on developing a scheduling method for distributing and selling fashion goods in a multi-market/multi-retailer supply chain while the product demands in markets are stochastic. For this purpose, a new multi-objective mathematical programming model is developed where maximizing the profit of selling fashion goods and minimizing delivering time and customer’s dissatisfaction are considered as objective functions. In continue due to the complexity of the problem, a number of metaheuristics are compared and a hybrid of Non-dominated Sorting Genetic Algorithm II (NSGAII) and simulated annealing is selected for solving the case studies. Then, in order to find the best values for input parameters of the algorithm, a Taguchi method is applied. In continue, a number of case studies are selected from literature review and solved by the algorithm. The outcomes are analyzed and it is found that using multi-objective models can find more realistic solutions. Then, the model is applied for a case study with real data from industry and outcomes showed that the proposed algorithm can be successfully applied in practice.

Sign in / Sign up

Export Citation Format

Share Document