Inc*: an incremental approach for improving local search heuristics

Mohamed Bader, R. Poli

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)peer-review

76 Downloads (Pure)

Abstract

This paper presents Inc*, a general algorithm that can be used in conjunction with any local search heuristic and that has the potential to substantially improve the overall performance of the heuristic. Genetic programming is used to discover new strategies for the Inc* algorithm. We experimentally compare performance of local heuristics for SAT with and without the Inc* algorithm. Results show that Inc* consistently improves performance.
Original languageEnglish
Title of host publicationEvolutionary computation in combinatorial optimization: 8th European conference, EvoCOP 2008, Naples, Italy, March 26-28, 2008, proceedings
EditorsJ. Van Hemert
Place of PublicationBerlin
PublisherSpringer
Pages194-205
Number of pages12
Volume4972
Edition4972
ISBN (Print)9783540786030
Publication statusPublished - Mar 2008
EventProceedings of the 8th European Conference, Evolutionary Computation in Combinatorial Optimization - Napoli, Italy
Duration: 26 Mar 200828 Mar 2008

Publication series

NameLecture notes in computer science
PublisherSpringer
Number4972

Conference

ConferenceProceedings of the 8th European Conference, Evolutionary Computation in Combinatorial Optimization
Abbreviated titleEvoCOP
Country/TerritoryItaly
CityNapoli
Period26/03/0828/03/08

Keywords

  • Genetic Programming
  • Boolean Satisfiability Problems (SAT)

Fingerprint

Dive into the research topics of 'Inc*: an incremental approach for improving local search heuristics'. Together they form a unique fingerprint.

Cite this