Problem structure heuristics and scaling behavior for genetic algorithms

DOI10.1016/0004-3702(95)00058-5OpenAlexW2050411967MaRDI QIDQ2674193

Scott H. Clearwater, Tad Hogg

Publication date: 22 September 2022

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(95)00058-5

zbMATH Keywords

genetic algorithmsconstraint satisfactionsearch phase transitionsproblem structure search heuristic

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Measuring instance difficulty for combinatorial optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The hardest constraint problems: A double phase transition
• Exploiting the deep structure of constraint problems
• Easy problems are sometimes hard
• Critical Behavior in the Satisfiability of Random Boolean Expressions
• GENETIC ALGORITHMS: WHAT FITNESS SCALING IS OPTIMAL?

This page was built for publication: Problem structure heuristics and scaling behavior for genetic algorithms