source: branches/GeneralizedQAP/HeuristicLab.Problems.GeneralizedQuadraticAssignment/3.3/Moves/StochasticNMoveSingleMoveGenerator.cs @ 7407

#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
 *
 * This file is part of HeuristicLab.
 *
 * HeuristicLab is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * HeuristicLab 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 General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
 */
#endregion

using System.Collections.Generic;
using HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Data;
using HeuristicLab.Encodings.IntegerVectorEncoding;
using HeuristicLab.Optimization;
using HeuristicLab.Parameters;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;

namespace HeuristicLab.Problems.GeneralizedQuadraticAssignment {
  [Item("Stochastic 1-move and 2-move SingleMoveGenerator", "Randomly samples a single 1-move or 2-move as described in Mateus, G., Resende, M., and Silva, R. 2011. GRASP with path-relinking for the generalized quadratic assignment problem. Journal of Heuristics 17, Springer Netherlands, pp. 527-565.")]
  [StorableClass]
  public class StochasticNMoveSingleMoveGenerator : GQAPNMoveGenerator, ILocationAwareGQAPOperator, ISingleMoveGenerator, IStochasticOperator {

    public ILookupParameter<IRandom> RandomParameter {
      get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
    }
    public ILookupParameter<DoubleArray> CapacitiesParameter {
      get { return (ILookupParameter<DoubleArray>)Parameters["Capacities"]; }
    }

    [StorableConstructor]
    protected StochasticNMoveSingleMoveGenerator(bool deserializing) : base(deserializing) { }
    protected StochasticNMoveSingleMoveGenerator(StochasticNMoveSingleMoveGenerator original, Cloner cloner) : base(original, cloner) { }
    public StochasticNMoveSingleMoveGenerator()
      : base() {
      Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator that should be used."));
      Parameters.Add(new LookupParameter<DoubleArray>("Capacities", "Capacities of the locations."));
    }

    public override IDeepCloneable Clone(Cloner cloner) {
      return new StochasticNMoveSingleMoveGenerator(this, cloner);
    }

    public static NMove Generate(IRandom random, IntegerVector assignment, int n, DoubleArray capacities) {
      int moving = random.Next(n) + 1;
      int[] equipments = new int[moving], locations = new int[moving];
      HashSet<int> chosenEquipments = new HashSet<int>();
      for (int i = 0; i < moving; i++) {
        do {
          equipments[i] = random.Next(assignment.Length);
        } while (chosenEquipments.Contains(equipments[i]));
        chosenEquipments.Add(equipments[i]);
        do {
          locations[i] = random.Next(capacities.Length);
        } while (locations[i] == assignment[equipments[i]]);
      }
      return new NMove(equipments, locations);
    }

    public override IEnumerable<NMove> GenerateMoves(IntegerVector assignment, int n) {
      yield return Generate(RandomParameter.ActualValue, assignment, n, CapacitiesParameter.ActualValue);
    }
  }
}