Skip to content
Snippets Groups Projects
Commit ab80df13 authored by Lucas Hernan Bruzzone Rodriguez's avatar Lucas Hernan Bruzzone Rodriguez
Browse files

Fix minor changes

parent 14a21a4e
No related branches found
No related tags found
No related merge requests found
......@@ -412,39 +412,40 @@ skeleton newGA
return !(*this == sol);
}
void Solution::initialize()
{
for (int x = 0; x < _pbm.cantColumnas(); x++)
void Solution::initialize()
{
for (int y = 0; y < _pbm.cantFilas(); y++)
for (int x = 0; x < _pbm.cantColumnas(); x++)
{
_var[x][y] = 0;
}
}
for (int i=0;i<_pbm.cantColumnas();i++)
{
int _firstPossible = 0;
int** _grupos = _pbm.datosColumnas();
int* _cantGruposEnColumna = _pbm.cantGruposColumna();
for(int j=0; j < _cantGruposEnColumna[i]; j++)
{
int _lastPossible = _pbm.cantFilas() - _grupos[i][j];
for (int k=j+1; k < _cantGruposEnColumna[i]; k++)
for (int y = 0; y < _pbm.cantFilas(); y++)
{
_lastPossible -= _grupos[i][k] + 1;
_var[x][y] = 0;
}
}
for (int i=0;i<_pbm.dimension();i++)
{
int _firstPossible = 0;
int** _grupos = _pbm.datosColumnas();
int* _cantGruposEnColumna = _pbm.cantGruposColumna();
int _startPosition = rand_int(_firstPossible, _lastPossible);
int _endPosition = _startPosition + _grupos[i][j] - 1;
for(int c = _startPosition; c < _endPosition; c++)
for(int j=0; j < _cantGruposEnColumna[i]; j++)
{
_var[j][c] = 1;
int _lastPossible = _pbm.cantFilas() - _grupos[i][j];
for (int k=j+1; k < _cantGruposEnColumna[i]; k++)
{
_lastPossible -= _grupos[i][k] + 1;
}
int _startPosition = rand_int(_firstPossible, _lastPossible);
int _endPosition = _startPosition + _grupos[i][j] - 1;
for(int c = _startPosition; c < _endPosition; c++)
{
_var[j][c] = 1;
}
_firstPossible = _endPosition + 1;
}
}
}
}
}
}
double Solution::fitness ()
{
......
......@@ -428,27 +428,8 @@ skeleton newGA
//cout << _pbm.dimension();
for (int i=0;i<_pbm.dimension();i++)
{
int _firstPossible = 0;
int** _grupos = _pbm.datosColumnas();
int* _cantGruposEnColumna = _pbm.cantGruposColumna();
for(int j=0; j < _cantGruposEnColumna[i]; j++)
{
int _lastPossible = _pbm.cantFilas() - _grupos[i][j];
for (int k=j+1; k < _cantGruposEnColumna[i]; k++)
{
_lastPossible -= _grupos[i][k] + 1;
}
int _startPosition = rand_int(_firstPossible, _lastPossible);
int _endPosition = _startPosition + _grupos[i][j] - 1;
for(int c = _startPosition; c < _endPosition; c++)
{
_var[j][c] = 1;
}
_firstPossible = _endPosition + 1;
}
_var[i]=rand_int(0,_pbm.cantEmpleados() - 1);
//_var[i]=rand_int(0,3);
}
}
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment