We present a new library, INCOP, which provides incomplete algorithms for optimizing combinatorial problems. This library offers local search methods such as simulated annealing, tabu search as well as a population based method, Go With the Winners. Several problems have been encoded, including Constraint Satisfaction Problems, graph coloring, frequency assignment.\parINCOP is an open C++ library. The user can easily add new algorithms and encode new problems. The neighborhood management has been carefully studied. First, an original parameterized move selection allows us to easily implement most of the existing meta-heuristics. Second, different levels of incrementality can be specified for the configuration cost computation, which highly improves efficiency.\parINCOP has shown great performances on well-known benchmarks. The challenging flat300_28 graph coloring instance has been colored in 30 colors for the first time by a standard Metropolis algorithm.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 2 articles , 1 standard article )

Showing results 1 to 2 of 2.
Sorted by year (citations)

  1. Meunier, Frédéric; Neveu, Bertrand: Computing solutions of the paintshop-necklace problem (2012)
  2. Neveu, Bertrand; Trombettoni, Gilles: INCOP: An open library for incomplete combinatorial optimization (2003) ioport