FlowShopInit.cpp

/*
* <FlowShopInit.cpp>
* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
* (C) OPAC Team, LIFL, 2002-2007
*
* Arnaud Liefooghe
*
* This software is governed by the CeCILL license under French law and
* abiding by the rules of distribution of free software.  You can  use,
* modify and/ or redistribute the software under the terms of the CeCILL
* license as circulated by CEA, CNRS and INRIA at the following URL
* "http://www.cecill.info".
*
* As a counterpart to the access to the source code and  rights to copy,
* modify and redistribute granted by the license, users are provided only
* with a limited warranty  and the software's author,  the holder of the
* economic rights,  and the successive licensors  have only  limited liability.
*
* In this respect, the user's attention is drawn to the risks associated
* with loading,  using,  modifying and/or developing or reproducing the
* software by the user in light of its specific status of free software,
* that may mean  that it is complicated to manipulate,  and  that  also
* therefore means  that it is reserved for developers  and  experienced
* professionals having in-depth computer knowledge. Users are therefore
* encouraged to load and test the software's suitability as regards their
* requirements in conditions enabling the security of their systems and/or
* data to be ensured and,  more generally, to use and operate it in the
* same conditions as regards security.
* The fact that you are presently reading this means that you have had
* knowledge of the CeCILL license and that you accept its terms.
*
* ParadisEO WebSite : http://paradiseo.gforge.inria.fr
* Contact: paradiseo-help@lists.gforge.inria.fr
*
*/
//-----------------------------------------------------------------------------

#include <FlowShopInit.h>


FlowShopInit::FlowShopInit(unsigned int _N) : N(_N)
{}


void FlowShopInit::operator()(FlowShop & _flowshop)
{
  // scheduling vector
  std::vector<unsigned int> scheduling(N);
  // initialisation of possible values
  std::vector<unsigned int> possibles(N);
  for (unsigned int i=0 ; i<N ; i++)
    possibles[i] = i;
  // random initialization
  unsigned int rInd;     // random index
  for (unsigned int i=0; i<N; i++)
    {
      rInd = (unsigned int) rng.uniform(N-i);
      scheduling[i] = possibles[rInd];
      possibles[rInd] = possibles[N-i-1];
    }
  _flowshop.resize(N);
  _flowshop.value(scheduling);
  _flowshop.invalidate();          // IMPORTANT in case the _genotype is old
}

---