A selection of useful theoretical tools for the design and analysis of optimization heuristics
by Gregory Gutin, Daniel Karapetyan
Abstract:
An intensive practical experimentation is certainly required for the purpose of heuristics design and evaluation, however a theoretical approach is also important in this area of research. This paper gives a brief description of a selection of theoretical tools that can be used for designing and analyzing various heuristics. For design and evaluation, we consider several examples of preprocessing procedures and probabilistic instance analysis methods. We also discuss some attempts at the theoretical explanation of successes and failures of certain heuristics.
Reference:
A selection of useful theoretical tools for the design and analysis of optimization heuristics (Gregory Gutin, Daniel Karapetyan), Memetic Computing 1, 25–34, 2009.
Bibtex Entry:
@Article{Gutin2009b,
  Title                    = {A selection of useful theoretical tools for the design and analysis of optimization heuristics},
  Author                   = {Gutin, Gregory and Karapetyan, Daniel},
  Journal                  = {Memetic Computing},
  Year                     = {2009},
  Number                   = {1},
  Pages                    = {25--34},
  Volume                   = {1},
  Abstract                 = {An intensive practical experimentation is certainly required for the purpose of heuristics design and evaluation, however a theoretical approach is also important in this area of research. This paper gives a brief description of a selection of theoretical tools that can be used for designing and analyzing various heuristics. For design and evaluation, we consider several examples of preprocessing procedures and probabilistic instance analysis methods. We also discuss some attempts at the theoretical explanation of successes and failures of certain heuristics.},
  DOI                      = {10.1007/s12293-008-0001-8},
  ISSN                     = {18659284},
  Keywords                 = {Domination analysis,GTSP,Heuristics,MAP,Preprocessing,Probabilistic analysis,Very large neighborhood local search},
  Mendeley-tags            = {GTSP,MAP}
}