Solving Engineering Optimization Problems Without Penalty
From MaRDI portal
Publication:3383908
Recommendations
- A method without a penalty function or a filter for nonlinear constrained optimization
- An efficient constraint handling method for genetic algorithms
- scientific article; zbMATH DE number 2086454
- scientific article; zbMATH DE number 6747041
- An adaptive penalty scheme for genetic algorithms in structural optimization
Cites work
- A Genetic Algorithm for the Multiple-Choice Integer Program
- A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization
- A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice
- A New Metaheuristic Bat-Inspired Algorithm
- A novel heuristic optimization method: charged system search
- An effective co-evolutionary differential evolution for constrained optimization
- An efficient constraint handling method for genetic algorithms
- An empirical study about the usefulness of evolution strategies to solve constrained optimization problems
- BIANCA: a genetic algorithm to solve hard combinatorial optimisation problems in engineering
- Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation
- GSA: A gravitational search algorithm
- scientific article; zbMATH DE number 5519825 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 2013517 (Why is no real title available?)
- scientific article; zbMATH DE number 2078137 (Why is no real title available?)
- scientific article; zbMATH DE number 3308855 (Why is no real title available?)
- scientific article; zbMATH DE number 2222828 (Why is no real title available?)
- Local search algorithms for combinatorial problems. Analysis, improvements, and new applications (Thesis TU Darmstadt 1998)
- Multi-objective design optimisation of rolling bearings using genetic algorithms
- On three new approaches to handle constraints within evolution strategies
- Optimization by simulated annealing
- Solving engineering optimization problems with tabu/scatter search
- The Automatic Dynamic Penalisation method (ADP) for handling constraints with genetic algorithms
- The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Theoretical and practical convergence of a self-adaptive penalty algorithm for constrained global optimization
- Variable neighborhood search
- Variational methods for the solution of problems of equilibrium and vibrations
This page was built for publication: Solving Engineering Optimization Problems Without Penalty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3383908)
