238 search results - page 17 / 48 » Parallel Ant Colonies for Combinatorial Optimization Problem... |
PG
2007
IEEE
14 years 1 months ago
2007
IEEE
We formulate contour correspondence as a Quadratic Assignment Problem (QAP), incorporating proximity information. By maintaining the neighborhood relation between points this way,...
EVOW
2000
Springer
13 years 11 months ago
2000
Springer
Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness...
GRC
2008
IEEE
13 years 8 months ago
2008
IEEE
Deceptive problems have been considered difficult for ant colony optimization (ACO) and it was believed that ACO will fail to converge to global optima of deceptive problems. Thi...
EVOW
2010
Springer
13 years 11 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
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...