Sciweavers

599 search results - page 45 / 120
» The traveling salesman problem
Sort
View
GECCO
2003
Springer
141views Optimization» more  GECCO 2003»
14 years 1 months ago
Finding the Optimal Gene Order in Displaying Microarray Data
The rapid advances of genome-scale sequencing have brought out the necessity of developing new data processing techniques for enormous genomic data. Microarrays, for example, can g...
Seung-Kyu Lee, Yong-Hyuk Kim, Byung Ro Moon
JUCS
2008
200views more  JUCS 2008»
13 years 7 months ago
Tabu Search on GPU
: Nowadays Personal Computers (PCs) are often equipped with powerful, multi-core CPU. However, the processing power of the modern PC does not depend only of the processing power of...
Adam Janiak, Wladyslaw A. Janiak, Maciej Lichtenst...
CEC
2008
IEEE
14 years 2 months ago
DEACO: Hybrid Ant Colony Optimization with Differential Evolution
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
Xiangyin Zhang, Haibin Duan, Jiqiang Jin
EVOW
2004
Springer
14 years 1 months ago
Improving Edge Recombination through Alternate Inheritance and Greedy Manner
Genetic Algorithms (GAs) are well-known heuristic algorithms and have been widely applied to solve combinatorial problems. Edge recombination is one of the famous crossovers design...
Chuan-Kang Ting
COMPSAC
2004
IEEE
13 years 11 months ago
A Development Framework for Rapid Meta-Heuristics Hybridization
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
Hoong Chuin Lau, Wee Chong Wan, Min Kwang Lim, Ste...