scholarly journals The Colony Predation Algorithm

2021 ◽  
Vol 18 (3) ◽  
pp. 674-710
Author(s):  
Jiaze Tu ◽  
Huiling Chen ◽  
Mingjing Wang ◽  
Amir H. Gandomi
Keyword(s):  
Mathematical Model ◽  
State Of The Art ◽  
Source Code ◽  
The Other ◽  
Superior Performance ◽  
Design Problems ◽  
Optimal Position ◽  
Cross Border ◽  
Engineering Design Problems ◽  
Engineering Problems

AbstractThis paper proposes a new stochastic optimizer called the Colony Predation Algorithm (CPA) based on the corporate predation of animals in nature. CPA utilizes a mathematical mapping following the strategies used by animal hunting groups, such as dispersing prey, encircling prey, supporting the most likely successful hunter, and seeking another target. Moreover, the proposed CPA introduces new features of a unique mathematical model that uses a success rate to adjust the strategy and simulate hunting animals’ selective abandonment behavior. This paper also presents a new way to deal with cross-border situations, whereby the optimal position value of a cross-border situation replaces the cross-border value to improve the algorithm’s exploitation ability. The proposed CPA was compared with state-of-the-art metaheuristics on a comprehensive set of benchmark functions for performance verification and on five classical engineering design problems to evaluate the algorithm’s efficacy in optimizing engineering problems. The results show that the proposed algorithm exhibits competitive, superior performance in different search landscapes over the other algorithms. Moreover, the source code of the CPA will be publicly available after publication.

scholarly journals Lévy-Flight Moth-Flame Algorithm for Function Optimization and Engineering Design Problems

2016 ◽  
Vol 2016 ◽  
pp. 1-22 ◽  
Author(s):  
Zhiming Li ◽  
Yongquan Zhou ◽  
Sen Zhang ◽  
Junmin Song
Keyword(s):  
Engineering Design ◽  
Function Optimization ◽  
Superior Performance ◽  
Local Optimum ◽  
Lévy Flight ◽  
Design Problems ◽  
Levy Flight ◽  
Spiral Path ◽  
Straight Line ◽  
Engineering Design Problems

The moth-flame optimization (MFO) algorithm is a novel nature-inspired heuristic paradigm. The main inspiration of this algorithm is the navigation method of moths in nature called transverse orientation. Moths fly in night by maintaining a fixed angle with respect to the moon, a very effective mechanism for travelling in a straight line for long distances. However, these fancy insects are trapped in a spiral path around artificial lights. Aiming at the phenomenon that MFO algorithm has slow convergence and low precision, an improved version of MFO algorithm based on Lévy-flight strategy, which is named as LMFO, is proposed. Lévy-flight can increase the diversity of the population against premature convergence and make the algorithm jump out of local optimum more effectively. This approach is helpful to obtain a better trade-off between exploration and exploitation ability of MFO, thus, which can make LMFO faster and more robust than MFO. And a comparison with ABC, BA, GGSA, DA, PSOGSA, and MFO on 19 unconstrained benchmark functions and 2 constrained engineering design problems is tested. These results demonstrate the superior performance of LMFO.

A Set-Based System for Eliminating Infeasible Designs in Engineering Problems Dominated by Uncertainty

1997 ◽  
Author(s):  
William W. Finch ◽  
Allen C. Ward
Keyword(s):  
Electronic Circuit ◽  
Predicate Logic ◽  
Software Tool ◽  
Design Parameters ◽  
Engineering Systems ◽  
Multiple Sources ◽  
Design Problems ◽  
Engineering Design Problems ◽  
Engineering Problems ◽  
Prototype Software

Abstract This paper gives an overview of a system which eliminates infeasible designs from engineering design problems dominated by multiple sources of uncertainty. It outlines methods for representing constraints on sets of values for design parameters using quantified relations, a special class of predicate logic expressions which express some of the causal information inherent in engineering systems. The paper extends constraint satisfaction techniques and describes elimination algorithms that operate on quantified relations and catalogs of toleranced or adjustable parts. It demonstrates the utility of these tools on a simple electronic circuit, and describes their implementation and test in a prototype software tool.

scholarly journals Elite Opposition-Based Cognitive Behavior Optimization Algorithm for Global Optimization

2019 ◽  
Vol 28 (2) ◽  
pp. 185-217 ◽  
Author(s):  
Shaoling Zhang ◽  
Yongquan Zhou ◽  
Qifang Luo
Keyword(s):  
Optimization Algorithm ◽  
Information Exchange ◽  
Superior Performance ◽  
Adjustment Process ◽  
Cognitive Behavior ◽  
Design Problems ◽  
Opposition Based Learning ◽  
Engineering Design Problems ◽  
Third Stage ◽  
Three Stages

Abstract This paper presents an elite opposition-based cognitive behavior optimization algorithm (ECOA). The traditional COA is divided into three stages: rough search, information exchange and share, and intelligent adjustment process. In this paper, we introduce the elite opposition-based learning in the third stage of COA, with a view to avoid the latter congestion as well as to enhance the convergence speed. ECOA is validated by 23 benchmark functions and three engineering design problems, and the experimental results have proven the superior performance of ECOA compared to other algorithms in the literature.

scholarly journals An Improved Hybrid Aquila Optimizer and Harris Hawks Algorithm for Solving Industrial Engineering Optimization Problems

Processes ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 1551
Author(s):  
Shuang Wang ◽  
Heming Jia ◽  
Laith Abualigah ◽  
Qingxin Liu ◽  
Rong Zheng
Keyword(s):  
Learning Strategy ◽  
Optimization Problems ◽  
Energy Parameter ◽  
Industrial Engineering ◽  
Superior Performance ◽  
Exploration And Exploitation ◽  
Design Problems ◽  
Local Optima ◽  
Opposition Based Learning ◽  
Engineering Design Problems

Aquila Optimizer (AO) and Harris Hawks Optimizer (HHO) are recently proposed meta-heuristic optimization algorithms. AO possesses strong global exploration capability but insufficient local exploitation ability. However, the exploitation phase of HHO is pretty good, while the exploration capability is far from satisfactory. Considering the characteristics of these two algorithms, an improved hybrid AO and HHO combined with a nonlinear escaping energy parameter and random opposition-based learning strategy is proposed, namely IHAOHHO, to improve the searching performance in this paper. Firstly, combining the salient features of AO and HHO retains valuable exploration and exploitation capabilities. In the second place, random opposition-based learning (ROBL) is added in the exploitation phase to improve local optima avoidance. Finally, the nonlinear escaping energy parameter is utilized better to balance the exploration and exploitation phases of IHAOHHO. These two strategies effectively enhance the exploration and exploitation of the proposed algorithm. To verify the optimization performance, IHAOHHO is comprehensively analyzed on 23 standard benchmark functions. Moreover, the practicability of IHAOHHO is also highlighted by four industrial engineering design problems. Compared with the original AO and HHO and five state-of-the-art algorithms, the results show that IHAOHHO has strong superior performance and promising prospects.

scholarly journals A Hybrid Pathfinder Optimizer for Unconstrained and Constrained Optimization Problems

2020 ◽  
Vol 2020 ◽  
pp. 1-25
Author(s):  
Xiangbo Qi ◽  
Zhonghu Yuan ◽  
Yan Song
Keyword(s):  
Engineering Design ◽  
Optimization Problems ◽  
Continuous Functions ◽  
The Other ◽  
Constrained Optimization Problems ◽  
Design Problems ◽  
Constrained Problems ◽  
Engineering Design Problems ◽  
Comparison Algorithms ◽  
Searching Ability

Hybridization of metaheuristic algorithms with local search has been investigated in many studies. This paper proposes a hybrid pathfinder algorithm (HPFA), which incorporates the mutation operator in differential evolution (DE) into the pathfinder algorithm (PFA). The proposed algorithm combines the searching ability of both PFA and DE. With a test on a set of twenty-four unconstrained benchmark functions including both unimodal continuous functions, multimodal continuous functions, and composition functions, HPFA is proved to have significant improvement over the pathfinder algorithm and the other comparison algorithms. Then HPFA is used for data clustering, constrained problems, and engineering design problems. The experimental results show that the proposed HPFA got better results than the other comparison algorithms and is a competitive approach for solving partitioning clustering, constrained problems, and engineering design problems.

scholarly journals Evolutionary Algorithms Applied to Antennas and Propagation: A Review of State of the Art

2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
Sotirios K. Goudos ◽  
Christos Kalialakis ◽  
Raj Mittra
Keyword(s):  
Evolutionary Algorithms ◽  
Optimization Problems ◽  
State Of The Art ◽  
Antenna Design ◽  
Design Problems ◽  
Swarm Optimization ◽  
Case Examples ◽  
Engineering Problems ◽  
Primary Focus ◽  
Nature Inspired Algorithms

A review of evolutionary algorithms (EAs) with applications to antenna and propagation problems is presented. EAs have emerged as viable candidates for global optimization problems and have been attracting the attention of the research community interested in solving real-world engineering problems, as evidenced by the fact that very large number of antenna design problems have been addressed in the literature in recent years by using EAs. In this paper, our primary focus is on Genetic Algorithms (GAs), Particle Swarm Optimization (PSO), and Differential Evolution (DE), though we also briefly review other recently introduced nature-inspired algorithms. An overview of case examples optimized by each family of algorithms is included in the paper.

The Design of Fluid Power Systems Using Analogue Computers

1969 ◽  
Vol 2 (4) ◽  
pp. T47-T50
Author(s):  
C. R. Burrows ◽  
C. R. Webb
Keyword(s):  
Mathematical Model ◽  
Power Systems ◽  
Engineering Design ◽  
Fluid Power ◽  
Design Problems ◽  
Engineering Design Problems ◽  
Fluid Power Systems ◽  
The Mathematical Model

Two important areas in design are formulation and solution of the mathematical model; this paper deals mainly with the latter problem and is primarily concerned with the application of analogue computers to the design of fluid power systems, although much of the work is applicable to general engineering design problems. Before reviewing some typical applications it is first necessary to consider the benefits to be obtained from the use of computers.

scholarly journals Recognizing and Imitating Programmer Style: Adversaries in Program Authorship Attribution

2018 ◽  
Vol 2018 (1) ◽  
pp. 127-144 ◽  
Author(s):  
Lucy Simko ◽  
Luke Zettlemoyer ◽  
Tadayoshi Kohno
Keyword(s):  
Qualitative Analysis ◽  
State Of The Art ◽  
Source Code ◽  
The Other ◽  
Authorship Attribution

Abstract Source code attribution classifiers have recently become powerful. We consider the possibility that an adversary could craft code with the intention of causing a misclassification, i.e., creating a forgery of another author’s programming style in order to hide the forger’s own identity or blame the other author. We find that it is possible for a non-expert adversary to defeat such a system. In order to inform the design of adversarially resistant source code attribution classifiers, we conduct two studies with C/C++ programmers to explore the potential tactics and capabilities both of such adversaries and, conversely, of human analysts doing source code authorship attribution. Through the quantitative and qualitative analysis of these studies, we (1) evaluate a state-of-the-art machine classifier against forgeries, (2) evaluate programmers as human analysts/forgery detectors, and (3) compile a set of modifications made to create forgeries. Based on our analyses, we then suggest features that future source code attribution systems might incorporate in order to be adversarially resistant.

scholarly journals Material Generation Algorithm: A Novel Metaheuristic Algorithm for Optimization of Engineering Problems

Processes ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 859
Author(s):  
Siamak Talatahari ◽  
Mahdi Azizi ◽  
Amir H. Gandomi
Keyword(s):  
Optimization Problems ◽  
Design Problems ◽  
Generation Algorithm ◽  
Material Chemistry ◽  
Engineering Design Problems ◽  
Engineering Problems ◽  
Different Dimensions ◽  
Overall Performance ◽  
The Mean ◽  
Metaheuristic Optimization Algorithms

A new algorithm, Material Generation Algorithm (MGA), was developed and applied for the optimum design of engineering problems. Some advanced and basic aspects of material chemistry, specifically the configuration of chemical compounds and chemical reactions in producing new materials, are determined as inspirational concepts of the MGA. For numerical investigations purposes, 10 constrained optimization problems in different dimensions of 10, 30, 50, and 100, which have been benchmarked by the Competitions on Evolutionary Computation (CEC), are selected as test examples while 15 of the well-known engineering design problems are also determined to evaluate the overall performance of the proposed method. The best results of different classical and new metaheuristic optimization algorithms in dealing with the selected problems were taken from the recent literature for comparison with MGA. Additionally, the statistical values of the MGA algorithm, consisting of the mean, worst, and standard deviation, were calculated and compared to the results of other metaheuristic algorithms. Overall, this work demonstrates that the proposed MGA is able provide very competitive, and even outstanding, results and mostly outperforms other metaheuristics.

Data-driven design paradigm in engineering problems

2016 ◽  
Vol 231 (8) ◽  
pp. 1522-1534 ◽  
Author(s):  
Changqing Liu ◽  
Xiaoqian Chen
Keyword(s):  
Engineering Design ◽  
Data Driven ◽  
Decision Strategy ◽  
Design Problems ◽  
Design Decisions ◽  
Uncertainty Factors ◽  
Satellite Design ◽  
Engineering Design Problems ◽  
Engineering Problems ◽  
Design Paradigm

Engineering design problems can, in general, be discussed under the framework of decision making, namely engineering design decisions. Inherently, accounting for uncertainty factors is an indispensable part in these decision processes. In a sense, the goal of design decisions is to control or reduce the variational effect in decision consequences induced by many uncertainty factors, by optimizing an expected utility objective or other preference functions. In this paper, the value of data in facilitating making engineering design decisions is highlighted, and a data-driven design paradigm for practical engineering problems is proposed. The definition of data in this paradigm is elaborated first. Then the data involvement in a whole stage-based design process is investigated. An overall decision strategy for design problems under the data-driven paradigm is proposed. By a concrete satellite design example, the key ideas of the proposed data-driven design paradigm are demonstrated. Future work is also advised.

Sign in / Sign up

Export Citation Format

Share Document