Sciweavers

Share
EVOW
2007
Springer

Iterated k-Opt Local Search for the Maximum Clique Problem

9 years 3 months ago
Iterated k-Opt Local Search for the Maximum Clique Problem
Abstract. This paper presents a simple iterated local search metaheuristic incorporating a k-opt local search (KLS), called Iterated KLS (IKLS for short), for solving the maximum clique problem (MCP). IKLS consists of three components: LocalSearch at which KLS is used, a Kick called LEC-Kick that escapes from local optima, and Restart that occasionally diversifies the search by moving to other points in the search space. IKLS is evaluated on DIMACS benchmark graphs. The results showed that IKLS is an effective algorithm for the MCP through comparisons with multi-start KLS and state-of-the-art metaheuristics.
Kengo Katayama, Masashi Sadamatsu, Hiroyuki Narihi
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where EVOW
Authors Kengo Katayama, Masashi Sadamatsu, Hiroyuki Narihisa
Comments (0)
books