Problem structure heuristics and scaling behavior for genetic algorithms

DOI10.1016/0004-3702(95)00058-5MaRDI QIDQ2674193zbMATH OpenOpenAlexFDO

Authors 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

constraint satisfactiongenetic algorithmsproblem structure search heuristicsearch phase transitions

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2040682
• GA performance distributions and randomly generated binary constraint satisfaction problems.
• VEGAS -- a new genetic algorithm for satisfiability
• scientific article; zbMATH DE number 1664955
• The minimal deceptive problem revisited: The role of genetic waste.

Cites work

• Critical Behavior in the Satisfiability of Random Boolean Expressions
• Easy problems are sometimes hard
• Exploiting the deep structure of constraint problems
• GENETIC ALGORITHMS: WHAT FITNESS SCALING IS OPTIMAL?
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3942890 (Why is no real title available?)
• scientific article; zbMATH DE number 67483 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Optimization by simulated annealing
• The hardest constraint problems: A double phase transition

Cited in

(9)

• Measuring instance difficulty for combinatorial optimization problems
• GA performance distributions and randomly generated binary constraint satisfaction problems.
• VEGAS -- a new genetic algorithm for satisfiability
• GENETIC ALGORITHMS: WHAT FITNESS SCALING IS OPTIMAL?
• scientific article; zbMATH DE number 2044679 (Why is no real title available?)
• scientific article; zbMATH DE number 2040682 (Why is no real title available?)
• The parameter-less genetic algorithm in practice
• Advances in Neural Networks – ISNN 2005
• Induction over strategic agents: a genetic algorithm solution

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

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