- Main Page
- Namespaces
- Classes
- Files

- Search for |

# simulated_annealing.cpp

    00001 /*
    00002 * <simulated_annealing.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_rand.h>
    00046 #include <two_opt_incr_eval.h>
    00047
    00048 int
    00049 main (int __argc, char * __argv [])
    00050 {
    00051   if (__argc != 2)
    00052     {
    00053       std :: cerr << "Usage : ./simulated_annealing [instance]" << std :: endl ;
    00054       return 1 ;
    00055     }
    00056
    00057   Graph :: load (__argv [1]) ; // Instance
    00058
    00059   Route route ; // Solution
    00060
    00061   RouteInit init ; // Sol. Random Init.
    00062   init (route) ;
    00063
    00064   RouteEval full_eval ; // Full. Eval.
    00065   full_eval (route) ;
    00066
    00067   std :: cout << "[From] " << route << std :: endl ;
    00068
    00069   /* Tools for an efficient (? :-))
    00070      local search ! */
    00071
    00072   TwoOptRand two_opt_rand ; // Route Random. Gen.
    00073
    00074   TwoOptIncrEval two_opt_incr_eval ; // Eff. eval.
    00075
    00076   TwoOpt move ;
    00077
    00078   moExponentialCoolingSchedule cool_sched (0.1, 0.98) ; // Exponential Cooling Schedule
    00079   //moLinearCoolingSchedule cool_sched (0.1, 0.5) ; // Linear Cooling Schedule
    00080
    00081   moGenSolContinue <Route> cont (1000) ; /* Temperature Descreasing
    00082                                             will occur each 1000
    00083                                             iterations */
    00084
    00085   moSA <TwoOpt> simulated_annealing (two_opt_rand, two_opt_incr_eval, cont, 1000, cool_sched, full_eval) ;
    00086   simulated_annealing (route) ;
    00087
    00088   std :: cout << "[To] " << route << std :: endl ;
    00089
    00090   return 0 ;
    00091 }
    00092