Pages that link to "Item:Q5284226"
From MaRDI portal
The following pages link to Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems (Q5284226):
Displaying 34 items.
- A modified real coded genetic algorithm for constrained optimization (Q272431) (← links)
- Scheduled penalty variable neighborhood search (Q337204) (← links)
- A parallel tabu search for solving the primal buffer allocation problem in serial production systems (Q342074) (← links)
- The Automatic Dynamic Penalisation method (ADP) for handling constraints with genetic algorithms (Q502520) (← links)
- An adaptive constraint handling technique for differential evolution with dynamic use of variants in engineering optimization (Q535694) (← links)
- Annealing a genetic algorithm for constrained optimization (Q613595) (← links)
- An improved test set approach to nonlinear integer problems with applications to engineering design (Q887181) (← links)
- Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives (Q945048) (← links)
- An adaptive decision maker for constrained evolutionary optimization (Q961610) (← links)
- Ant colony approach to constrained redundancy optimization in binary systems (Q969340) (← links)
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art (Q1348274) (← links)
- Numerical comparison of some penalty-based constraint handling techniques in genetic algorithms (Q1430179) (← links)
- An efficient constraint handling method for genetic algorithms (Q1574382) (← links)
- An evolutionary programming approach to mixed-variable optimization problems (Q1592330) (← links)
- A line up evolutionary algorithm for solving nonlinear constrained optimization problems (Q1764763) (← links)
- Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem (Q1776955) (← links)
- A genetic algorithm based augmented Lagrangian method for constrained optimization (Q1935579) (← links)
- Minimum penalty for constrained evolutionary optimization (Q2340530) (← links)
- Penalty guided genetic search for redundancy optimization in multi-state series-parallel power system (Q2369985) (← links)
- On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch (Q2427178) (← links)
- The second generation of self-organizing adaptive penalty strategy for constrained genetic search (Q2485206) (← links)
- Multi-objective tabu search using a multinomial probability mass function (Q2572860) (← links)
- A continuous approach to considering uncertainty in facility design (Q2581616) (← links)
- A computational software system to design order picking warehouses (Q2668754) (← links)
- A new adaptive penalty function in the application of genetic algorithm (Q2992662) (← links)
- Swarm intelligence for mixed-variable design optimization (Q3371703) (← links)
- MILP Models for Complex System Reliability Redundancy Allocation with Mixed Components (Q3386786) (← links)
- (Q3500154) (← links)
- Incorporating heterogeneous distance metrics within block layout design (Q4460050) (← links)
- An adaptive penalty scheme for genetic algorithms in structural optimization (Q4462919) (← links)
- Layout optimization considering production uncertainty and routing flexibility (Q4671330) (← links)
- A computational study on different penalty approaches for solving constrained global optimization problems with the electromagnetism-like method (Q5413893) (← links)
- An adaptive fuzzy penalty method for constrained evolutionary optimization (Q6092068) (← links)
- Matheuristics vs. metaheuristics for joint lot-sizing and dynamic pricing problem with nonlinear demands (Q6551107) (← links)
