|
|
|
Felipe Martins Müller and Iaê Santos Bonilha
Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the objective of intelligently combining heuristic methods to solve hard optimization problems. Ant colony optimization (ACO) algorithms have been proven to deal with ...
ver más
|
|
|
|
|
|
|
Erna Budhiarti Nababan, Opim Salim Sitompul, Yuni Cancer
Pág. 87 - 100
Population size of classical genetic algorithm is determined constantly. Its size remains constant over the run. For more complex problems, larger population sizes need to be avoided from early convergence to produce local optimum. Objective of this rese...
ver más
|
|
|
|
|
|
|
Muhammad Rikzam Kamal,Romi Satria Wahono,Abdul Syukur
Pág. 61 - 66
Genetic Algorithm (GA) adalah metode adaptif yang digunakan untuk memecahkan masalah pencarian dan optimasi, diantaranya adalah Travelling Salesman Problem (TSP) yang merupakan persoalan optimasi, dimana rute terpendek merupakan solusi yang paling optima...
ver más
|
|
|
|