scholarly journals A Comparative Study on Evolutionary Multi-objective Optimization Algorithms Estimating Surface Duct

Sensors ◽  
2018 ◽  
Vol 18 (12) ◽  
pp. 4428 ◽  
Author(s):  
Qixiang Liao ◽  
Zheng Sheng ◽  
Hanqing Shi ◽  
Lei Zhang ◽  
Lesong Zhou ◽  
...  
Keyword(s):  
Performance Metrics ◽  
Propagation Loss ◽  
Experimental Comparison ◽  
Algorithm Performance ◽  
Inversion Result ◽  
Multi Objective ◽  
Atmospheric Duct ◽  
Receiving Antenna ◽  
Real Value ◽  
Convergence Of Solution

The problem of atmospheric duct inversion is usually solved as a single objective optimization problem. Based on ground-based Global Positioning System (GPS) phase delay and propagation loss, this paper develops a multi-objective method including the effect of source frequency and receiving antenna height. The diversity and convergence of solution sets are evaluated for seven multi-objective evolutionary algorithms with three performance metrics: Hypervolume (HV), Inverted Generational Distance (IGD), and the averaged Hausdorff distance (Δ2). The inversion results are compared with the simulation results, and the experimental comparison is conducted on three groups of test situations. The results demonstrate that the ranking of algorithm performance varies because of the different methods used to calculate performance metrics. Moreover, when the algorithms show overwhelming performance using performance metrics, the inversion result is not more close to the real value. In the comparison of computational experiments, it was found that, as the retrieved parameter dimension increases, the inversion result becomes more unstable. When the observed data are sufficient, the inversion result seems to be improved.

scholarly journals A Two-Stage Mono- and Multi-Objective Method for the Optimization of General UPS Parallel Manipulators

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 543
Author(s):  
Alejandra Ríos ◽  
Eusebio E. Hernández ◽  
S. Ivvan Valdez
Keyword(s):  
Genetic Algorithm ◽  
Performance Metrics ◽  
Tracking Error ◽  
Parallel Manipulators ◽  
Optimization Method ◽  
Statistical Hypothesis ◽  
Two Stage ◽  
Multi Objective ◽  
Second Stage ◽  
Conflicting Objectives

This paper introduces a two-stage method based on bio-inspired algorithms for the design optimization of a class of general Stewart platforms. The first stage performs a mono-objective optimization in order to reach, with sufficient dexterity, a regular target workspace while minimizing the elements’ lengths. For this optimization problem, we compare three bio-inspired algorithms: the Genetic Algorithm (GA), the Particle Swarm Optimization (PSO), and the Boltzman Univariate Marginal Distribution Algorithm (BUMDA). The second stage looks for the most suitable gains of a Proportional Integral Derivative (PID) control via the minimization of two conflicting objectives: one based on energy consumption and the tracking error of a target trajectory. To this effect, we compare two multi-objective algorithms: the Multiobjective Evolutionary Algorithm based on Decomposition (MOEA/D) and Non-dominated Sorting Genetic Algorithm-III (NSGA-III). The main contributions lie in the optimization model, the proposal of a two-stage optimization method, and the findings of the performance of different bio-inspired algorithms for each stage. Furthermore, we show optimized designs delivered by the proposed method and provide directions for the best-performing algorithms through performance metrics and statistical hypothesis tests.

Application of Nature Inspired Algorithms to Optimize Multi-objective Two-Dimensional Rectangle Packing Problem

2019 ◽  
Vol 04 (04) ◽  
pp. 1950010
Author(s):  
Amandeep Kaur Virk ◽  
Kawaljeet Singh
Keyword(s):  
Production Process ◽  
Bin Packing ◽  
Performance Metrics ◽  
Packing Problem ◽  
Flower Pollination Algorithm ◽  
Two Dimensional ◽  
Due Dates ◽  
Utilization Factor ◽  
Multi Objective ◽  
Metaheuristic Techniques

This paper considers two-dimensional non-guillotine rectangular bin packing problem with multiple objectives in which small rectangular parts are to be arranged optimally on a large rectangular sheet. The optimization of rectangular parts is attained with respect to three objectives involving maximization of (1) utilization factor, minimization of (2) due dates of rectangles and (3) number of cuts. Three nature based metaheuristic algorithms — Cuckoo Search, Bat Algorithm and Flower Pollination Algorithm — have been used to solve the multi-objective packing problem. The purpose of this work is to consider multiple industrial objectives for improving the overall production process and to explore the potential of the recent metaheuristic techniques. Benchmark test data compare the performance of recent approaches with the popular approaches and also of the different objectives used. Different performance metrics analyze the behavior/performance of the proposed technique. Experimental results obtained in this work prove the effectiveness of the recent metaheuristic techniques used. Also, it was observed that considering multiple and independent factors as objectives for the production process does not degrade the overall performance and they do not necessarily conflict with each other.

scholarly journals Analysis of Multi-Objective Optimization of Machining Allowance Distribution and Parameters for Energy Saving Strategy

2020 ◽  
Vol 12 (2) ◽  
pp. 638
Author(s):  
Keyan He ◽  
Huajie Hong ◽  
Renzhong Tang ◽  
Junyu Wei
Keyword(s):  
Energy Saving ◽  
Parametric Models ◽  
Distribution Problem ◽  
Machining Processes ◽  
Algorithm Performance ◽  
Multi Objective ◽  
Optimum Algorithm ◽  
Machining Allowance ◽  
Rough Milling ◽  
Pareto Fronts

Machining allowance distribution and related parameter optimization of machining processes have been well-discussed. However, for energy saving purposes, the optimization priorities of different machining phases should be different. There are often significant incoherencies between the existing research and real applications. This paper presents an improved method to optimize machining allowance distribution and parameters comprehensively, considering energy-saving strategy and other multi-objectives of different phases. The empirical parametric models of different machining phases were established, with the allowance distribution problem properly addressed. Based on previous analysis work of algorithm performance, non-dominated sorting genetic algorithm II and multi-objective evolutionary algorithm based on decomposition were chosen to obtain Pareto solutions. Algorithm performances were compared based on the efficiency of finding the Pareto fronts. Two case studies of a cylindrical turning and a face milling were carried out. Results demonstrate that the proposed method is effective in trading-off and finding precise application scopes of machining allowances and parameters used in real production. Cutting tool life and surface roughness can be greatly improved for turning. Energy consumption of rough milling can be greatly reduced to around 20% of traditional methods. The optimum algorithm of each case is also recognized. The proposed method can be easily extended to other machining scenarios and can be used as guidance of process planning for meeting various engineering demands.

Influence of the go-based semantic similarity measures in multi-objective gene clustering algorithm performance

2020 ◽  
Vol 18 (06) ◽  
pp. 2050038
Author(s):  
Jorge Parraga-Alava ◽  
Mario Inostroza-Ponta
Keyword(s):  
Semantic Similarity ◽  
Clustering Algorithm ◽  
Performance Metrics ◽  
Expression Patterns ◽  
Biological Significance ◽  
Similarity Measures ◽  
Gene Clustering ◽  
Biological Knowledge ◽  
Multi Objective ◽  
Gene Similarity

Using a prior biological knowledge of relationships and genetic functions for gene similarity, from repository such as the Gene Ontology (GO), has shown good results in multi-objective gene clustering algorithms. In this scenario and to obtain useful clustering results, it would be helpful to know which measure of biological similarity between genes should be employed to yield meaningful clusters that have both similar expression patterns (co-expression) and biological homogeneity. In this paper, we studied the influence of the four most used GO-based semantic similarity measures in the performance of a multi-objective gene clustering algorithm. We used four publicly available datasets and carried out comparative studies based on performance metrics for the multi-objective optimization field and clustering performance indexes. In most of the cases, using Jiang–Conrath and Wang similarities stand in terms of multi-objective metrics. In clustering properties, Resnik similarity allows to achieve the best values of compactness and separation and therefore of co-expression of groups of genes. Meanwhile, in biological homogeneity, the Wang similarity reports greater number of significant GO terms. However, statistical, visual, and biological significance tests showed that none of the GO-based semantic similarity measures stand out above the rest in order to significantly improve the performance of the multi-objective gene clustering algorithm.

Multi-Objective Cuckoo Search Under Multiple Archiving Strategies

2016 ◽  
Vol 15 (04) ◽  
pp. 1650020 ◽  
Author(s):  
Kamel Zeltni ◽  
Souham Meshoul
Keyword(s):  
Performance Metrics ◽  
Cuckoo Search ◽  
Nonparametric Test ◽  
Critical Issue ◽  
Test Problems ◽  
Nondominated Solutions ◽  
Multi Objective ◽  
Bounded Set ◽  
Recent Addition

Cuckoo Search (CS) is a recent addition to the field of swarm-based metaheuristics. It has been shown to be an efficient approach for global optimization. Moreover, its application for solving Multi-objective Optimization (MOO) shows very promising results as well. In multi-objective context, a bounded archive is required to store the set of nondominated solutions. But, what is the best archiving strategy to use in order to maintain a bounded set with good characteristics is a critical issue that may lead to a questionable choice. In this work, the behavior of the developed multi-objective CS is studied under several archiving strategies. An extensive experimental study has been conducted using several test problems and two performance metrics related to convergence and diversity. A nonparametric test for statistical analysis is performed. In addition, we used a Multi-Objective Particle Swarm Optimization (MOPSO) for further analysis and comparison. The results revealed that archiving strategies play an important role as they can impact differently on the quality of obtained fronts depending on the problem’s characteristics. Also, this study confirms that the proposed MOCS algorithm is a very promising approach for MOPs compared to the widely used MOPSO.

Expected-Improvement-Based Methods for Adaptive Sampling in Multi-Objective Optimization Problems

2016 ◽  
Author(s):  
Jesper Kristensen ◽  
You Ling ◽  
Isaac Asher ◽  
Liping Wang
Keyword(s):  
Convex Hull ◽  
Design Optimization ◽  
Adaptive Sampling ◽  
Pareto Front ◽  
Performance Metrics ◽  
Sampling Methods ◽  
Optimization Problems ◽  
Expected Improvement ◽  
Multi Objective Optimization ◽  
Multi Objective

Adaptive sampling methods have been used to build accurate meta-models across large design spaces from which engineers can explore data trends, investigate optimal designs, study the sensitivity of objectives on the modeling design features, etc. For global design optimization applications, adaptive sampling methods need to be extended to sample more efficiently near the optimal domains of the design space (i.e., the Pareto front/frontier in multi-objective optimization). Expected Improvement (EI) methods have been shown to be efficient to solve design optimization problems using meta-models by incorporating prediction uncertainty. In this paper, a set of state-of-the-art methods (hypervolume EI method and centroid EI method) are presented and implemented for selecting sampling points for multi-objective optimizations. The classical hypervolume EI method uses hyperrectangles to represent the Pareto front, which shows undesirable behavior at the tails of the Pareto front. This issue is addressed utilizing the concepts from physical programming to shape the Pareto front. The modified hypervolume EI method can be extended to increase local Pareto front accuracy in any area identified by an engineer, and this method can be applied to Pareto frontiers of any shape. A novel hypervolume EI method is also developed that does not rely on the assumption of hyperrectangles, but instead assumes the Pareto frontier can be represented by a convex hull. The method exploits fast methods for convex hull construction and numerical integration, and results in a Pareto front shape that is desired in many practical applications. Various performance metrics are defined in order to quantitatively compare and discuss all methods applied to a particular 2D optimization problem from the literature. The modified hypervolume EI methods lead to dramatic resource savings while improving the predictive capabilities near the optimal objective values.

scholarly journals Identifying the Main Risk Factors for Cardiovascular Diseases Prediction Using Machine Learning Algorithms

Mathematics ◽  
2021 ◽  
Vol 9 (20) ◽  
pp. 2537
Author(s):  
Luis Rolando Guarneros-Nolasco ◽  
Nancy Aracely Cruz-Ramos ◽  
Giner Alor-Hernández ◽  
Lisbeth Rodríguez-Mazahua ◽  
José Luis Sánchez-Cervantes
Keyword(s):  
Machine Learning ◽  
Cardiovascular Diseases ◽  
Performance Metrics ◽  
Learning Algorithms ◽  
Predictive Performance ◽  
Machine Learning Algorithms ◽  
Algorithm Performance ◽  
Body Regions ◽  
Risks Factors ◽  
Fold Cross Validation

Cardiovascular Diseases (CVDs) are a leading cause of death globally. In CVDs, the heart is unable to deliver enough blood to other body regions. As an effective and accurate diagnosis of CVDs is essential for CVD prevention and treatment, machine learning (ML) techniques can be effectively and reliably used to discern patients suffering from a CVD from those who do not suffer from any heart condition. Namely, machine learning algorithms (MLAs) play a key role in the diagnosis of CVDs through predictive models that allow us to identify the main risks factors influencing CVD development. In this study, we analyze the performance of ten MLAs on two datasets for CVD prediction and two for CVD diagnosis. Algorithm performance is analyzed on top-two and top-four dataset attributes/features with respect to five performance metrics –accuracy, precision, recall, f1-score, and roc-auc—using the train-test split technique and k-fold cross-validation. Our study identifies the top-two and top-four attributes from CVD datasets analyzing the performance of the accuracy metrics to determine that they are the best for predicting and diagnosing CVD. As our main findings, the ten ML classifiers exhibited appropriate diagnosis in classification and predictive performance with accuracy metric with top-two attributes, identifying three main attributes for diagnosis and prediction of a CVD such as arrhythmia and tachycardia; hence, they can be successfully implemented for improving current CVD diagnosis efforts and help patients around the world, especially in regions where medical staff is lacking.

Sign in / Sign up

Export Citation Format

Share Document