Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems
From MaRDI portal
Publication:5284226
DOI10.1287/ijoc.8.2.173zbMath0866.90097MaRDI QIDQ5284226
Alice E. Smith, David W. Coit, 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
constrained optimization; genetic algorithms; system reliability; series-parallel redundancy allocation problem
68T05: Learning and adaptive systems in artificial intelligence
90B25: Reliability, availability, maintenance, inspection in operations research
90C27: Combinatorial optimization
Related Items
Incorporating heterogeneous distance metrics within block layout design, Layout optimization considering production uncertainty and routing flexibility, Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives, Ant colony approach to constrained redundancy optimization in binary systems, Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art, 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, Penalty guided genetic search for redundancy optimization in multi-state series-parallel power system, Multi-objective tabu search using a multinomial probability mass function, A continuous approach to considering uncertainty in facility design, Swarm intelligence for mixed-variable design optimization
Uses Software
