Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems
From MaRDI portal
Recommendations
- Adaptive penalty strategies in genetic search for problems with inequality and equality constraints
- The Automatic Dynamic Penalisation method (ADP) for handling constraints with genetic algorithms
- An adaptive penalty scheme for genetic algorithms in structural optimization
- scientific article; zbMATH DE number 2013527
- scientific article; zbMATH DE number 2087680
- A new adaptive penalty function in the application of genetic algorithm
- An adaptive fuzzy penalty method for constrained evolutionary optimization
Cited in
(41)- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Numerical comparison of some penalty-based constraint handling techniques in genetic algorithms
- An efficient constraint handling method for genetic algorithms
- An evolutionary programming approach to mixed-variable optimization problems
- A line up evolutionary algorithm for solving nonlinear constrained optimization problems
- Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem
- A genetic algorithm based augmented Lagrangian method for constrained optimization
- Minimum penalty for constrained evolutionary optimization
- Penalty guided genetic search for redundancy optimization in multi-state series-parallel power system
- On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch
- The second generation of self-organizing adaptive penalty strategy for constrained genetic search
- Constraint handling in genetic algorithms: the set partitioning problem
- Multi-objective tabu search using a multinomial probability mass function
- A continuous approach to considering uncertainty in facility design
- A computational software system to design order picking warehouses
- A modified real coded genetic algorithm for constrained optimization
- A new adaptive penalty function in the application of genetic algorithm
- Penalty rules in multicriteria genetic search
- Adaptive penalty strategies in genetic search for problems with inequality and equality constraints
- Swarm intelligence for mixed-variable design optimization
- Scheduled penalty variable neighborhood search
- MILP models for complex system reliability redundancy allocation with mixed components
- A parallel tabu search for solving the primal buffer allocation problem in serial production systems
- scientific article; zbMATH DE number 5282977 (Why is no real title available?)
- scientific article; zbMATH DE number 1100795 (Why is no real title available?)
- scientific article; zbMATH DE number 2013527 (Why is no real title available?)
- Incorporating heterogeneous distance metrics within block layout design
- An adaptive penalty scheme for genetic algorithms in structural optimization
- Layout optimization considering production uncertainty and routing flexibility
- scientific article; zbMATH DE number 953074 (Why is no real title available?)
- scientific article; zbMATH DE number 2087680 (Why is no real title available?)
- The Automatic Dynamic Penalisation method (ADP) for handling constraints with genetic algorithms
- An adaptive constraint handling technique for differential evolution with dynamic use of variants in engineering optimization
- A computational study on different penalty approaches for solving constrained global optimization problems with the electromagnetism-like method
- An adaptive fuzzy penalty method for constrained evolutionary optimization
- Annealing a genetic algorithm for constrained optimization
- Matheuristics vs. metaheuristics for joint lot-sizing and dynamic pricing problem with nonlinear demands
- An improved test set approach to nonlinear integer problems with applications to engineering design
- Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives
- An adaptive decision maker for constrained evolutionary optimization
- Ant colony approach to constrained redundancy optimization in binary systems
This page was built for publication: Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284226)
