- Timestamp:
- 07/07/19 23:40:10 (5 years ago)
- Location:
- stable
- Files:
-
- 14 edited
Legend:
- Unmodified
- Added
- Removed
-
stable
-
stable/HeuristicLab.Encodings.PermutationEncoding
- Property svn:mergeinfo changed
-
stable/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/CosaCrossover.cs
r15584 r17097 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 8Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 23 23 using HeuristicLab.Common; 24 24 using HeuristicLab.Core; 25 using H euristicLab.Persistence.Default.CompositeSerializers.Storable;25 using HEAL.Attic; 26 26 27 27 namespace HeuristicLab.Encodings.PermutationEncoding { … … 36 36 /// </remarks> 37 37 [Item("CosaCrossover", "An operator which performs the crossover described in the COSA optimization method. It is implemented as described in Wendt, O. 1994. COSA: COoperative Simulated Annealing - Integration von Genetischen Algorithmen und Simulated Annealing am Beispiel der Tourenplanung. Dissertation Thesis. IWI Frankfurt.")] 38 [Storable Class]38 [StorableType("2C6B5F27-A921-4CDD-A484-35B8824CDDBE")] 39 39 public class CosaCrossover : PermutationCrossover { 40 40 [StorableConstructor] 41 protected CosaCrossover( bool deserializing) : base(deserializing) { }41 protected CosaCrossover(StorableConstructorFlag _) : base(_) { } 42 42 protected CosaCrossover(CosaCrossover original, Cloner cloner) : base(original, cloner) { } 43 43 public CosaCrossover() : base() { } -
stable/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/CyclicCrossover.cs
r15584 r17097 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 8Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 23 23 using HeuristicLab.Common; 24 24 using HeuristicLab.Core; 25 using H euristicLab.Persistence.Default.CompositeSerializers.Storable;25 using HEAL.Attic; 26 26 27 27 namespace HeuristicLab.Encodings.PermutationEncoding { … … 33 33 /// </remarks> 34 34 [Item("CyclicCrossover", "An operator which performs the cyclic crossover on two permutations. It is implemented as described in Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg.")] 35 [Storable Class]35 [StorableType("7C4797B7-A154-4702-AEEB-5511A170858B")] 36 36 public class CyclicCrossover : PermutationCrossover { 37 37 [StorableConstructor] 38 protected CyclicCrossover( bool deserializing) : base(deserializing) { }38 protected CyclicCrossover(StorableConstructorFlag _) : base(_) { } 39 39 protected CyclicCrossover(CyclicCrossover original, Cloner cloner) : base(original, cloner) { } 40 40 public CyclicCrossover() : base() { } -
stable/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/CyclicCrossover2.cs
r15584 r17097 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 8Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 23 23 using HeuristicLab.Common; 24 24 using HeuristicLab.Core; 25 using H euristicLab.Persistence.Default.CompositeSerializers.Storable;25 using HEAL.Attic; 26 26 27 27 namespace HeuristicLab.Encodings.PermutationEncoding { … … 34 34 /// </remarks> 35 35 [Item("CyclicCrossover2", "An operator which performs the cyclic crossover on two permutations. It is implemented as described in Affenzeller, M. et al. 2009. Genetic Algorithms and Genetic Programming - Modern Concepts and Practical Applications. CRC Press. p. 136.")] 36 [Storable Class]36 [StorableType("B1550E88-0F0B-452F-94EC-F457761A58F3")] 37 37 public class CyclicCrossover2 : PermutationCrossover { 38 38 [StorableConstructor] 39 protected CyclicCrossover2( bool deserializing) : base(deserializing) { }39 protected CyclicCrossover2(StorableConstructorFlag _) : base(_) { } 40 40 protected CyclicCrossover2(CyclicCrossover2 original, Cloner cloner) : base(original, cloner) { } 41 41 public CyclicCrossover2() : base() { } -
stable/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/EdgeRecombinationCrossover.cs
r15584 r17097 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 8Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 23 23 using HeuristicLab.Common; 24 24 using HeuristicLab.Core; 25 using H euristicLab.Persistence.Default.CompositeSerializers.Storable;25 using HEAL.Attic; 26 26 27 27 namespace HeuristicLab.Encodings.PermutationEncoding { … … 36 36 /// </remarks> 37 37 [Item("EdgeRecombinationCrossover", "An operator which performs the edge recombination crossover on two permutations. It is implemented as described in Whitley et.al. 1991, The Traveling Salesman and Sequence Scheduling, in Davis, L. (Ed.), Handbook of Genetic Algorithms, New York, pp. 350-372.")] 38 [Storable Class]38 [StorableType("4A2E0B7A-F92A-4085-8F3A-149FA010FEB0")] 39 39 public class EdgeRecombinationCrossover : PermutationCrossover { 40 40 [StorableConstructor] 41 protected EdgeRecombinationCrossover( bool deserializing) : base(deserializing) { }41 protected EdgeRecombinationCrossover(StorableConstructorFlag _) : base(_) { } 42 42 protected EdgeRecombinationCrossover(EdgeRecombinationCrossover original, Cloner cloner) : base(original, cloner) { } 43 43 public EdgeRecombinationCrossover() : base() { } -
stable/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/MaximalPreservativeCrossover.cs
r15584 r17097 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 8Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 23 23 using HeuristicLab.Common; 24 24 using HeuristicLab.Core; 25 using H euristicLab.Persistence.Default.CompositeSerializers.Storable;25 using HEAL.Attic; 26 26 27 27 namespace HeuristicLab.Encodings.PermutationEncoding { … … 36 36 /// </remarks> 37 37 [Item("MaximalPreservativeCrossover", "An operator which performs the maximal preservative crossover on two permutations. It is implemented as described in Mühlenbein, H. 1991. Evolution in time and space - the parallel genetic algorithm. FOUNDATIONS OF GENETIC ALGORITHMS, pp. 316-337. Morgan Kaufmann.")] 38 [Storable Class]38 [StorableType("FEC5CCFA-C7E6-4A2E-88C0-C537329BEE73")] 39 39 public class MaximalPreservativeCrossover : PermutationCrossover { 40 40 [StorableConstructor] 41 protected MaximalPreservativeCrossover( bool deserializing) : base(deserializing) { }41 protected MaximalPreservativeCrossover(StorableConstructorFlag _) : base(_) { } 42 42 protected MaximalPreservativeCrossover(MaximalPreservativeCrossover original, Cloner cloner) : base(original, cloner) { } 43 43 public MaximalPreservativeCrossover() : base() { } -
stable/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/MultiPermutationCrossover.cs
r15584 r17097 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 8Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 28 28 using HeuristicLab.Optimization; 29 29 using HeuristicLab.Parameters; 30 using H euristicLab.Persistence.Default.CompositeSerializers.Storable;30 using HEAL.Attic; 31 31 using HeuristicLab.PluginInfrastructure; 32 32 33 33 namespace HeuristicLab.Encodings.PermutationEncoding { 34 34 [Item("MultiPermutationCrossover", "Randomly selects and applies one of its crossovers every time it is called.")] 35 [Storable Class]35 [StorableType("C4F47F2E-FAF5-4AC6-B8AB-42F8A11D8703")] 36 36 public class MultiPermutationCrossover : StochasticMultiBranch<IPermutationCrossover>, IPermutationCrossover, IStochasticOperator { 37 37 public override bool CanChangeName { … … 51 51 52 52 [StorableConstructor] 53 protected MultiPermutationCrossover( bool deserializing) : base(deserializing) { }53 protected MultiPermutationCrossover(StorableConstructorFlag _) : base(_) { } 54 54 protected MultiPermutationCrossover(MultiPermutationCrossover original, Cloner cloner) : base(original, cloner) { } 55 55 public MultiPermutationCrossover() -
stable/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/OrderBasedCrossover.cs
r15584 r17097 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 8Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 23 23 using HeuristicLab.Common; 24 24 using HeuristicLab.Core; 25 using H euristicLab.Persistence.Default.CompositeSerializers.Storable;25 using HEAL.Attic; 26 26 27 27 namespace HeuristicLab.Encodings.PermutationEncoding { … … 36 36 /// </remarks> 37 37 [Item("OrderBasedCrossover", "An operator which performs an order based crossover of two permutations. It is implemented as described in Syswerda, G. (1991). Schedule Optimization Using Genetic Algorithms. In Davis, L. (Ed.) Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, pp. 332-349.")] 38 [Storable Class]38 [StorableType("399EAAF3-ECDF-46AE-9DB6-1D99E45EBA66")] 39 39 public class OrderBasedCrossover : PermutationCrossover { 40 40 [StorableConstructor] 41 protected OrderBasedCrossover( bool deserializing) : base(deserializing) { }41 protected OrderBasedCrossover(StorableConstructorFlag _) : base(_) { } 42 42 protected OrderBasedCrossover(OrderBasedCrossover original, Cloner cloner) : base(original, cloner) { } 43 43 public OrderBasedCrossover() : base() { } -
stable/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/OrderCrossover.cs
r15584 r17097 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 8Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 23 23 using HeuristicLab.Common; 24 24 using HeuristicLab.Core; 25 using H euristicLab.Persistence.Default.CompositeSerializers.Storable;25 using HEAL.Attic; 26 26 27 27 namespace HeuristicLab.Encodings.PermutationEncoding { … … 36 36 /// </remarks> 37 37 [Item("OrderCrossover", "An operator which performs an order crossover of two permutations. It is implemented as described in Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg.")] 38 [Storable Class]38 [StorableType("DEF33012-C7C5-4C09-8FCD-1145353D06A2")] 39 39 public class OrderCrossover : PermutationCrossover { 40 40 [StorableConstructor] 41 protected OrderCrossover( bool deserializing) : base(deserializing) { }41 protected OrderCrossover(StorableConstructorFlag _) : base(_) { } 42 42 protected OrderCrossover(OrderCrossover original, Cloner cloner) : base(original, cloner) { } 43 43 public OrderCrossover() : base() { } -
stable/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/OrderCrossover2.cs
r15584 r17097 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 8Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 23 23 using HeuristicLab.Common; 24 24 using HeuristicLab.Core; 25 using H euristicLab.Persistence.Default.CompositeSerializers.Storable;25 using HEAL.Attic; 26 26 27 27 namespace HeuristicLab.Encodings.PermutationEncoding { … … 35 35 /// </remarks> 36 36 [Item("OrderCrossover2", "An operator which performs an order crossover of two permutations. It is implemented as described in Affenzeller, M. et al. 2009. Genetic Algorithms and Genetic Programming - Modern Concepts and Practical Applications. CRC Press. p. 135.")] 37 [Storable Class]37 [StorableType("9E9A828E-E853-43FD-A39B-F47D17BCE539")] 38 38 public class OrderCrossover2 : PermutationCrossover { 39 39 [StorableConstructor] 40 protected OrderCrossover2( bool deserializing) : base(deserializing) { }40 protected OrderCrossover2(StorableConstructorFlag _) : base(_) { } 41 41 protected OrderCrossover2(OrderCrossover2 original, Cloner cloner) : base(original, cloner) { } 42 42 public OrderCrossover2() : base() { } -
stable/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/PartiallyMatchedCrossover.cs
r15584 r17097 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 8Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 23 23 using HeuristicLab.Common; 24 24 using HeuristicLab.Core; 25 using H euristicLab.Persistence.Default.CompositeSerializers.Storable;25 using HEAL.Attic; 26 26 27 27 namespace HeuristicLab.Encodings.PermutationEncoding { … … 35 35 /// </remarks> 36 36 [Item("PartiallyMatchedCrossover", "An operator which performs the partially matched crossover on two permutations. It is implemented as described in Fogel, D.B. 1988. An Evolutionary Approach to the Traveling Salesman Problem. Biological Cybernetics, 60, pp. 139-144, Springer-Verlag.")] 37 [Storable Class]37 [StorableType("BE92E88C-0A05-4E56-884A-BAFFE6A86F4F")] 38 38 public class PartiallyMatchedCrossover : PermutationCrossover { 39 39 [StorableConstructor] 40 protected PartiallyMatchedCrossover( bool deserializing) : base(deserializing) { }40 protected PartiallyMatchedCrossover(StorableConstructorFlag _) : base(_) { } 41 41 protected PartiallyMatchedCrossover(PartiallyMatchedCrossover original, Cloner cloner) : base(original, cloner) { } 42 42 public PartiallyMatchedCrossover() : base() { } -
stable/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/PositionBasedCrossover.cs
r15584 r17097 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 8Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 23 23 using HeuristicLab.Common; 24 24 using HeuristicLab.Core; 25 using H euristicLab.Persistence.Default.CompositeSerializers.Storable;25 using HEAL.Attic; 26 26 27 27 namespace HeuristicLab.Encodings.PermutationEncoding { … … 33 33 /// </remarks> 34 34 [Item("PositionBasedCrossover", "An operator which performs the position based crossover on two permutations. It is implemented as described in Syswerda, G. (1991). Schedule Optimization Using Genetic Algorithms. In Davis, L. (Ed.) Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, pp 332-349.")] 35 [Storable Class]35 [StorableType("9C707A94-E432-4A1C-94F4-FA69ED639289")] 36 36 public class PositionBasedCrossover : PermutationCrossover { 37 37 [StorableConstructor] 38 protected PositionBasedCrossover( bool deserializing) : base(deserializing) { }38 protected PositionBasedCrossover(StorableConstructorFlag _) : base(_) { } 39 39 protected PositionBasedCrossover(PositionBasedCrossover original, Cloner cloner) : base(original, cloner) { } 40 40 public PositionBasedCrossover() : base() { } -
stable/HeuristicLab.Encodings.PermutationEncoding/3.3/Crossovers/UniformLikeCrossover.cs
r15584 r17097 1 1 #region License Information 2 2 /* HeuristicLab 3 * Copyright (C) 2002-201 8Heuristic and Evolutionary Algorithms Laboratory (HEAL)3 * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL) 4 4 * 5 5 * This file is part of HeuristicLab. … … 24 24 using HeuristicLab.Common; 25 25 using HeuristicLab.Core; 26 using H euristicLab.Persistence.Default.CompositeSerializers.Storable;26 using HEAL.Attic; 27 27 28 28 namespace HeuristicLab.Encodings.PermutationEncoding { 29 29 [Item("UniformLikeCrossover", "The ULX crossover tries to maintain the position in the permutation. It randomly chooses from left to right one of its parents' alleles at each position. Missing entries are then filled randomly later. It is described in Tate, D. M. and Smith, A. E. 1995. A genetic approach to the quadratic assignment problem. Computers & Operations Research, vol. 22, pp. 73-83.")] 30 [Storable Class]30 [StorableType("5FCF5C48-80A1-4A08-9561-F01FDCB8D20D")] 31 31 public sealed class UniformLikeCrossover : PermutationCrossover { 32 32 [StorableConstructor] 33 private UniformLikeCrossover( bool deserializing) : base(deserializing) { }33 private UniformLikeCrossover(StorableConstructorFlag _) : base(_) { } 34 34 private UniformLikeCrossover(UniformLikeCrossover original, Cloner cloner) : base(original, cloner) { } 35 35 public UniformLikeCrossover() : base() { }
Note: See TracChangeset
for help on using the changeset viewer.