Multiple trial vectors in differential evolution for engineering design
Engineering OptimizationPublished 19 June 2007
Efrén Mezura‐Montes, Carlos A. Coello Coello, Jesús Velázquez-Reyes, Lucía Muñoz-Dávila
Citations128
SJR quartileQ2
SJR score0.62
SNIP1.16
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A modified version of the differential evolution algorithm is presented to allow each parent vector in the population to generate more than one trial (child) vector at each generation and therefore to increase its probability of generating a better one.
Abstract
This article presents a modified version of the differential evolution algorithm to solve engineering design problems. The aim is to allow each parent vector in the population to generate more than one trial (child) vector at each generation and therefore to increase its probability of generating a better one. To deal with constraints, some criteria based on feasibility and a diversity mechanism to maintain infeasible solutions in the population are used. The approach is tested on a set of well-known benchmark problems. After that, it is used to solve engineering design problems and its performance is compared with those provided by typical penalty function approaches and also against state-of-the-art techniques.
Keywords
Computer Science
Particle swarm optimization
47,523 Citations2002James Kennedy, R.C. Eberhart
Oxford University Press eBooksEvolutionary Algorithms in Theory and Practice
4,299 Citations1996Thomas Bäck
In this work, the author compares the three most prominent representatives of evolutionary algorithms: genetic algorithms, evolution strategies, and evolutionary programming within a unified framework, thereby clarifying the similarities and differences of these methods.
Computer Methods in Applied Mechanics and EngineeringAn efficient constraint handling method for genetic algorithms
3,731 Citations2000Kalyanmoy Deb
GA's population-based approach and ability to make pair-wise comparison in tournament selection operator are exploited to devise a penalty function approach that does not require any penalty parameter to guide the search towards the constrained optimum.
Handbook of Evolutionary Computation
3,001 Citations1997
Comparing inertia weights and constriction factors in particle swarm optimization
2,941 Citations2002R.C. Eberhart, Yan Shi
It is concluded that the best approach is to use the constriction factor while limiting the maximum velocity Vmax to the dynamic range of the variable Xmax on each dimension.
Computer Methods in Applied Mechanics and EngineeringTheoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art
2,246 Citations2002Carlos A. Coello Coello
A comprehensive survey of the most popular constraint-handling techniques currently used with evolutionary algorithms, including approaches that go from simple variations of a penalty function, to others, more sophisticated, that are biologically inspired on emulations of the immune system, culture or ant colonies.
Elsevier eBooksIntroduction to Optimum Design
2,231 Citations2004Jasbir S. Arora
This fourth edition of the introduction to Optimum Design has been reorganized, rewritten in parts, and enhanced with new material, making the book even more appealing to instructors regardless of course level.
New Ideas In Optimization
2,135 Citations1999David Corne, Marco Dorigo +5 more
The techniques treated in this text represent research as elucidated by the leaders in the field and are applied to real problems, such as hilllclimbing, simulated annealing, and tabu search.
IEEE Transactions on Evolutionary ComputationStochastic ranking for constrained evolutionary optimization
1,778 Citations2000Thomas Philip Rúnarsson, Xin Yao
A novel approach to balance objective and penalty functions stochastically, i.e., stochastic ranking, is introduced, and a new view on penalty function methods in terms of the dominance of penalty and objective functions is presented.
Evolutionary ComputationEvolutionary Algorithms for Constrained Parameter Optimization Problems
1,709 Citations1996Zbigniew Michalewicz, Marc Schoenauer
Difficulty connected with solving the general nonlinear programming problem is discussed; several approaches that have emerged in the evolutionary computation community are surveyed; and a set of 11 interesting test cases are provided that may serve as a handy reference for future methods.
Lecture notes in computer scienceComparison between genetic algorithms and particle swarm optimization
1,600 Citations1998Russell C. Eberhart, Yuhui Shi
This paper compares two evolutionary computation paradigms: genetic algorithms and particle swarm optimization, and suggests ways in which performance might be improved by incorporating features from one paradigm into the other.
Lecture notes in computer scienceEvolutionary optimization versus particle swarm optimization: Philosophy and performance differences
1,119 Citations1998Peter J. Angeline
This paper investigates the philosophical and performance differences of particle swarm and evolutionary optimization by comparison experiments involving four non-linear functions well studied in the evolutionary optimization literature.
Journal of Mechanical DesignAn Augmented Lagrange Multiplier Based Method for Mixed Integer Discrete Continuous Optimization and Its Applications to Mechanical Design
777 Citations1994Balajee Kannan, S. N. Kramer
On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA's
750 Citations2002Jeffrey A. Joines, Christopher R. Houck
This paper discusses the use of non-stationary penalty functions to solve general nonlinear programming problems (NP) using real-valued GAs and the effectiveness of these methods is reported.
IEEE Transactions on Evolutionary ComputationA Simple Multimembered Evolution Strategy to Solve Constrained Optimization Problems
609 Citations2005Efrén Mezura‐Montes, Carlos A. Coello Coello
The proposed approach to solve global nonlinear optimization problems uses a simple diversity mechanism based on allowing infeasible solutions to remain in the population to find the global optimum despite reaching reasonably fast the feasible region of the search space.
IEEE Transactions on Evolutionary ComputationSociety and civilization: an optimization algorithm based on the simulation of social behavior
593 Citations2003Tapabrata Ray, K.M. Liew
The driving concept behind the optimization algorithm introduced in this paper that makes use of the intra and intersociety interactions within a formal society and the civilization model to solve single objective constrained optimization problems.
IEEE Transactions on Evolutionary ComputationSystem design by constraint adaptation and differential evolution
548 Citations1999Rainer Storn
A simple optimization procedure for constraint-based problems is described which works with a simplified cost function or even without one and is well suited for constraint satisfaction, constrained optimization, and design centering problems.
International Journal for Numerical Methods in EngineeringA study of mathematical programming methods for structural optimization. Part I: Theory
482 Citations1985Ashok D. Belegundu, Jasbir S. Arora
The aim of this paper is to discuss the applicability of modern optimization techniques to structural design problems, and to present mathematical programming methods from a unified and design engineers' viewpoint.
Engineering OptimizationAn improved particle swarm optimizer for mechanical design optimization problems
417 Citations2004Suining He, Emmanuel Prempain +1 more
An improved particle swarm optimizer (PSO) for solving mechanical design optimization problems involving problem-specific constraints and mixed variables such as integer, discrete and continuous variables is presented.
A Self Adaptive Penalty Function Based Algorithm for Constrained Optimization
261 Citations2006Biruk G. Tessema, Gary G. Yen
A new fitness value is placed in the normalized fitness-constraint violation space, and two penalty values are applied to infeasible individuals so that the algorithm would be able to identify the best infeasibility individuals in the current population.
Operations ResearchA Genetic Algorithm for the Multiple-Choice Integer Program
236 Citations1997Atidel B. Hadj-Alouane, James C. Bean
Extensive computational tests for dual degenerate problem instances show that suboptimal solutions can be obtained with the genetic algorithm within running times that are shorter than those of the OSL optimization routine.
Information SciencesFree Search—a comparative analysis
102 Citations2004Kalin Penev, Guy Littlefair
The achieved results suggest that Free Search has stable robust behaviour on explored tests; FS can cope with heterogeneous optimisation problems; FS is applicable to unknown (black-box) real-world optimisation tasks.
Problem-Independent Handling of Constraints by Use of Metric Penalty Functions.
94 Citations1996Frank Hoffmeister, Joachim Sprave
This paper presents a synthesis of both approaches avoiding the design of problemdependent surrogate functions in the former case as well as the excessive waste of computational resources and implicit information contained in infeasible test points in the latter case.