scholarly journals An Optimal Design Methodology for the Trajectory of Hydraulic Excavators Based on Genetic Algorithm

2021 ◽  
Vol 33 (6) ◽  
pp. 1248-1254
Author(s):  
Takamichi Yuasa ◽  
◽  
Masato Ishikawa ◽  
Satoshi Ogawa
Keyword(s):  
Genetic Algorithm ◽  
Design Methodology ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Reaction Force ◽  
Ground Level ◽  
Optimization Method ◽  
Work Efficiency ◽  
Cost Index ◽  
Hydraulic Excavators

Hydraulic excavators are one type of construction equipment used in various construction sites worldwide, and their usage and scale are diverse. Generally, the work efficiency of a hydraulic excavator largely depends on human operation skills. If we can comprehend the experienced operation skills and utilize them for manual control assist, semi-automatic or automatic remote control, it would improve its work efficiency and suppress personnel costs, reduce the operator’s workload, and improve his/her safety. In this study, we propose a methodology to design efficient machine trajectories based on mathematical models and numerical optimization, focusing on ground-level excavation as a dominant task. First, we express its excavation trajectory using four parameters and assume the models for the amount of excavated soil and the reaction force based on our previous experiments. Next, we combine these models with a geometrical model for the hydraulic excavating machine. We then assign the amount of soil to a performance index preferably to be maximized and the amount of work to a cost index preferably to be minimized, both in the form of functions of the trajectory parameters, resulting in an optimization problem that trades them off. In particular, we formulate (1) a multi-objective optimization problem maximizing a weighted linear combination of the amount of soil and the amount of work as an objective function, and (2) a single-objective optimization problem maximizing the amount of soil under a given upper bound on the amount of work, so that we can solve these optimization problems using the genetic algorithm (GA). Finally, we conclude this paper by suggesting our notice on design methodology and discussing how we should provide the optimization method as mentioned above to the users who operate hydraulic excavators.

scholarly journals Genetic Algorithms as Computational Methods for Finite-Dimensional Optimization

2021 ◽  
pp. 5-14
Author(s):  
Nataliya Gulayeva ◽  
Volodymyr Shylo ◽  
Mykola Glybovets
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Numerical Methods ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Optimization Methods ◽  
Optimization Method ◽  
Direct Search ◽  
Mathematical Programming Problem ◽  
Combinatorial Optimization Problems

Introduction. As early as 1744, the great Leonhard Euler noted that nothing at all took place in the universe in which some rule of maximum or minimum did not appear [12]. Great many today’s scientific and engineering problems faced by humankind are of optimization nature. There exist many different methods developed to solve optimization problems, the number of these methods is estimated to be in the hundreds and continues to grow. A number of approaches to classify optimization methods based on various criteria (e.g. the type of optimization strategy or the type of solution obtained) are proposed, narrower classifications of methods solving specific types of optimization problems (e.g. combinatorial optimization problems or nonlinear programming problems) are also in use. Total number of known optimization method classes amounts to several hundreds. At the same time, methods falling into classes far from each other may often have many common properties and can be reduced to each other by rethinking certain characteristics. In view of the above, the pressing task of the modern science is to develop a general approach to classify optimization methods based on the disclosure of the involved search strategy basic principles, and to systematize existing optimization methods. The purpose is to show that genetic algorithms, usually classified as metaheuristic, population-based, simulation, etc., are inherently the stochastic numerical methods of direct search. Results. Alternative statements of optimization problem are given. An overview of existing classifications of optimization problems and basic methods to solve them is provided. The heart of optimization method classification into symbolic (analytical) and numerical ones is described. It is shown that a genetic algorithm scheme can be represented as a scheme of numerical method of direct search. A method to reduce a given optimization problem to a problem solvable by a genetic algorithm is described, and the class of problems that can be solved by genetic algorithms is outlined. Conclusions. Taking into account the existence of a great number of methods solving optimization problems and approaches to classify them it is necessary to work out a unified approach for optimization method classification and systematization. Reducing the class of genetic algorithms to numerical methods of direct search is the first step in this direction. Keywords: mathematical programming problem, unconstrained optimization problem, constrained optimization problem, multimodal optimization problem, numerical methods, genetic algorithms, metaheuristic algorithms.

scholarly journals Optimization of a 3D-Printed Permanent Magnet Coupling Using Genetic Algorithm and Taguchi Method

Electronics ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 494
Author(s):  
Ekaterina Andriushchenko ◽  
Ants Kallaste ◽  
Anouar Belahcen ◽  
Toomas Vaimann ◽  
Anton Rassõlkin ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Taguchi Method ◽  
Permanent Magnet ◽  
Optimization Problems ◽  
Optimization Method ◽  
Taguchi Optimization ◽  
Torque Density ◽  
Electromagnetic Devices ◽  
3D Printed ◽  
Manufacturing Techniques

In recent decades, the genetic algorithm (GA) has been extensively used in the design optimization of electromagnetic devices. Despite the great merits possessed by the GA, its processing procedure is highly time-consuming. On the contrary, the widely applied Taguchi optimization method is faster with comparable effectiveness in certain optimization problems. This study explores the abilities of both methods within the optimization of a permanent magnet coupling, where the optimization objectives are the minimization of coupling volume and maximization of transmitted torque. The optimal geometry of the coupling and the obtained characteristics achieved by both methods are nearly identical. The magnetic torque density is enhanced by more than 20%, while the volume is reduced by 17%. Yet, the Taguchi method is found to be more time-efficient and effective within the considered optimization problem. Thanks to the additive manufacturing techniques, the initial design and the sophisticated geometry of the Taguchi optimal designs are precisely fabricated. The performances of the coupling designs are validated using an experimental setup.

ONE IMPROVED AGENT GENETIC ALGORITHM — RING-LIKE AGENT GENETIC ALGORITHM FOR GLOBAL NUMERICAL OPTIMIZATION

2009 ◽  
Vol 26 (04) ◽  
pp. 479-502 ◽  
Author(s):  
BIN LIU ◽  
TEQI DUAN ◽  
YONGMING LI
Keyword(s):  
Genetic Algorithm ◽  
Numerical Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Genetic Operators ◽  
Global Numerical Optimization ◽  
Candidate Solution ◽  
Low Dimension ◽  
Multi Agent ◽  
Agent Structure

In this paper, a novel genetic algorithm — dynamic ring-like agent genetic algorithm (RAGA) is proposed for solving global numerical optimization problem. The RAGA combines the ring-like agent structure and dynamic neighboring genetic operators together to get better optimization capability. An agent in ring-like agent structure represents a candidate solution to the optimization problem. Any agent interacts with neighboring agents to evolve. With dynamic neighboring genetic operators, they compete and cooperate with their neighbors, and they can also use knowledge to increase energies. Global numerical optimization problems are the most important ones to verify the performance of evolutionary algorithm, especially of genetic algorithm and are mostly of interest to the corresponding researchers. In the corresponding experiments, several complex benchmark functions were used for optimization, several popular GAs were used for comparison. In order to better compare two agents GAs (MAGA: multi-agent genetic algorithm and RAGA), the several dimensional experiments (from low dimension to high dimension) were done. These experimental results show that RAGA not only is suitable for optimization problems, but also has more precise and more stable optimization results.

scholarly journals An intelligence optimization method based on crowd intelligence for IoT devices

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Ke Wang ◽  
Zheming Yang ◽  
Bing Liang ◽  
Wen Ji
Keyword(s):  
Genetic Algorithm ◽  
Design Methodology ◽  
Rapid Development ◽  
Optimization Method ◽  
The Internet ◽  
Content Type ◽  
Communication Capacity ◽  
Iot Devices ◽  
Crowd Intelligence ◽  
The Internet Of Things

Purpose The rapid development of 5G technology brings the expansion of the internet of things (IoT). A large number of devices in the IoT work independently, leading to difficulties in management. This study aims to optimize the member structure of the IoT so the members in it can work more efficiently. Design/methodology/approach In this paper, the authors consider from the perspective of crowd science, combining genetic algorithms and crowd intelligence together to optimize the total intelligence of the IoT. Computing, caching and communication capacity are used as the basis of the intelligence according to the related work, and the device correlation and distance factors are used to measure the improvement level of the intelligence. Finally, they use genetic algorithm to select a collaborative state for the IoT devices. Findings Experimental results demonstrate that the intelligence optimization method in this paper can improve the IoT intelligence level up to ten times than original level. Originality/value This paper is the first study that solves the problem of device collaboration in the IoT scenario based on the scientific background of crowd intelligence. The intelligence optimization method works well in the IoT scenario, and it also has potential in other scenarios of crowd network.

Solving the 0/1 knapsack problem using an adaptive genetic algorithm

2002 ◽  
Vol 16 (1) ◽  
pp. 23-30 ◽  
Author(s):  
ZOHEIR EZZIANE
Keyword(s):  
Genetic Algorithm ◽  
Knapsack Problem ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Adaptive Genetic Algorithm ◽  
Stochastic Algorithms ◽  
Initial Population ◽  
Genetic Operators ◽  
Adaptive Penalty ◽  
Genetic Algorithm Approach

Probabilistic and stochastic algorithms have been used to solve many hard optimization problems since they can provide solutions to problems where often standard algorithms have failed. These algorithms basically search through a space of potential solutions using randomness as a major factor to make decisions. In this research, the knapsack problem (optimization problem) is solved using a genetic algorithm approach. Subsequently, comparisons are made with a greedy method and a heuristic algorithm. The knapsack problem is recognized to be NP-hard. Genetic algorithms are among search procedures based on natural selection and natural genetics. They randomly create an initial population of individuals. Then, they use genetic operators to yield new offspring. In this research, a genetic algorithm is used to solve the 0/1 knapsack problem. Special consideration is given to the penalty function where constant and self-adaptive penalty functions are adopted.

Niche Genetic Algorithm Based on Sexual Reproduction and Multimodal Function Optimization Problem

2013 ◽  
pp. 8-16
Author(s):  
Yulong Tian ◽  
Tao Gao ◽  
Weifang Zhai ◽  
Yaying Hu ◽  
Xinfeng Li
Keyword(s):  
Genetic Algorithm ◽  
Sexual Reproduction ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Evolutionary Optimization ◽  
Function Optimization ◽  
Premature Convergence ◽  
Multimodal Functions ◽  
Multimodal Function Optimization ◽  
Multimodal Function

In this paper, a genetic algorithm with sexual reproduction and niche selection technology is proposed. Simple genetic algorithm has been successfully applied to many evolutionary optimization problems. But there is a problem of premature convergence for complex multimodal functions. To solve it, the frame and realization of niche genetic algorithm based on sexual reproduction are presented. Age and sexual structures are given to the individuals referring the sexual reproduction and “niche” phenomena, importing the niche selection technology. During age and sexual operators, different evolutionary parameters are given to the individuals with different age and sexual structures. As a result, this genetic algorithm can combat premature convergence and keep the diversity of population. The testing for Rastrigin function and Shubert function proves that the niche genetic algorithm based on sexual reproduction is effective.

The Genetic Algorithm

2019 ◽  
pp. 154-178
Author(s):  
Burcu Adıguzel Mercangöz ◽  
Ergun Eroglu
Keyword(s):  
Genetic Algorithm ◽  
Mathematical Models ◽  
Portfolio Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Biological Evolution ◽  
Research Field ◽  
Risk Level ◽  
Important Research ◽  
Portfolio Optimization Problem

The portfolio optimization is an important research field of the financial sciences. In portfolio optimization problems, it is aimed to create portfolios by giving the best return at a certain risk level from the asset pool or by selecting assets that give the lowest risk at a certain level of return. The diversity of the portfolio gives opportunity to increase the return by minimizing the risk. As a powerful alternative to the mathematical models, heuristics is used widely to solve the portfolio optimization problems. The genetic algorithm (GA) is a technique that is inspired by the biological evolution. While this book considers the heuristics methods for the portfolio optimization problems, this chapter will give the implementing steps of the GA clearly and apply this method to a portfolio optimization problem in a basic example.

scholarly journals A trajectory design method for RLV via artificialmemory-principle optimization

2018 ◽  
Vol 189 ◽  
pp. 10019
Author(s):  
Hao Li ◽  
Changzhu Wei
Keyword(s):  
Trajectory Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Memory Cell ◽  
Optimization Method ◽  
Alternative Solution ◽  
Trajectory Design ◽  
Memory State ◽  
Artificial Memory

A trajectory optimization method for RLV based on artificial memory principles is proposed. Firstly the optimization problem is modelled in Euclidean space. Then in order to solve the complicated optimization problem of RLV in entry phase, Artificial-memory-principle optimization (AMPO) is introduced. AMPO is inspired by memory principles, in which a memory cell consists the whole information of an alternative solution. The information includes solution state and memory state. The former is an evolutional alternative solution, the latter indicates the state type of memory cell: temporary, short-and long-term. In the evolution of optimization, AMPO makes a various search (stimulus) to ensure adaptability, if the stimulus is good, memory state will turn temporary to short-term, even long-term, otherwise it not. Finally, simulation of different methods is carried out respectively. Results show that the method based on AMPO has better performance and high convergence speed when solving complicated optimization problems of RLV.

Hierarchical Arrangement of Characteristics in Product Design Optimization Problems for Deeper Insight Into Optimized Results

2004 ◽  
Author(s):  
Masataka Yoshimura ◽  
Masahiko Taniguchi ◽  
Kazuhiro Izui ◽  
Shinji Nishiwaki
Keyword(s):  
Design Optimization ◽  
Product Design ◽  
Optimum Design ◽  
Design Problem ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Optimization Method ◽  
Hierarchical Level ◽  
Hierarchical Arrangement ◽  
Insight Into

This paper proposes a design optimization method for machine products that is based on the decomposition of performance characteristics, or alternatively, extraction of simpler characteristics, to accommodate the specific features or difficulties of a particular design problem. The optimization problem is expressed using hierarchical constructions of the decomposed and extracted characteristics and the optimizations are sequentially repeated, starting with groups of characteristics having conflicting characteristics at the lowest hierarchical level and proceeding to higher levels. The proposed method not only effectively enables achieving optimum design solutions, but also facilitates deeper insight into the design optimization results, and aids obtaining ideas for breakthroughs in the optimum solutions. An applied example is given to demonstrate the effectiveness of the proposed method.

Optimization of Radial Cams with Translating Roller Follower through Genetic Algorithms

2015 ◽  
Vol 783 ◽  
pp. 83-94
Author(s):  
Alberto Borboni
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Contact Pressure ◽  
Optimization Problem ◽  
Optimization Method ◽  
Optimization Process ◽  
Radius Of Curvature ◽  
Design Problems ◽  
Computational Optimization ◽  
Different Types

In this work, the optimization problem is studied for a planar cam which rotates around its axis and moves a centered translating roller follower. The proposed optimization method is a genetic algorithm. The paper deals with different design problems: the minimization of the pressure angle, the maximization of the radius of curvature and the minimization of the contact pressure. Different types of motion laws are tested to found the most suitable for the computational optimization process.

Sign in / Sign up

Export Citation Format

Share Document