Sciweavers

107 search results - page 4 / 22
» Searching for Maximum Cliques with Ant Colony Optimization
Sort
View
ICDE
2006
IEEE
190views Database» more  ICDE 2006»
14 years 1 months ago
Ant Algorithms for Search in Unstructured Peer-to-Peer Networks
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of...
Elke Michlmayr
KES
2007
Springer
14 years 1 months ago
Multiple Ant Colony Optimization for a Rich Vehicle Routing Problem: A Case Study
Rich vehicle routing problems try to represent situations that can be found in reality. Starting from a case study, in this paper a rich vehicle routing problem is analyzed. The e...
Paola Pellegrini, Daniela Favaretto, Elena Moretti
ANTSW
2008
Springer
13 years 8 months ago
Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...
Frank Neumann, Dirk Sudholt, Carsten Witt
EMO
2003
Springer
136views Optimization» more  EMO 2003»
14 years 20 days ago
Solving Multi-criteria Optimization Problems with Population-Based ACO
In this paper a Population-based Ant Colony Optimization approach is proposed to solve multi-criteria optimization problems where the population of solutions is chosen from the set...
Michael Guntsch, Martin Middendorf
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
13 years 5 months ago
Parallel shared memory strategies for ant-based optimization algorithms
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
Thang Nguyen Bui, ThanhVu H. Nguyen, Joseph R. Riz...