Annealing a genetic algorithm for constrained optimization

DOI10.1007/S10957-010-9716-ZzbMATH Open1202.90243OpenAlexW2088134026MaRDI QIDQ613595FDOQ613595

F. Mendivil, R. Shonkwiler

Publication date: 21 December 2010

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-010-9716-z

Recommendations

• Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems
• An efficient constraint handling method for genetic algorithms
• Genetic algorithm for constrained global optimization in continuous variables
• Genetic algorithms in constrained optimization
• Genetic algorithms: Bridging the convergence gap

zbMATH Keywords

Markov chainsimulated annealingconstrained optimizationgenetic algorithmsconvergence proofs

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Nonlinear programming (90C30)

Cites Work

• A compressed-annealing heuristic for the traveling salesman problem with time windows
• Convergence in Probability of Compressed Annealing
• Title not available (Why is that?)
• Nonstationary Markov chains and convergence of the annealing algorithm
• Parallel recombinative simulated annealing: A genetic algorithm
• On the convergence of genetic algorithms
• Simulated annealing methods with general acceptance probabilities
• Title not available (Why is that?)

Cited In (4)

• Title not available (Why is that?)
• Optimizing simulated annealing schedules with genetic programming
• Scheduled penalty variable neighborhood search
• Fast annealing genetic algorithm for multi-objective optimization problems

This page was built for publication: Annealing a genetic algorithm for constrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613595)