scholarly journals Genetic Programming Based Identification of an Overhead Crane

2021 ◽  
Vol 51 (3) ◽  
pp. 123-133
Author(s):  
Tom Kusznir ◽  
Jarosław Smoczek
Keyword(s):  
Genetic Programming ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Overhead Crane ◽  
Output Data ◽  
Lagrange Method ◽  
Plant Model ◽  
Overhead Cranes ◽  
Model Mismatch ◽  
Increase Productivity

Abstract Overhead cranes carry out an important function in the transportation of loads in industry. The ability to transport a payload quickly and accurately without excessive oscillations could reduce the chance of accidents as well as increase productivity. Accurate modelling of the crane system dynamics reduces the plant-model mismatch which could improve the performance of model-based controllers. In this work the simulation model to be identified is developed using the Euler-Lagrange method with friction. A 5-step ahead predictor, as well as a 10-step ahead predictor, are obtained using multi-gene genetic programming (MGGP) using input-output data. The weights of the genes are obtained by using least squares. The results of 15 different genetic programming runs are plotted on a complexity-mean square error graph with the Pareto optimal solutions shown.

scholarly journals Generating Investment Strategies Using Multiobjective Genetic Programming And Internet Term Popularity Data

2015 ◽  
Vol 62 (1) ◽  
pp. 55-62
Author(s):  
Martin Jakubéci
Keyword(s):  
Genetic Programming ◽  
Optimization Problem ◽  
The Internet ◽  
Investment Strategies ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Stock Investment ◽  
Complex Models ◽  
Evolutionary Operators ◽  
Stock Picking

Abstract Searching for stock picking strategies can be modelled as a multiobjective optimization problem. The objectives are mostly the profit and risk. Because of the conflicting nature of these objectives, we have to find Pareto optimal solutions. Multiobjective genetic programming (MOGP) can be used to find tree based solutions, using evolutionary operators. The advantage is that this algorithm can combine any number of inputs and generate complex models. Recent research shows, that the popularity of different terms on the internet can be used to enhance the models. This paper deals with a SPEA2 MOGP implementation, which uses Google trends and Wikipedia popularity to find stock investment strategies.

Robust Non-Linear H∞/Adaptive Control of Robot Manipulator Motion

1994 ◽  
Vol 208 (4) ◽  
pp. 221-230 ◽  
Author(s):  
W Feng ◽  
I Postlethwaite
Keyword(s):  
Disturbance Rejection ◽  
Robot Manipulator ◽  
Control Design ◽  
System Modelling ◽  
Robust Performance ◽  
Original Design ◽  
Considerable Effort ◽  
Plant Model ◽  
Model Mismatch ◽  
Bounded Disturbances

In robotics, despite considerable effort to minimize system modelling errors, uncertainties are always present and sometimes significant. In this paper, modelling errors are first represented by a class of bounded disturbances in the input channels (torques) of the robot. A measure of the robot system's ability to reject these disturbances is formulated in an L2 gain sense and a control design is subsequently proposed to achieve optimal disturbance rejection. If more detailed information is available on the plant-model mismatch, then the control design can be modified to incorporate an adaptive scheme (with explicit parameter updating laws) in order to reduce the conservativeness of the original design and to improve robust performance of the overall system.

scholarly journals Optimization Of Multi-Module CrN/CrCN Coatings

2015 ◽  
Vol 60 (2) ◽  
pp. 1037-1043
Author(s):  
Ł. Szparaga ◽  
P. Bartosik ◽  
A. Gilewicz ◽  
J. Ratajski
Keyword(s):  
Optimization Procedure ◽  
Stress And Strain ◽  
Pareto Optimal ◽  
Mutual Distance ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Decision Criteria ◽  
Decision Variables ◽  
42Crmo4 Steel ◽  
The Stability

Abstract In the paper was proposed optimization procedure supporting the prototyping of the geometry of multi-module CrN/CrCN coatings, deposited on substrates from 42CrMo4 steel, in respect of mechanical properties. Adopted decision criteria were the functions of the state of internal stress and strain in the coating and substrate, caused by external mechanical loads. Using developed optimization procedure the set of optimal solutions (Pareto-optimal solutions) of coatings geometry parameters, due to the adopted decision criteria was obtained. For the purposes of analysis of obtained Pareto-optimal solutions, their mutual distance in the space of criteria and decision variables were calculated, which allowed to group solutions in the classes. Also analyzed the number of direct neighbors of Pareto-optimal solutions for the purposes of assessing the stability of solutions.

A DECOMPOSITION-COORDINATION METHOD FOR COMPLEX MULTI-OBJECTIVE SYSTEMS

2009 ◽  
Vol 26 (06) ◽  
pp. 735-757 ◽  
Author(s):  
F. MIGUEL ◽  
T. GÓMEZ ◽  
M. LUQUE ◽  
F. RUIZ ◽  
R. CABALLERO
Keyword(s):  
Information Exchange ◽  
Exchange Process ◽  
Efficient Solutions ◽  
Pareto Optimal ◽  
Relative Importance ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Conflicting Objectives ◽  
Upper Level ◽  
Problem Instances

The generation of Pareto optimal solutions for complex systems with multiple conflicting objectives can be easier if the problem can be decomposed and solved as a set of smaller coordinated subproblems. In this paper, a new decomposition-coordination method is proposed, where the global problem is partitioned into subsystems on the basis of the connection structure of the mathematical model, assigning a relative importance to each of them. In order to obtain Pareto optimal solutions for the global system, the aforementioned subproblems are coordinated taking into account their relative importance. The scheme that has been developed is an iterative one, and the global efficient solutions are found through a continuous information exchange process between the coordination level (upper level) and the subsystem level (lower level). Computational experiments on several randomly generated problem instances show that the suggested algorithm produces efficient solutions within reasonable computational times.

Multiobjective optimization of the flaxseed mucilage extraction process using normal-boundary intersection approach

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Mariana Souza Rocha ◽  
Luiz Célio Souza Rocha ◽  
Marcia Barreto da Silva Feijó ◽  
Paula Luiza Limongi dos Santos Marotta ◽  
Samanta Cardozo Mourão
Keyword(s):  
Multiobjective Optimization ◽  
Optimization Method ◽  
Extraction Process ◽  
Pareto Optimal ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Fiber Concentration ◽  
Trade Off ◽  
Content Type ◽  
Normal Boundary

PurposeThe mucilage of the Linum usitatissimum L. seed (Linseed) is one of the natural mucilages that presents a great potential to provide a food hydrocolloid with potential applications in both food and pharmaceutical industries. To increase the yield and quality of linseed oil during its production process, it is necessary to previously extract its polysaccharides. Because of this, flax mucilage production can be made viable as a byproduct of oil extraction process, which is already a product of high commercial value consolidated in the market. Thus, the purpose of this work is to optimize the mucilage extraction process of L. usitatissimum L. using the normal-boundary intersection (NBI) multiobjective optimization method.Design/methodology/approachCurrently, the variables of the process of polysaccharide extraction from different sources are optimized using the response surface methodology. However, when the optimal points of the responses are conflicting it is necessary to study the best conditions to achieve a balance between these conflicting objectives (trade-offs) and to explore the available options it is necessary to formulate an optimization problem with multiple objectives. The multiobjective optimization method used in this work was the NBI developed to find uniformly distributed and continuous Pareto optimal solutions for a nonlinear multiobjective problem.FindingsThe optimum extraction point to obtain the maximum fiber concentration in the extracted material was pH 3.81, temperature of 46°C, time of 13.46 h. The maximum extraction yield of flaxseed was pH 6.45, temperature of 65°C, time of 14.41 h. This result confirms the trade-off relationship between the objectives. NBI approach was able to find uniformly distributed Pareto optimal solutions, which allows to analyze the behavior of the trade-off relationship. Thus, the decision-maker can set extraction conditions to achieve desired characteristics in mucilage.Originality/valueThe novelty of this paper is to confirm the existence of a trade-off relationship between the productivity parameter (yield) and the quality parameter (fiber concentration in the extracted material) during the flaxseed mucilage extraction process. The NBI approach was able to find uniformly distributed Pareto optimal solutions, which allows us to analyze the behavior of the trade-off relationship. This allows the decision-making to the extraction conditions according to the desired characteristics of the final product, thus being able to direct the extraction for the best applicability of the mucilage.

scholarly journals Two-Step Many-Objective Optimal Power Flow Based on Knee Point-Driven Evolutionary Algorithm

Processes ◽  
2018 ◽  
Vol 6 (12) ◽  
pp. 250 ◽  
Author(s):  
Yahui Li ◽  
Yang Li
Keyword(s):  
Decision Analysis ◽  
Evolutionary Algorithm ◽  
Power Flow ◽  
Optimal Power Flow ◽  
Decision Makers ◽  
Pareto Optimal ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Optimal Power ◽  
Knee Point

To coordinate the economy, security and environment protection in the power system operation, a two-step many-objective optimal power flow (MaOPF) solution method is proposed. In step 1, it is the first time that knee point-driven evolutionary algorithm (KnEA) is introduced to address the MaOPF problem, and thereby the Pareto-optimal solutions can be obtained. In step 2, an integrated decision analysis technique is utilized to provide decision makers with decision supports by combining fuzzy c-means (FCM) clustering and grey relational projection (GRP) method together. In this way, the best compromise solutions (BCSs) that represent decision makers’ different, even conflicting, preferences can be automatically determined from the set of Pareto-optimal solutions. The primary contribution of the proposal is the innovative application of many-objective optimization together with decision analysis for addressing MaOPF problems. Through examining the two-step method via the IEEE 118-bus system and the real-world Hebei provincial power system, it is verified that our approach is suitable for addressing the MaOPF problem of power systems.

Solving Multi-Objective Multicast Routing Problem Using a New Hybrid Approach

2018 ◽  
Vol 9 (4) ◽  
pp. 22-36
Author(s):  
Mohammed Mahseur ◽  
Abdelmadjid Boukra ◽  
Yassine Meraihi
Keyword(s):  
Multicast Routing ◽  
Hybrid Approach ◽  
Bat Algorithm ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Routing Problem ◽  
Multi Objective ◽  
Strength Pareto Evolutionary Algorithm ◽  
Quality Of Service Parameters

Multicast routing is the problem of finding the spanning tree of a set of destinations whose roots are the source node and its leaves are the set of destination nodes by optimizing a set of quality of service parameters and satisfying a set of transmission constraints. This article proposes a new hybrid multicast algorithm called Hybrid Multi-objective Multicast Algorithm (HMMA) based on the Strength Pareto Evolutionary Algorithm (SPEA) to evaluate and classify the population in dominated solutions and non-dominated solutions. Dominated solutions are evolved by the Bat Algorithm, and non-dominated solutions are evolved by the Firefly Algorithm. Old and weak solutions are replaced by new random solutions by a process of mutation. The simulation results demonstrate that the proposed algorithm is able to find good Pareto optimal solutions compared to other algorithms.

scholarly journals THE STATIC OPTIMIZATION TASK OF OPTIMAL DESIGN OF NONLINEAR ELECTRONIC SCHEME

2019 ◽  
pp. 109-115
Author(s):  
Didmanidze Ibraim ◽  
Donadze Mikheil
Keyword(s):  
Optimal Design ◽  
Optimality Criteria ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Design Task ◽  
Optimization Task ◽  
Minimum Capacity ◽  
Optimal Values ◽  
The Given ◽  
Selection Of

The article deals with such an important selection of the elements of electronic scheme of the given configuration, when the certain requirements of technical task are satisfied and at the same time the selected optimality criteria reach the extreme value. The gives task has been solved by the method of one-criterion optimization, in particular, the method of center gravity. To formalize the given scheme we have compiled a mathematical model of optimization, which considers the requirements of technical task. The optimal design task of the presented electronic scheme was brought to the task of multi criteria optimization. The computational experiments have been resulted in the Pareto-optimal solutions, from which there was selected a compromise on that corresponds to the minimum capacity, required by the scheme. According to the optimal values of resistors, we have conducted a computerized analysis of the transient process of the given electronic scheme with the help of a computer program Electronics Workbench.

Asymptotic rejection of nonvanishing disturbances despite plant-model mismatch

2012 ◽  
Vol 26 (12) ◽  
pp. 1090-1110 ◽  
Author(s):  
Ph. Mullhaupt ◽  
S. Valentinotti ◽  
B. Srinivasan ◽  
D. Bonvin
Keyword(s):  
Plant Model ◽  
Model Mismatch
Sign in / Sign up

Export Citation Format

Share Document