Solving Engineering Optimization Problems Without Penalty

DOI10.1142/S0219876221500079OpenAlexW3089464534MaRDI QIDQ3383908

Abderrahim Belmadani, Sihem Zaoui

Publication date: 16 December 2021

Published in: International Journal of Computational Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219876221500079

zbMATH Keywords

mathematical morphologyconstraint optimizationstochastic searchengineering problems

Mathematics Subject Classification ID

Systems theory; control (93-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The Automatic Dynamic Penalisation method (ADP) for handling constraints with genetic algorithms
• BIANCA: a genetic algorithm to solve hard combinatorial optimisation problems in engineering
• On three new approaches to handle constraints within evolution strategies
• An effective co-evolutionary differential evolution for constrained optimization
• A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization
• Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
• Variable neighborhood search
• An efficient constraint handling method for genetic algorithms
• Theoretical and practical convergence of a self-adaptive penalty algorithm for constrained global optimization
• A novel heuristic optimization method: charged system search
• Multi-objective design optimisation of rolling bearings using genetic algorithms
• GSA: A gravitational search algorithm
• A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice
• An empirical study about the usefulness of evolution strategies to solve constrained optimization problems
• A New Metaheuristic Bat-Inspired Algorithm
• The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
• A Genetic Algorithm for the Multiple-Choice Integer Program
• Solving engineering optimization problems with tabu/scatter search
• Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation
• Variational methods for the solution of problems of equilibrium and vibrations

This page was built for publication: Solving Engineering Optimization Problems Without Penalty