48 search results - page 7 / 10 » An Ant Colony Optimisation Algorithm for the Set Packing Pro... |
AINA
2006
IEEE
14 years 1 months ago
2006
IEEE
Multiple sequence alignment is an important and difficult problem in molecular biology and bioinformatics. In this paper, we propose a partitioning approach that significantly impr...
AAIM
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. The utilization of pseudo-random proportional rule to balance between the exploitation and exploration of the search process was shown in Ant Colony System (ACS) algorith...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
ACSC
2005
IEEE
14 years 1 months ago
2005
IEEE
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper describes and analyzes the aggregation pheromone system (APS) algorithm, which extends ant colony optimization (ACO) to continuous domains. APS uses the collective behav...