Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi !

Dealings with Problem Hardness in Genetic Algorithms (CROSBI ID 152345)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Picek, Stjepan ; Golub, Marin Dealings with Problem Hardness in Genetic Algorithms // WSEAS transactions on computers, 8 (2009), 1; 747-756

Podaci o odgovornosti

Picek, Stjepan ; Golub, Marin

engleski

Dealings with Problem Hardness in Genetic Algorithms

Genetic algorithms (GA) have been successfully applied to various problems, both artificial as well as real-world problems. When working with GAs it is important to know those those kinds of situations when they will not find the optimal solution. In other words, to recognize problems that are difficult for a GA to solve. There are various reasons why GAs will not converge to optimal solutions. By combining one or more of these reasons a problem can become a GA-hard problem. Today, there are numerous methods for solving GA-hard problems ; every measure has its specific advantages and drawbacks. In this work the effectiveness of one of these measures is evaluated, namely the Negative Slope Coefficient (NSC) measure. A different measure is proposed, called the New Negative Slope Coefficient (NNSC) measure, which aims to address certain drawbacks of the original method. Possible guidelines for further development of this, and comparable methods are proposed.

Genetic Algorithm ; Unitation ; Fitness Landscape ; Negative Slope Coefficient ; Hardness ; Difficulty ; Deception

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

8 (1)

2009.

747-756

objavljeno

1109-2750

Povezanost rada

Računarstvo

Poveznice
Indeksiranost