Sciweavers

50 search results - page 7 / 10
» An Ant Colony Optimization Algorithm for Multiple Travelling...
Sort
View
ICNC
2005
Springer
14 years 1 months ago
Adaptive Parallel Ant Colony Algorithm
: Two strategies for information exchange between processors in parallel ant colony algorithm are presented. Theses strategies can make each processor choose other processors to co...
Ling Chen, Chunfang Zhang
IPCO
2001
184views Optimization» more  IPCO 2001»
13 years 8 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
IPL
2008
146views more  IPL 2008»
13 years 7 months ago
A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
Nattapat Attiratanasunthron, Jittat Fakcharoenphol
AAIM
2005
Springer
110views Algorithms» more  AAIM 2005»
14 years 1 months ago
Dynamically Updating the Exploiting Parameter in Improving Performance of Ant-Based Algorithms
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...
Hoang Trung Dinh, Abdullah Al Mamun, Hieu T. Dinh
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 1 months ago
Screening the parameters affecting heuristic performance
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
Enda Ridge, Daniel Kudenko