Continuous Dynamic Constrained Optimization—The Challenges
Trung Thanh Nguyen,Xin Yao +1 more
TL;DR: This paper presents some investigations on the characteristics that might make DCOPs difficult to solve by some existing dynamic optimization (DO) and constraint handling (CH) algorithms and introduces a set of benchmark problems with these characteristics and test several representative DO and CH strategies.
read more
Abstract: Many real-world dynamic problems have constraints, and in certain cases not only the objective function changes over time, but also the constraints. However, there is no research in answering the question of whether current algorithms work well on continuous dynamic constrained optimization problems (DCOPs), nor is there any benchmark problem that reflects the common characteristics of continuous DCOPs. This paper contributes to the task of closing this gap. We will present some investigations on the characteristics that might make DCOPs difficult to solve by some existing dynamic optimization (DO) and constraint handling (CH) algorithms. We will then introduce a set of benchmark problems with these characteristics and test several representative DO and CH strategies on these problems. The results confirm that DCOPs do have special characteristics that can significantly affect algorithm performance. The results also reveal some interesting observations where the presence or combination of different types of dynamics and constraints can make the problems easier to solve for certain types of algorithms. Based on the analyses of the results, a list of potential requirements that an algorithm should meet to solve DCOPs effectively will be proposed.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Bare bones particle swarm with scale mixtures of Gaussians for dynamic constrained optimization
Mauro Campos,Renato A. Krohling +1 more
- 06 Jul 2014
TL;DR: Experimental results show the suitability of the proposed BBPSO for dynamic single-objective constrained optimization problems in terms of effectiveness to find good solutions for all benchmark problems investigated.
8
Sensitivity-Based Change Detection for Dynamic Constrained Optimization
TL;DR: This research proposes a sensitive constraint detection mechanism that provides valuable information for determining the movements of solutions in changing environments and is adopted with a multi-operator evolutionary type of algorithm which is then tested on a set of constrained dynamic problems.
•Posted Content
On the Behaviour of Differential Evolution for Problems with Dynamic Linear Constraints
Maryam Hasani-Shoreh,Maria-Yaneli Ameca-Alducin,Wilson Blaikie,Frank Neumann,Marc Schoenauer +4 more
TL;DR: This paper introduces a framework which produces benchmarks in which a dynamic environment is created with simple changes in linear constraints (rotation and translation of constraint’s hyperplane) and reveals that with these changes set, there was an observable effect on the performance of the constraint handling techniques.
7
Benchmarking Dynamic Three-Dimensional Bin Packing Problems Using Discrete-Event Simulation
Ran Wang,Trung Thanh Nguyen,Shayan Kavakeb,Zaili Yang,Changhe Li +4 more
- 30 Mar 2016
TL;DR: A benchmark generator framework for dynamic three-dimensional (3D) bin packing problems (BPPs) is developed for the first time using an open source discrete-event simulation platform and can be integrated with any dynamic BPP algorithm so that the optimisation algorithm can be run alongside the simulation to solve dynamic B PPs.
7
•Journal Article
Path planning of mobile robot based on improved Particle Swarm Optimization in dynamic environment
TL;DR: The simulation of application in the path planning of mobile robot proved that the modeling method algorithm of path planning is feasible and efficient.
7
References
•Book
Handbook of Genetic Algorithms
Lawrence Davis
- 01 Jan 1991
TL;DR: This book sets out to explain what genetic algorithms are and how they can be used to solve real-world problems, and introduces the fundamental genetic algorithm (GA), and shows how the basic technique may be applied to a very simple numerical optimisation problem.
8.2K
•Book
Handbook of Evolutionary Computation
Thomas Bäck,David B. Fogel,Zbigniew Michalewicz +2 more
- 01 Jan 1997
TL;DR: The Oxford University Press and the Institute of Physics have joined forces to create a major reference publication devoted to EC fundamentals, models, algorithms and applications, intended to become the standard reference resource for the evolutionary computation community.
3.1K
Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art
TL;DR: 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.
2.1K
Stochastic ranking for constrained evolutionary optimization
Thomas Philip Runarsson,Xin Yao +1 more
TL;DR: 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 optimization in uncertain environments-a survey
Yaochu Jin,Jürgen Branke +1 more
TL;DR: This paper attempts to provide a comprehensive overview of the related work within a unified framework on addressing different uncertainties in evolutionary computation, which has been scattered in a variety of research areas.