Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems

DOI10.1287/ijoc.8.2.173zbMath0866.90097OpenAlexW1979126188MaRDI QIDQ5284226

David W. Coit, Alice E. Smith, D. M. Tate

Publication date: 22 January 1997

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8d4f5c32426c11a6df80dacd6dc61c82ccf9d013

zbMATH Keywords

constrained optimization genetic algorithms system reliability series-parallel redundancy allocation problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27)

Related Items (20)

A modified real coded genetic algorithm for constrained optimization ⋮ Penalty guided genetic search for redundancy optimization in multi-state series-parallel power system ⋮ Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art ⋮ Scheduled penalty variable neighborhood search ⋮ A parallel tabu search for solving the primal buffer allocation problem in serial production systems ⋮ A computational software system to design order picking warehouses ⋮ 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 ⋮ A computational study on different penalty approaches for solving constrained global optimization problems with the electromagnetism-like method ⋮ An adaptive constraint handling technique for differential evolution with dynamic use of variants in engineering optimization ⋮ Ant colony approach to constrained redundancy optimization in binary systems ⋮ A line up evolutionary algorithm for solving nonlinear constrained optimization problems ⋮ Layout optimization considering production uncertainty and routing flexibility ⋮ Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem ⋮ Swarm intelligence for mixed-variable design optimization ⋮ MILP Models for Complex System Reliability Redundancy Allocation with Mixed Components ⋮ Incorporating heterogeneous distance metrics within block layout design ⋮ Multi-objective tabu search using a multinomial probability mass function ⋮ An evolutionary programming approach to mixed-variable optimization problems ⋮ A continuous approach to considering uncertainty in facility design

Uses Software

Genocop

This page was built for publication: Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems