//  BinaryTournament2.java
//
//  Author:
//       Antonio J. Nebro <antonio@lcc.uma.es>
//       Juan J. Durillo <durillo@lcc.uma.es>
//
//  Copyright (c) 2011 Antonio J. Nebro, Juan J. Durillo
//
//  This program is free software: you can redistribute it and/or modify
//  it under the terms of the GNU Lesser General Public License as published by
//  the Free Software Foundation, either version 3 of the License, or
//  (at your option) any later version.
//
//  This program is distributed in the hope that it will be useful,
//  but WITHOUT ANY WARRANTY; without even the implied warranty of
//  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
//  GNU Lesser General Public License for more details.
// 
//  You should have received a copy of the GNU Lesser General Public License
//  along with this program.  If not, see <http://www.gnu.org/licenses/>.

package jmetal.operators.selection;

import jmetal.core.Solution;
import jmetal.core.SolutionSet;
import jmetal.util.PseudoRandom;
import jmetal.util.comparators.DominanceComparator;

import java.util.Comparator;
import java.util.HashMap;

/**
 * This class implements an operator for binary selections using the same code
 * in Deb's NSGA-II implementation
 */
public class BinaryTournament3 extends Selection {

  /**
   * dominance_ store the <code>Comparator</code> for check dominance_
   */
  private Comparator dominance_;

  /**
   * a_ stores a permutation of the solutions in the solutionSet used
   */
  private int a_[];

  /**
   *  index_ stores the actual index for selection
   */
  private int index_ = 0;

  /**
   * Constructor
   * Creates a new instance of the Binary tournament operator (Deb's
   * NSGA-II implementation version)
   */
  public BinaryTournament3(HashMap<String, Object> parameters)
  {
    super(parameters) ;
    dominance_ = new DominanceComparator();
  } // BinaryTournament2




  /**
   * Performs the operation
   * @param object Object representing a SolutionSet
   * @return the selected solution
   */
  public Object execute(Object object)
  {
    SolutionSet population = (SolutionSet)object;
    if (index_ == 0) //Create the permutation
    {
      a_= (new jmetal.util.PermutationUtility()).intPermutation(population.size());
    }


    Solution ganador = null;
    Solution solution1 = null, solution2 = null;

    int iter = 0;
    while(iter <= 10) {

      solution1 = population.get(a_[index_]);
      solution2 = population.get(a_[index_ + 1]);

      index_ = (index_ + 2) % population.size();

      int flag = dominance_.compare(solution1, solution2);
      if (flag == -1) {
        return solution1;

      }
      else if (flag == 1) {
        return solution2;

      }
      else if (solution1.getCrowdingDistance() > solution2.getCrowdingDistance()) {
        return solution1;

      }
      else if (solution2.getCrowdingDistance() > solution1.getCrowdingDistance()) {
        return solution2;
      }
      else {
        iter++;
      }
    }

    //Si llegue aca no encontre ganador
    if (PseudoRandom.randDouble()<0.5)
      return solution1;
    else
      return solution2;

  } // execute
} // BinaryTournament2