Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Solving the maximum clique problem using a tabu search approach
Annals of Operations Research - Special issue on Tabu search
Modern heuristic techniques for combinatorial problems
On maximum clique problems in very large graphs
External memory algorithms
The ant colony optimization meta-heuristic
New ideas in optimization
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
New ideas in optimization
Fitness landscapes and memetic algorithm design
New ideas in optimization
Ant algorithms for discrete optimization
Artificial Life
Future Generation Computer Systems
Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique
Journal of Heuristics
The Ant System Applied to the Quadratic Assignment Problem
IEEE Transactions on Knowledge and Data Engineering
Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Boosting ACO with a Preprocessing Step
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
A Racing Algorithm for Configuring Metaheuristics
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
A Survey And Analysis Of Diversity Measures In Genetic Programming
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Measurement of Population Diversity
Selected Papers from the 5th European Conference on Artificial Evolution
Measuring the Spatial Dispersion of Evolutionary Search Processes: Application to Walksat
Selected Papers from the 5th European Conference on Artificial Evolution
Adaptive memories for the Quadratic Assignment Problems
Adaptive memories for the Quadratic Assignment Problems
Searching for maximum cliques with ant colony optimization
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ants can solve constraint satisfaction problems
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A leader-based parallel cross entropy algorithm for MCP
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Ants can solve the team orienteering problem
Computers and Industrial Engineering
Simple ingredients leading to very efficient heuristics for the maximum clique problem
Journal of Heuristics
Visualizing the search process of particle swarm optimization
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Dynamic local search for the maximum clique problem
Journal of Artificial Intelligence Research
Aproximating size of maximal clique in a node's neighbourhood in the ad hoc networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
An ant colony optimization approach for the multidimensional knapsack problem
Journal of Heuristics
New ideas for applying ant colony optimization to the set covering problem
Computers and Industrial Engineering
IEEE Transactions on Wireless Communications
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
Artificial Intelligence
A complete resolution of the Keller maximum clique problem
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Strong combination of ant colony optimization with constraint programming optimization
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A comparative study of ant colony optimization and reactive search for graph matching problems
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Two hybrid meta-heuristic approaches for minimum dominating set problem
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part II
Breakout Local Search for maximum clique problems
Computers and Operations Research
Subgraph extraction and metaheuristics for the maximum clique problem
Journal of Heuristics
Hybrid metaheuristic algorithms for minimum weight dominating set
Applied Soft Computing
Hi-index | 0.01 |
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of pairwise adjacent vertices in a graph. We propose and compare two different instantiations of a generic ACO algorithm for this problem. Basically, the generic ACO algorithm successively generates maximal cliques through the repeated addition of vertices into partial cliques, and uses "pheromone trails" as a greedy heuristic to choose, at each step, the next vertex to enter the clique. The two instantiations differ in the way pheromone trails are laid and exploited, i.e., on edges or on vertices of the graph.We illustrate the behavior of the two ACO instantiations on a representative benchmark instance and we study the impact of pheromone on the solution process. We consider two measures--the re-sampling and the dispersion ratio--for providing an insight into the performance at run time. We also study the benefit of integrating a local search procedure within the proposed ACO algorithm, and we show that this improves the solution process. Finally, we compare ACO performance with that of three other representative heuristic approaches, showing that the former obtains competitive results.