Annealing a genetic algorithm for constrained optimization

DOI10.1007/s10957-010-9716-zzbMath1202.90243OpenAlexW2088134026MaRDI QIDQ613595

Franklin Mendivil, Ronald 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

zbMATH Keywords

constrained optimizationsimulated annealinggenetic algorithmsMarkov chainconvergence proofs

Mathematics Subject Classification ID

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

Related Items (1)

Scheduled penalty variable neighborhood search

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel recombinative simulated annealing: A genetic algorithm
• Nonstationary Markov chains and convergence of the annealing algorithm
• On the convergence of genetic algorithms
• A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
• Simulated annealing methods with general acceptance probabilities
• Convergence in Probability of Compressed Annealing

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