- Main Page
- Namespaces
- Classes
- Files

- Search for |

# hill_climbing.cpp

    00001 /*
    00002 * <hill_climbing.cpp>
    00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
    00004 * (C) OPAC Team, LIFL, 2002-2007
    00005 *
    00006 * Sébastien Cahon, Jean-Charles Boisson
    00007 *
    00008 * This software is governed by the CeCILL license under French law and
    00009 * abiding by the rules of distribution of free software.  You can  use,
    00010 * modify and/ or redistribute the software under the terms of the CeCILL
    00011 * license as circulated by CEA, CNRS and INRIA at the following URL
    00012 * "http://www.cecill.info".
    00013 *
    00014 * As a counterpart to the access to the source code and  rights to copy,
    00015 * modify and redistribute granted by the license, users are provided only
    00016 * with a limited warranty  and the software's author,  the holder of the
    00017 * economic rights,  and the successive licensors  have only  limited liability.
    00018 *
    00019 * In this respect, the user's attention is drawn to the risks associated
    00020 * with loading,  using,  modifying and/or developing or reproducing the
    00021 * software by the user in light of its specific status of free software,
    00022 * that may mean  that it is complicated to manipulate,  and  that  also
    00023 * therefore means  that it is reserved for developers  and  experienced
    00024 * professionals having in-depth computer knowledge. Users are therefore
    00025 * encouraged to load and test the software's suitability as regards their
    00026 * requirements in conditions enabling the security of their systems and/or
    00027 * data to be ensured and,  more generally, to use and operate it in the
    00028 * same conditions as regards security.
    00029 * The fact that you are presently reading this means that you have had
    00030 * knowledge of the CeCILL license and that you accept its terms.
    00031 *
    00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr
    00033 * Contact: paradiseo-help@lists.gforge.inria.fr
    00034 *
    00035 */
    00036
    00037 #include <mo.h>
    00038
    00039 #include <graph.h>
    00040 #include <route.h>
    00041 #include <route_eval.h>
    00042 #include <route_init.h>
    00043
    00044 #include <two_opt.h>
    00045 #include <two_opt_init.h>
    00046 #include <two_opt_next.h>
    00047 #include <two_opt_incr_eval.h>
    00048
    00049 int
    00050 main (int __argc, char * __argv [])
    00051 {
    00052   if (__argc != 2) {
    00053
    00054     std :: cerr << "Usage : ./hill_climbing [instance]" << std :: endl ;
    00055     return 1 ;
    00056   }
    00057
    00058   srand (1000) ;
    00059
    00060   Graph :: load (__argv [1]) ; // Instance
    00061
    00062   Route route ; // Solution
    00063
    00064   RouteInit init ; // Sol. Random Init.
    00065   init (route) ;
    00066
    00067   RouteEval full_eval ; // Full. Eval.
    00068   full_eval (route) ;
    00069
    00070   std :: cout << "[From] " << route << std :: endl ;
    00071
    00072   /* Tools for an efficient (? :-))
    00073      local search ! */
    00074
    00075   TwoOptInit two_opt_init ; // Init.
    00076
    00077   TwoOptNext two_opt_next ; // Explorer.
    00078
    00079   TwoOptIncrEval two_opt_incr_eval ; // Eff. eval.
    00080
    00081   //moFirstImprSelect <TwoOpt> two_opt_select ;
    00082   moBestImprSelect <TwoOpt> two_opt_select ;
    00083   //moRandImprSelect <TwoOpt> two_opt_select ;
    00084
    00085   moHC <TwoOpt> hill_climbing (two_opt_init, two_opt_next, two_opt_incr_eval, two_opt_select, full_eval) ;
    00086   hill_climbing (route) ;
    00087
    00088   std :: cout << "[To] " << route << std :: endl ;
    00089
    00090   return 0 ;
    00091 }
    00092