mn_bookchapters.bib

@INCOLLECTION{LouMarStu02:mh,
  AUTHOR = {H. R. Louren\c{c}o and O. Martin and T. St{\"u}tzle},
  TITLE = {Iterated Local Search},
  YEAR = {2002},
  PAGES = {321--353},
  SERIES = {International Series in Operations Research \& Management Science},
  VOLUME = 57,
  BOOKTITLE = {Handbook of Metaheuristics},
  EDITOR = {F.~Glover and G.~Kochenberger},
  PUBLISHER = {Kluwer Academic Publishers, Norwell, MA}
}


@INCOLLECTION{PaqChiStu:met-mo,
  AUTHOR = {L.~Paquete and M.~Chiarandini and T.~St{\"u}tzle},
  TITLE = {Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: {A}n Experimental Study},
  BOOKTITLE = {Metaheuristics for Multiobjective Optimisation},
  YEAR = {2004},
  EDITOR = {X.~Gandibleux and M.~Sevaux and K.~S{\"o}rensen and V.~T'kindt},
  SERIES = {Lecture Notes in Economics and Mathematical Systems},
  PUBLISHER = {Springer Verlag, Berlin, Germany},
  VOLUME = {535},
  NOTE = {to appear},
  OPTABSTRACT = {In this article, we study Pareto local optimum sets for the
  biobjective Traveling Salesman Problem applying straightforward
  extensions of local search algorithms for the single objective
  case. The performance of the local search algorithms is
  illustrated by experimental results obtained for well known
  benchmark instances and comparisons to methods from literature.
  In fact, a 3-opt local search is able to compete with
  the best performing metaheuristics in terms of solution
  quality. Finally, we also present an empirical study of the
  features of the solutions found by 3-opt on a set of randomly
  generated instances. The results indicate the existence of several
  clusters of near-optimal solutions that are separated by only a few
  edges.}
}