GENETIC ALGORITHMS: WHAT FITNESS SCALING IS OPTIMAL?

DOI10.1080/01969729308961696zbMath0767.68085OpenAlexW2064229940MaRDI QIDQ4032900

Olac Fuentes, Chris Quintana, Vladik Ya. Kreinovich

Publication date: 16 May 1993

Published in: Cybernetics and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01969729308961696

zbMATH Keywords

genetic algorithmsscaling functionfitness scaling

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (7)

A new characterization of the set of all intervals, based on the necessity to check consistency easily ⋮ GEOMETRY OF EMOTIONS REVISITED: WHY DO EMOTIONS FORM A CIRCLE? ⋮ Metaheuristics: A bibliography ⋮ Problem structure heuristics and scaling behavior for genetic algorithms ⋮ Optimizing two-level reverse distribution networks with hybrid memetic algorithms ⋮ What segments are the best in representing contours? ⋮ Statistical and computational tradeoff in genetic algorithm-based estimation

Cites Work

• Optimization by Simulated Annealing
• A theoretical framework for simulated annealing
• Neural networks and physical systems with emergent collective computational abilities.
• Outline for a Logical Theory of Adaptive Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: GENETIC ALGORITHMS: WHAT FITNESS SCALING IS OPTIMAL?