Genetic Algorithms in Fuzzy Engineering Design

1999 ◽  
Author(s):  
Ralf Schleiffer ◽  
Hans-Jürgen Sebastian ◽  
Erik K. Antonsson
Keyword(s):  
Engineering Design ◽  
Clustering Algorithm ◽  
Computer Application ◽  
Test Problems ◽  
Important Class ◽  
New Approach ◽  
Design Task ◽  
Evolutionary Technique ◽  
The Given ◽  
Real World Problems

Abstract Problems in the field of engineering design represent an important class of real world problems that typically require a fuzzy and imprecise representation. This article presents and discusses a new approach to model this type of problem, by incorporating linguistic descriptions together with a variety of user-defined trade-off strategies. An interactive computer application is introduced, using stochastic optimization to solve the design task by producing a specially desired output under the given environmental conditions which are partly caused by the personal preferences of the engineer and by the expectations of the customer. It utilizes a randomized evolutionary technique, made suitable for the class of problems at hand, to generate and to optimize design solutions that are later identified by a clustering algorithm. Moreover test problems that were solved by the application are considered. In all cases the good solutions were obtained by evaluating only an extremely small fraction of all possible designs.

A New Approach to Probability in Engineering Design and Optimization

1984 ◽  
Vol 106 (1) ◽  
pp. 5-10 ◽  
Author(s):  
J. N. Siddall
Keyword(s):  
Probability Density ◽  
Engineering Design ◽  
Probability Distributions ◽  
Probability Density Functions ◽  
Density Functions ◽  
New Approach ◽  
Design And Optimization ◽  
Evolutionary Technique ◽  
Probability And Statistics

The anomalous position of probability and statistics in both mathematics and engineering is discussed, showing that there is little consensus on concepts and methods. For application in engineering design, probability is defined as strictly subjective in nature. It is argued that the use of classical methods of statistics to generate probability density functions by estimating parameters for assumed theoretical distributions should be used with caution, and that the use of confidence limits is not really meaningful in a design context. Preferred methods are described, and a new evolutionary technique for developing probability distributions of new random variables is proposed. Although Bayesian methods are commonly considered to be subjective, it is argued that, in the engineering sense, they are really not. A general formulation of the probabilistic optimization problem is described, including the role of subjective probability density functions.

scholarly journals MultiKOC: Multi-One-Class Classifier Based K-Means Clustering

Algorithms ◽  
2021 ◽  
Vol 14 (5) ◽  
pp. 134
Author(s):  
Loai Abdallah ◽  
Murad Badarna ◽  
Waleed Khalifa ◽  
Malik Yousef
Keyword(s):  
Clustering Algorithm ◽  
Main Idea ◽  
Molecular Classification ◽  
Positive Sample ◽  
Classification Problems ◽  
Multiple Cancer ◽  
Multiple Tumor ◽  
One Class Classifier ◽  
The Given

In the computational biology community there are many biological cases that are considered as multi-one-class classification problems. Examples include the classification of multiple tumor types, protein fold recognition and the molecular classification of multiple cancer types. In all of these cases the real world appropriately characterized negative cases or outliers are impractical to achieve and the positive cases might consist of different clusters, which in turn might lead to accuracy degradation. In this paper we present a novel algorithm named MultiKOC multi-one-class classifiers based K-means to deal with this problem. The main idea is to execute a clustering algorithm over the positive samples to capture the hidden subdata of the given positive data, and then building up a one-class classifier for every cluster member’s examples separately: in other word, train the OC classifier on each piece of subdata. For a given new sample, the generated classifiers are applied. If it is rejected by all of those classifiers, the given sample is considered as a negative sample, otherwise it is a positive sample. The results of MultiKOC are compared with the traditional one-class, multi-one-class, ensemble one-classes and two-class methods, yielding a significant improvement over the one-class and like the two-class performance.

A Unified Approach to H∞ Control of Singular Markovian Jump Systems

2013 ◽  
Vol 135 (6) ◽  
Author(s):  
Guoliang Wang ◽  
Hongyi Li
Keyword(s):  
Transition Probability ◽  
Markovian Jump Systems ◽  
Linear Matrix ◽  
Markovian Jump ◽  
New Approach ◽  
Control Approach ◽  
Singular Markovian Jump Systems ◽  
Jump Systems ◽  
Bounded Uncertainties ◽  
The Given

This paper considers the H∞ control problem for a class of singular Markovian jump systems (SMJSs), where the jumping signal is not always available. The main contribution of this paper introduces a new approach to a mode-independent (MI) H∞ controller by exploiting the nonfragile method. Based on the given method, a unified control approach establishing a direct connection between mode-dependent (MD) and mode-independent controllers is presented, where both existence conditions are given in terms of linear matrix inequalities. Moreover, another three cases of transition probability rate matrix (TRPM) with elementwise bounded uncertainties, being partially unknown and to be designed are analyzed, respectively. Numerical examples are used to demonstrate the effectiveness of the proposed methods.

A multi-manned assembly line balancing problem with classified teams: a new approach

2016 ◽  
Vol 36 (1) ◽  
pp. 51-59 ◽  
Author(s):  
Hamid Yilmaz ◽  
Mustafa Yilmaz
Keyword(s):  
Design Methodology ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Line Balancing ◽  
Test Problems ◽  
New Approach ◽  
Content Type ◽  
Line Test ◽  
Assembly Line Balancing Problem ◽  
First Time

Purpose – Within team-oriented approaches, tasks are assigned to teams before being assigned to workstations as a reality of industry. So it becomes clear, which workers assemble which tasks. Design/methodology/approach – Team numbers of the assembly line can increase with the number of tasks, but at the same time, due to physical situations of the stations, there will be limitations of maximum working team numbers in a station. For this purpose, heuristic assembly line balancing (ALB) procedure is used and mathematical model is developed for the problem. Findings – Well-known assembly line test problems widely used in the literature are solved to indicate the effectiveness and applicability of the proposed approach in practice. Originality/value – This paper draws attention to ALB problem in which workers have been assigned to teams in advance due to the need for specialized skills or equipment on the line for the first time.

A General Analysis of Sequential Social Learning

2021 ◽  
Author(s):  
Itai Arieli ◽  
Manuel Mueller-Frank
Keyword(s):  
Social Learning ◽  
Utility Function ◽  
Posterior Probability ◽  
General Analysis ◽  
Sufficient Condition ◽  
Important Class ◽  
General Utility ◽  
Learning Game ◽  
Necessary And Sufficient ◽  
The Given

This paper analyzes a sequential social learning game with a general utility function, state, and action space. We show that asymptotic learning holds for every utility function if and only if signals are totally unbounded, that is, the support of the private posterior probability of every event contains both zero and one. For the case of finitely many actions, we provide a sufficient condition for asymptotic learning depending on the given utility function. Finally, we establish that for the important class of simple utility functions with finitely many actions and states, pairwise unbounded signals, which generally are a strictly weaker notion than unbounded signals, are necessary and sufficient for asymptotic learning.

Opposition-based learning Multi-Verse Optimizer with disruption operator for optimization problems

2021 ◽  
Author(s):  
Mohammad Shehab ◽  
Laith Abualigah
Keyword(s):  
Real World ◽  
Optimization Problems ◽  
Second Stage ◽  
Opposition Based Learning ◽  
High Fitness ◽  
Fitness Value ◽  
Speed Up ◽  
Disruption Operator ◽  
The Given ◽  
Real World Problems

Abstract Multi-Verse Optimizer (MVO) algorithm is one of the recent metaheuristic algorithms used to solve various problems in different fields. However, MVO suffers from a lack of diversity which may trapping of local minima, and premature convergence. This paper introduces two steps of improving the basic MVO algorithm. The first step using Opposition-based learning (OBL) in MVO, called OMVO. The OBL aids to speed up the searching and improving the learning technique for selecting a better generation of candidate solutions of basic MVO. The second stage, called OMVOD, combines the disturbance operator (DO) and OMVO to improve the consistency of the chosen solution by providing a chance to solve the given problem with a high fitness value and increase diversity. To test the performance of the proposed models, fifteen CEC 2015 benchmark functions problems, thirty CEC 2017 benchmark functions problems, and seven CEC 2011 real-world problems were used in both phases of the enhancement. The second step, known as OMVOD, incorporates the disruption operator (DO) and OMVO to improve the accuracy of the chosen solution by giving a chance to solve the given problem with a high fitness value while also increasing variety. Fifteen CEC 2015 benchmark functions problems, thirty CEC 2017 benchmark functions problems and seven CEC 2011 real-world problems were used in both phases of the upgrade to assess the accuracy of the proposed models.

Current research in the engineering design requirement

2002 ◽  
Vol 216 (3) ◽  
pp. 375-388 ◽  
Author(s):  
M J Darlington ◽  
S J Culley
Keyword(s):  
Engineering Design ◽  
Requirements Engineering ◽  
Software Requirements ◽  
Design Domain ◽  
Design Requirement ◽  
Design Task ◽  
Design Goal ◽  
Starting Point ◽  
The Subject

The design requirement is a description of the desired solution to a problem. In engineering design, as in all other, a clear expression of a well-formulated design goal is vital for successful and efficient completion of the design task. The nature of the design requirement and the processes by which it is achieved have been the subject of a wide variety of research. The purpose of the paper is twofold. Firstly, it sets out to collate and discuss representative research in this area in order to give an overview of the current scope of the work. Secondly, it seeks to draw a comparison with the task of developing the design requirement for software and information systems and to initiate a discussion that considers to what extent the substantial body of research in software requirements engineering might help to give an understanding of the design requirement for the engineering design domain. A tentative characterization of the differences between the tasks in the two domains is presented, and representative papers from requirements engineering are used to suggest areas of overlap as a starting point for further investigation.

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.

A simultaneous decomposition for three quaternion tensors with applications in color video signal processing

2020 ◽  
pp. 1-35
Author(s):  
Zhuo-Heng He ◽  
Chen Chen ◽  
Xiang-Xiang Wang
Keyword(s):  
Signal Processing ◽  
Video Signal ◽  
New Approach ◽  
Video Signal Processing ◽  
Encryption And Decryption ◽  
Color Video ◽  
The Given ◽  
Einstein Product

In this paper, we establish a simultaneous decomposition for three quaternion tensors via Einstein product. This simultaneous decomposition transforms the given three quaternion tensors into nice forms which have only 1 and 0. We conclude with an application in the color video signal processing. This new approach only need to store four keys to realize the simultaneous encryption and decryption of three videos.

Sign in / Sign up

Export Citation Format

Share Document