Sciweavers

124 search results - page 2 / 25
» Local Optima Networks of the Quadratic Assignment Problem
Sort
View
BMCBI
2006
113views more  BMCBI 2006»
13 years 5 months ago
GibbsST: a Gibbs sampling method for motif discovery with enhanced resistance to local optima
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
Kazuhito Shida
GECCO
2005
Springer
116views Optimization» more  GECCO 2005»
13 years 11 months ago
On identifying global optima in cooperative coevolution
When applied to optimization problems, Cooperative Coevolutionary Algorithms (CCEA) have been observed to exhibit a behavior called relative overgeneralization. Roughly, they tend...
Anthony Bucci, Jordan B. Pollack
GECCO
2006
Springer
287views Optimization» more  GECCO 2006»
13 years 9 months ago
A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
Yiliang Xu, Meng-Hiot Lim, Yew-Soon Ong, Jing Tang
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
13 years 5 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
13 years 9 months ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius