source: branches/VRP/HeuristicLab.Problems.VehicleRouting/3.3/Encodings/GVR/GVREncoding.cs @ 4230

#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2010 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 HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Data;
using HeuristicLab.Encodings.PermutationEncoding;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
using System.Drawing;
using System.Collections.Generic;
using HeuristicLab.Problems.VehicleRouting.Encodings.General;

namespace HeuristicLab.Problems.VehicleRouting.Encodings.GVR {
  [Item("GVREncoding", "Represents a potvin encoding of VRP solutions. It is implemented as described in Pereira, F.B. et al (2002). GVR: a New Genetic Representation for the Vehicle Routing Problem. AICS 2002, LNAI 2464, pp. 95-102.")]
  [StorableClass]
  public class GVREncoding : TourEncoding {
    [Storable]
    private DoubleValue capacity { get; set; }

    [Storable]
    private IntValue vehicles { get; set; }

    [Storable]
    private DoubleArray demand { get; set; }

    public override List<Tour> GetTours() {
      List<Tour> tours = new List<Tour>();

      int toursProcessed = 0;
      foreach (Tour tour in base.Tours) {
        Tour newTour = new Tour();
        double currentDemand = 0;

        foreach (int city in tour.Cities) {
          currentDemand += demand[city];

          if (vehicles.Value > tours.Count + base.Tours.Count - toursProcessed && 
            currentDemand > capacity.Value) {
            if(newTour.Cities.Count > 0)
              tours.Add(newTour);

            newTour = new Tour();
            newTour.Cities.Add(city);
            currentDemand = demand[city];
          } else {
            newTour.Cities.Add(city);
          }
        }

        if (newTour.Cities.Count > 0)
          tours.Add(newTour);
        toursProcessed++;
      }

      return tours;
    }
    
    public override IDeepCloneable Clone(HeuristicLab.Common.Cloner cloner) {
      GVREncoding clone = new GVREncoding(capacity, demand, vehicles);
      cloner.RegisterClonedObject(this, clone);
      clone.Tours = (ItemList<Tour>)cloner.Clone(this.Tours);
     
      return clone;
    }

    public GVREncoding(DoubleValue capacity, DoubleArray demand, IntValue vehicles)
      : base() {
        this.capacity = capacity;
        this.demand = demand;
        this.vehicles = vehicles;
    }

    [StorableConstructor]
    private GVREncoding(bool serializing)
      : base() {
    }

    public static GVREncoding ConvertFrom(IVRPEncoding encoding, DoubleValue capacity, DoubleArray demand, IntValue vehicles) {
      GVREncoding solution = new GVREncoding(capacity, demand, vehicles);

      TourEncoding.ConvertFrom(encoding, solution);

      return solution;
    }

    public static GVREncoding ConvertFrom(List<int> route, DoubleValue capacity, DoubleArray demand, IntValue vehicles) {
      GVREncoding solution = new GVREncoding(capacity, demand, vehicles);

      TourEncoding.ConvertFrom(route, solution);

      return solution;
    }

    internal void FindCustomer(int customer, out Tour tour, out int index) {
      tour = null;
      index = -1;

      int currentTour = 0;
      while (tour == null && currentTour < Tours.Count) {
        int currentCity = 0;
        while (tour == null && currentCity < Tours[currentTour].Cities.Count) {
          if (Tours[currentTour].Cities[currentCity] == customer) {
            tour = Tours[currentTour];
            index = currentCity;
          }

          currentCity++;
        }

        currentTour++;
      }
    }
  }
}