Sciweavers

2157 search results - page 55 / 432
» Binary ant algorithm
Sort
View
CPAIOR
2010
Springer
14 years 1 months ago
Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
Madjid Khichane, Patrick Albert, Christine Solnon
ANTSW
2006
Springer
14 years 7 days ago
Parallel Ant Colony Optimization for the Traveling Salesman Problem
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions f...
Max Manfrin, Mauro Birattari, Thomas Stützle,...
ICEC
1996
123views more  ICEC 1996»
13 years 9 months ago
Solving Symmetric and Asymmetric TSPs by Ant Colonies
- In this paper we present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We a...
Luca Maria Gambardella, Marco Dorigo
COR
2008
122views more  COR 2008»
13 years 8 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
DASFAA
2008
IEEE
90views Database» more  DASFAA 2008»
14 years 3 months ago
Even an Ant Can Create an XSD
Abstract. The XML has undoubtedly become a standard for data representation and manipulation. But most of XML documents are still created without the respective description of its ...
Ondrej Vosta, Irena Mlynkova, Jaroslav Pokorn&yacu...