Kengo Katayama
ABSTRACT
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.
- D. Applegate, W. Cook, and A. Rohe, "Chained Lin-Kernighan for large traveling salesman problems," INFORMS Journal on Computing, vol. 15, no. 1, pp. 82--92, 2003. Google Scholar
Digital Library
- R. Battiti and M. Protasi, "Reactive local search for the maximum clique problem," Algorithmica, vol. 29, no. 4, pp. 610--637, 2001.Google ScholarDigital Library
- DIMACS URL: http://dimacs.rutgers.edu/Challenges/.Google Scholar
- M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, New York, 1979. Google ScholarDigital Library
- J. Hastad, "Clique is hard to approximate within n1-ε," Acta Mathematica, vol. 182, pp. 105--142, 1999.Google ScholarCross Ref
- D. S. Johnson and L. A. McGeoch, "The traveling salesman problem: A case study," Local Search in Combinatorial Optimization, John Wiley & Sons, pp. 215--310, 1997.Google Scholar
- D. S. Johnson, "Local optimization and the traveling salesman problem," Proc. 17th. International Colloquium on Automata, Languages and Programming, pp. 446--461, 1990. Google ScholarDigital Library
- K. Katayama, M. Tani, and H. Narihisa, "Solving large binary quadratic programming problems by effective genetic local search algorithm," Proc. of the 2000 Genetic and Evolutionary Computation Conference, pp. 643--650, 2000.Google Scholar
- K. Katayama and H. Narihisa, "Iterated local search approach using genetic transformation to the traveling salesman problem," Proc. of the Genetic and Evolutionary Computation Conference, vol. 1, pp. 321--328, 1999. Google ScholarDigital Library
- B. W. Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs," Bell System Technical Journal, vol. 49, pp. 291--307, 1970.Google Scholar
- S. Lin and B. W. Kernighan, "An effective heuristic algorithm for the traveling salesman problem," Operations Research, vol. 21, pp. 498--516, 1973.Google ScholarDigital Library
- E. Marchiori, "Genetic, iterated and multistart local search for the maximum clique problem," Applications of Evolutionary Computing, Springer, LNCS 2279, pp. 112--121, 2002. Google ScholarDigital Library
- E. Marchiori, "A simple heuristic based genetic algorithm for the maximum clique problem," Proc. of ACM Symposium on Applied Computing (SAC-98), pp. 366--373, 1998. Google ScholarDigital Library
- P. Merz and B. Freisleben, "Memetic algorithms for the traveling salesman problem," Complex Systems, vol. 13, no. 4, pp. 297--345, 2001.Google Scholar
- P. Merz and B. Freisleben, "Greedy and local search heuristics for unconstrained binary quadratic programming," Journal of Heuristics, vol. 8, no. 2, pp. 197--213, 2002. Google ScholarDigital Library
- M. Yagiura, T. Yamaguchi and T. Ibaraki, "A variable depth search algorithm for the generalized assignment problem," Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, (S. Voss, S. Martello, I. H. Osman and C. Roucairol, eds.), Kluwer Academic Publishers, pp. 459--471, 1999.Google Scholar
- Solving the maximum clique problem by k-opt local search
Recommendations
An effective local search for the maximum clique problem
We propose a variable depth search based algorithm, called k-opt local search (KLS), for the maximum clique problem. KLS efficiently explores the k-opt neighborhood defined as the set of neighbors that can be obtained by a sequence of several add and ...
Local search algorithms for the k-cardinality tree problem
In this paper we deal with an NP-hard combinatorial optimization problem, the k-cardinality tree problem in node-weighted graphs. This problem has several applications, which justify the need for efficient methods to obtain good solutions. We review ...
A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs
We propose a new neighborhood structure for the problem. The results demonstrate that our neighborhood structure is better than the current ones, and it has the additional benefit that it can be explored using a GPU-based massively parallel ...
Comments