Dynamic and random differential evolution solving constrained optimisation problems
Summary: A dynamic and random differential evolution (DRDE) is designed in this paper to solve constrained optimisation problems (COPs). The dynamic means that the COP is transformed into a dynamic constrained optimisation problem (DCOP), then a DRDE is designed to solve the DCOP for solving the original COP. The key issue is to maintain a feasible population since a feasible population would vanish the difficulty in constraint handling. A deliberate setting of the environment can achieve the maintenance as much as possible. The `random' in the DRDE means that the scaling factor of the DDE is randomly created in a range to increase search domain so as to enhance the performance of the DRDE. The DRDE is tested by a kit of widely used constraint benchmark problems. The experimental results suggest it outperforms or performs similarly to other state-of-the-art algorithms referred to in this paper.
- Engineering optimization by means of an improved constrained differential evolution
- A memetic differential evolution algorithm based on dynamic preference for constrained optimization problems
- Differential evolution with adaptive trial vector generation strategy and cluster-replacement-based feasibility rule for constrained optimization
- An adaptive constraint handling technique for differential evolution with dynamic use of variants in engineering optimization
- An improved differential evolution algorithm for solving constraint optimization problem
- Dynamic differential evolution with oppositional orthogonal crossover for large scale optimisation problems
- Differential evolution for a constrained combinatorial optimisation problem
- Differential evolution and combinatorial search for constrained index-tracking
- A memetic differential evolution algorithm based on dynamic preference for constrained optimization problems
- An improved (\(\mu+\lambda\))-constrained differential evolution for constrained optimization
- DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
- Evolutionary continuous constrained optimization using random direction repair
- Engineering optimization by means of an improved constrained differential evolution
This page was built for publication: Dynamic and random differential evolution solving constrained optimisation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2350550)
