A new iterated local search algorithm using genetic crossover for the traveling salesman problem
Proceedings of the 1999 ACM symposium on Applied computing
A simple heuristic based genetic algorithm for the maximum clique problem
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming
Journal of Heuristics
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
Local Optimization and the Traveling Salesman Problem
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Chained Lin-Kernighan for Large Traveling Salesman Problems
INFORMS Journal on Computing
Dynamic local search for the maximum clique problem
Journal of Artificial Intelligence Research
Cooperating local search for the maximum clique problem
Journal of Heuristics
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
Artificial Intelligence
Hi-index | 0.00 |
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and drop moves, each of which can be interpreted as 1-opt move, to search a k-opt neighborhood solution at each iteration until no better k-opt neighborhood solution can be found. To evaluate our k-opt local search algorithm, we repeatedly apply the local search for each of DIMACS benchmark graphs and compare with the state-of-the-art metaheuristics such as the genetic local search and the iterated local search reported previously. The computational results show that in spite of the absence of major metaheuristic components, the k-opt local search is capable of finding better (at least the same) solutions on average than those obtained by these metaheuristics for all the graphs.