// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-

// "iterated_local_search.cpp"

// (c) OPAC Team, LIFL, 2003-2007

/* LICENCE TEXT

   Contact:  paradiseo-help@lists.gforge.inria.fr
*/

#include <mo>
#include <tsp>

int
main (int __argc, char * __argv [])
{
  if (__argc != 2)
    {
      std :: cerr << "Usage : ./iterated_local_search [instance]" << std :: endl ;
      return 1 ;
    }

  Graph :: load (__argv [1]) ; // Instance

  Route route ; // Solution

  RouteInit init ; // Sol. Random Init.
  init (route) ;

  RouteEval full_eval ; // Full. Eval.
  full_eval (route) ;

  std :: cout << "[From] " << route << std :: endl ;

  TwoOptInit two_opt_init ; // Init.

  TwoOptNext two_opt_next ; // Explorer.

  TwoOptIncrEval two_opt_incr_eval ; // Eff. eval.

  moBestImprSelect <TwoOpt> two_opt_select ; //Move selection

  moGenSolContinue <Route> cont (1000) ; //Stopping criterion

  moFitComparator<Route> comparator; // Route comparator

  CitySwap perturbation; // Route perturbation

  moILS<TwoOpt> iterated_local_search (two_opt_init, two_opt_next, two_opt_incr_eval, two_opt_select,
                                       cont, comparator, perturbation, full_eval) ;
  iterated_local_search(route) ;

  std :: cout << "[To] " << route << std :: endl ;

  return 0 ;
}