opt_route.cpp

00001 /* 
00002 * <opt_route.cpp>
00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
00004 * (C) OPAC Team, LIFL, 2002-2007
00005 *
00006 * Sebastien Cahon, Alexandru-Adrian Tantar
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 "opt_route.h"
00038 
00039 #define MAX_TRASH_LENGTH 1000
00040 #define MAX_FIELD_LENGTH 1000
00041 #define MAX_LINE_LENGTH 1000
00042 
00043 static void getNextField (FILE * __f, char * __buff) {
00044   
00045   char trash [MAX_TRASH_LENGTH];  
00046 
00047   fscanf (__f, "%[ \t:\n]", trash); /* Discarding sep. */ 
00048   fscanf (__f, "%[^:\n]", __buff); /* Reading the field */
00049   fgetc (__f);
00050 }
00051 
00052 static void getLine (FILE * __f, char * __buff) {
00053 
00054   char trash [MAX_TRASH_LENGTH];  
00055 
00056   fscanf (__f, "%[ \t:\n]", trash); /* Discarding sep. */ 
00057   fscanf (__f, "%[^\n]", __buff); /* Reading the line */
00058 }
00059 
00060 static void loadBestRoute (FILE * __f) {
00061 
00062   opt_route.clear ();
00063   
00064   for (unsigned i = 0; i < numNodes; i ++) {
00065     Node node;
00066     fscanf (__f, "%u", & node);
00067     opt_route.push_back (node - 1);
00068   }
00069   int d; /* -1 ! */
00070   fscanf (__f, "%d", & d);
00071 }
00072 
00073 void loadOptimumRoute (const char * __filename) {
00074 
00075   FILE * f = fopen (__filename, "r");
00076 
00077   if (f) {
00078      
00079      printf ("Loading '%s'.\n", __filename);
00080      
00081      char field [MAX_FIELD_LENGTH];
00082      
00083      getNextField (f, field); /* Name */
00084      assert (strstr (field, "NAME"));
00085      getNextField (f, field); 
00086      //printf ("NAME: %s.\n", field);
00087 
00088           getNextField (f, field); /* Comment */
00089      assert (strstr (field, "COMMENT"));
00090      getLine (f, field);
00091      //     printf ("COMMENT: %s.\n", field);
00092      
00093      getNextField (f, field); /* Type */
00094      assert (strstr (field, "TYPE"));
00095      getNextField (f, field); 
00096      //printf ("TYPE: %s.\n", field);
00097 
00098      getNextField (f, field); /* Dimension */
00099      assert (strstr (field, "DIMENSION"));
00100      getNextField (f, field); 
00101      //     printf ("DIMENSION: %s.\n", field);
00102      numNodes = atoi (field);
00103 
00104      getNextField (f, field); /* Tour section */
00105      assert (strstr (field, "TOUR_SECTION"));
00106      loadBestRoute (f);
00107      
00108      getNextField (f, field); /* End of file */
00109      assert (strstr (field, "EOF"));
00110      //printf ("EOF.\n");
00111      
00112      printf ("The length of the best route is %u.\n", length (opt_route));
00113   }
00114    else {
00115      
00116      fprintf (stderr, "Can't open '%s'.\n", __filename); 
00117      exit (1);
00118    }
00119 }
00120 
00121 void loadOptimumRoute (eoParser & __parser) {
00122   
00123   /* Getting the path of the instance */
00124   
00125   eoValueParam <std :: string> param ("", "optimumTour", "Optimum tour") ;
00126   __parser.processParam (param) ;
00127   if (strlen (param.value ().c_str ()))
00128     loadOptimumRoute (param.value ().c_str ());
00129   else
00130     opt_route.fitness (0);
00131 }
00132 
00133 Route opt_route; /* Optimum route */
00134 
00135 

Generated on Mon Oct 8 11:16:45 2007 for ParadisEO-PEOMovingObjects by  doxygen 1.4.7