206 search results - page 26 / 42 » Ant colony optimization and the minimum cut problem |
COMPSAC
2004
IEEE
15 years 1 months ago
2004
IEEE
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...
ICUMT
2009
14 years 7 months ago
2009
This paper introduces a Combinatory Optimization Problem (COP) which captures the performance in cooperation of a P2P Streaming Network, considered at the buffer level. A new famil...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
We discuss testing methods for exposing origin-seeking bias in PSO motion algorithms. The strategy of resizing the initialization space, proposed by Gehlhaar and Fogel and made po...
NETWORKS
2007
14 years 9 months ago
2007
We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is mot...
CEC
2005
IEEE
15 years 3 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...