Free cookie consent management tool by TermsFeed Policy Generator

Ignore:
Timestamp:
12/19/17 11:10:14 (7 years ago)
Author:
fholzing
Message:

#2864: CleanUp of old code, added LOP benchmark instances

Location:
branches/2864_PermutationProblems/HeuristicLab.Problems.LinearOrdering/3.3
Files:
1 added
1 deleted
8 edited

Legend:

Unmodified
Added
Removed

  • branches/2864_PermutationProblems/HeuristicLab.Problems.LinearOrdering/3.3/Evaluators/LOPEvaluator.cs

    r15521 r15541  
    3636    public abstract class LOPEvaluator : InstrumentedOperator, ILOPEvaluator
    3737    {
    38         public override bool CanChangeName {
     38        public override bool CanChangeName
     39        {
    3940            get { return false; }
    4041        }
    4142
    42         public ILookupParameter<DoubleValue> QualityParameter {
     43        public ILookupParameter<DoubleValue> QualityParameter
     44        {
    4345            get { return (ILookupParameter<DoubleValue>)Parameters["Quality"]; }
    4446        }

  • branches/2864_PermutationProblems/HeuristicLab.Problems.LinearOrdering/3.3/Evaluators/MatrixTriangulationEvaluator.cs

    r15521 r15541  
    3131{
    3232    /// <summary>
    33     /// A base class for operators which evaluate LOP solutions given in Matrix representation.
     33    /// A base class for operators which evaluates LOP solutions given in Matrix representation.
    3434    /// </summary>
    3535    [Item("MatrixTriangulationEvaluator", "A base class for operators which evaluate LOP solutions given in Matrix representation.")]
    … …  
    3737    public abstract class MatrixTriangulationEvaluator : LOPEvaluator, IMatrixTriangulationEvaluator
    3838    {
    39         private object locker = new object();
    40 
    4139        public ILookupParameter<Permutation> PermutationParameter { get { return (ILookupParameter<Permutation>)Parameters["Permutation"]; } }
    4240        public ILookupParameter<DoubleMatrix> MatrixParameter { get { return (ILookupParameter<DoubleMatrix>)Parameters["Matrix"]; } }
    4341        public ILookupParameter<Permutation> BestKnownSolutionParameter { get { return (ILookupParameter<Permutation>)Parameters["BestKnownSolution"]; } }
    4442        public ILookupParameter<DoubleValue> BestKnownQualityParameter { get { return (ILookupParameter<DoubleValue>)Parameters["BestKnownQuality"]; } }
     43
    4544        [StorableConstructor]
    4645        protected MatrixTriangulationEvaluator(bool deserializing) : base(deserializing) { }
    … …  
    4948          : base()
    5049        {
    51             Parameters.Add(new LookupParameter<Permutation>("Permutation", "The TSP solution given in path representation which should be evaluated."));
     50            Parameters.Add(new LookupParameter<Permutation>("Permutation", "The LOP solution given in path representation which should be evaluated."));
    5251            Parameters.Add(new LookupParameter<DoubleMatrix>("Matrix", "The matrix which contains the distances between the cities."));
    5352            Parameters.Add(new LookupParameter<Permutation>("BestKnownSolution", "The currently best known solution."));
    … …  
    5857        private void AfterDeserialization()
    5958        {
    60             // BackwardsCompatibility3.3
    61             #region Backwards compatible code (remove with 3.4)
    62             LookupParameter<DoubleMatrix> oldDistanceMatrixParameter = Parameters["Matrix"] as LookupParameter<DoubleMatrix>;
    63             if (oldDistanceMatrixParameter != null)
    64             {
    65                 Parameters.Remove(oldDistanceMatrixParameter);
    66                 Parameters.Add(new LookupParameter<DoubleMatrix>("Matrix", "The matrix which contains the distances between the cities."));
    67                 MatrixParameter.ActualName = oldDistanceMatrixParameter.ActualName;
    68             }
    69             #endregion
     59
    7060        }
    7161
    7262        public static double Apply(MatrixTriangulationEvaluator evaluator, DoubleMatrix matrix, Permutation permut)
    7363        {
    74             double length = evaluator.CalculateUpperTriangle(matrix, permut);
    75             return length;
     64            return evaluator.CalculateUpperTriangle(matrix, permut);
    7665        }
    7766
    … …  
    8069            Permutation p = PermutationParameter.ActualValue;
    8170            DoubleMatrix c = MatrixParameter.ActualValue;
    82             if (c == null) throw new InvalidOperationException("No coordinates were given.");
     71            if (c == null) throw new InvalidOperationException("No matrix was given.");
    8372
    8473            double upperTriangle = CalculateUpperTriangle(c, p);

  • branches/2864_PermutationProblems/HeuristicLab.Problems.LinearOrdering/3.3/HeuristicLab.Problems.LinearOrdering-3.3.csproj

    r15521 r15541  
    1818    <DebugType>full</DebugType>
    1919    <Optimize>false</Optimize>
    20     <OutputPath>..\..\bin\</OutputPath>
     20    <OutputPath>..\..\..\..\trunk\sources\bin\</OutputPath>
    2121    <DefineConstants>DEBUG;TRACE</DefineConstants>
    2222    <ErrorReport>prompt</ErrorReport>
    … …  
    3838  </PropertyGroup>
    3939  <ItemGroup>
     40    <Reference Include="HeuristicLab.Collections-3.3">
     41      <HintPath>..\..\..\..\trunk\sources\bin\HeuristicLab.Collections-3.3.dll</HintPath>
     42    </Reference>
     43    <Reference Include="HeuristicLab.Common-3.3">
     44      <HintPath>..\..\..\..\trunk\sources\bin\HeuristicLab.Common-3.3.dll</HintPath>
     45    </Reference>
     46    <Reference Include="HeuristicLab.Common.Resources-3.3">
     47      <HintPath>..\..\..\..\trunk\sources\bin\HeuristicLab.Common.Resources-3.3.dll</HintPath>
     48    </Reference>
     49    <Reference Include="HeuristicLab.Core-3.3">
     50      <HintPath>..\..\..\..\trunk\sources\bin\HeuristicLab.Core-3.3.dll</HintPath>
     51    </Reference>
     52    <Reference Include="HeuristicLab.Data-3.3">
     53      <HintPath>..\..\..\..\trunk\sources\bin\HeuristicLab.Data-3.3.dll</HintPath>
     54    </Reference>
     55    <Reference Include="HeuristicLab.Encodings.IntegerVectorEncoding-3.3">
     56      <HintPath>..\..\..\..\trunk\sources\bin\HeuristicLab.Encodings.IntegerVectorEncoding-3.3.dll</HintPath>
     57    </Reference>
     58    <Reference Include="HeuristicLab.Encodings.PermutationEncoding-3.3">
     59      <HintPath>..\..\..\..\trunk\sources\bin\HeuristicLab.Encodings.PermutationEncoding-3.3.dll</HintPath>
     60    </Reference>
     61    <Reference Include="HeuristicLab.Encodings.ScheduleEncoding-3.3">
     62      <HintPath>..\..\..\..\trunk\sources\bin\HeuristicLab.Encodings.ScheduleEncoding-3.3.dll</HintPath>
     63    </Reference>
     64    <Reference Include="HeuristicLab.Operators-3.3">
     65      <HintPath>..\..\..\..\trunk\sources\bin\HeuristicLab.Operators-3.3.dll</HintPath>
     66    </Reference>
     67    <Reference Include="HeuristicLab.Optimization-3.3">
     68      <HintPath>..\..\..\..\trunk\sources\bin\HeuristicLab.Optimization-3.3.dll</HintPath>
     69    </Reference>
     70    <Reference Include="HeuristicLab.Parameters-3.3">
     71      <HintPath>..\..\..\..\trunk\sources\bin\HeuristicLab.Parameters-3.3.dll</HintPath>
     72    </Reference>
     73    <Reference Include="HeuristicLab.Persistence-3.3">
     74      <HintPath>..\..\..\..\trunk\sources\bin\HeuristicLab.Persistence-3.3.dll</HintPath>
     75    </Reference>
     76    <Reference Include="HeuristicLab.PluginInfrastructure-3.3">
     77      <HintPath>..\..\..\..\trunk\sources\bin\HeuristicLab.PluginInfrastructure-3.3.dll</HintPath>
     78    </Reference>
    4079    <Reference Include="System" />
    4180    <Reference Include="System.Core" />
    … …  
    4988  </ItemGroup>
    5089  <ItemGroup>
    51     <Compile Include="Evaluators\AwesomeTriangulationEvaluator.cs" />
     90    <Compile Include="Evaluators\SuperdiagonalMatrixTriangulationEvaluator.cs" />
    5291    <Compile Include="Evaluators\MatrixTriangulationEvaluator.cs" />
    5392    <Compile Include="Evaluators\LOPEvaluator.cs" />
    … …  
    5998  </ItemGroup>
    6099  <ItemGroup>
    61     <ProjectReference Include="..\..\HeuristicLab.Collections\3.3\HeuristicLab.Collections-3.3.csproj">
    62       <Project>{958b43bc-cc5c-4fa2-8628-2b3b01d890b6}</Project>
    63       <Name>HeuristicLab.Collections-3.3</Name>
    64     </ProjectReference>
    65     <ProjectReference Include="..\..\HeuristicLab.Common.Resources\3.3\HeuristicLab.Common.Resources-3.3.csproj">
    66       <Project>{0e27a536-1c4a-4624-a65e-dc4f4f23e3e1}</Project>
    67       <Name>HeuristicLab.Common.Resources-3.3</Name>
    68     </ProjectReference>
    69     <ProjectReference Include="..\..\HeuristicLab.Common\3.3\HeuristicLab.Common-3.3.csproj">
    70       <Project>{A9AD58B9-3EF9-4CC1-97E5-8D909039FF5C}</Project>
    71       <Name>HeuristicLab.Common-3.3</Name>
    72     </ProjectReference>
    73     <ProjectReference Include="..\..\HeuristicLab.Core\3.3\HeuristicLab.Core-3.3.csproj">
    74       <Project>{C36BD924-A541-4A00-AFA8-41701378DDC5}</Project>
    75       <Name>HeuristicLab.Core-3.3</Name>
    76     </ProjectReference>
    77     <ProjectReference Include="..\..\HeuristicLab.Data\3.3\HeuristicLab.Data-3.3.csproj">
    78       <Project>{BBAB9DF5-5EF3-4BA8-ADE9-B36E82114937}</Project>
    79       <Name>HeuristicLab.Data-3.3</Name>
    80     </ProjectReference>
    81     <ProjectReference Include="..\..\HeuristicLab.Encodings.IntegerVectorEncoding\3.3\HeuristicLab.Encodings.IntegerVectorEncoding-3.3.csproj">
    82       <Project>{DDFB14DD-2A85-493C-A52D-E69729BBAEB0}</Project>
    83       <Name>HeuristicLab.Encodings.IntegerVectorEncoding-3.3</Name>
    84     </ProjectReference>
    85     <ProjectReference Include="..\..\HeuristicLab.Encodings.PermutationEncoding\3.3\HeuristicLab.Encodings.PermutationEncoding-3.3.csproj">
    86       <Project>{DBECB8B0-B166-4133-BAF1-ED67C3FD7FCA}</Project>
    87       <Name>HeuristicLab.Encodings.PermutationEncoding-3.3</Name>
    88     </ProjectReference>
    89     <ProjectReference Include="..\..\HeuristicLab.Encodings.ScheduleEncoding\3.3\HeuristicLab.Encodings.ScheduleEncoding-3.3.csproj">
    90       <Project>{17F3EF80-B2C3-4B8D-A4D5-BE9CE3BA2606}</Project>
    91       <Name>HeuristicLab.Encodings.ScheduleEncoding-3.3</Name>
    92     </ProjectReference>
    93     <ProjectReference Include="..\..\HeuristicLab.Operators\3.3\HeuristicLab.Operators-3.3.csproj">
    94       <Project>{23DA7FF4-D5B8-41B6-AA96-F0561D24F3EE}</Project>
    95       <Name>HeuristicLab.Operators-3.3</Name>
    96     </ProjectReference>
    97     <ProjectReference Include="..\..\HeuristicLab.Optimization\3.3\HeuristicLab.Optimization-3.3.csproj">
    98       <Project>{14AB8D24-25BC-400C-A846-4627AA945192}</Project>
    99       <Name>HeuristicLab.Optimization-3.3</Name>
    100     </ProjectReference>
    101     <ProjectReference Include="..\..\HeuristicLab.Parameters\3.3\HeuristicLab.Parameters-3.3.csproj">
    102       <Project>{56F9106A-079F-4C61-92F6-86A84C2D84B7}</Project>
    103       <Name>HeuristicLab.Parameters-3.3</Name>
    104     </ProjectReference>
    105     <ProjectReference Include="..\..\HeuristicLab.Persistence\3.3\HeuristicLab.Persistence-3.3.csproj">
    106       <Project>{102BC7D3-0EF9-439C-8F6D-96FF0FDB8E1B}</Project>
    107       <Name>HeuristicLab.Persistence-3.3</Name>
    108     </ProjectReference>
    109     <ProjectReference Include="..\..\HeuristicLab.PluginInfrastructure\3.3\HeuristicLab.PluginInfrastructure-3.3.csproj">
    110       <Project>{94186A6A-5176-4402-AE83-886557B53CCA}</Project>
    111       <Name>HeuristicLab.PluginInfrastructure-3.3</Name>
    112     </ProjectReference>
     100    <None Include="HeuristicLab.snk" />
     101    <None Include="Plugin.cs.frame" />
     102    <None Include="Properties\AssemblyInfo.cs.frame" />
     103  </ItemGroup>
     104  <ItemGroup>
    113105    <ProjectReference Include="..\..\HeuristicLab.Problems.Instances\3.3\HeuristicLab.Problems.Instances-3.3.csproj">
    114106      <Project>{3540E29E-4793-49E7-8EE2-FEA7F61C3994}</Project>
    115107      <Name>HeuristicLab.Problems.Instances-3.3</Name>
    116108    </ProjectReference>
    117   </ItemGroup>
    118   <ItemGroup>
    119     <None Include="HeuristicLab.snk" />
    120     <None Include="Plugin.cs.frame" />
    121     <None Include="Properties\AssemblyInfo.cs.frame" />
    122109  </ItemGroup>
    123110  <Import Project="$(MSBuildToolsPath)\Microsoft.CSharp.targets" />

  • branches/2864_PermutationProblems/HeuristicLab.Problems.LinearOrdering/3.3/Interfaces/ILOPEvaluator.cs

    r15521 r15541  
    2828{
    2929    /// <summary>
    30     /// An evaluator for a Schedule
     30    /// An evaluator for a Linear Ordering Problem Matrix
    3131    /// </summary>
    3232    public interface ILOPEvaluator : ISingleObjectiveEvaluator { }

  • branches/2864_PermutationProblems/HeuristicLab.Problems.LinearOrdering/3.3/Interfaces/IMatrixTriangulationEvaluator.cs

    r15521 r15541  
    1 using HeuristicLab.Core;
     1#region License Information
     2/* HeuristicLab
     3 * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     4 *
     5 * This file is part of HeuristicLab.
     6 *
     7 * HeuristicLab is free software: you can redistribute it and/or modify
     8 * it under the terms of the GNU General Public License as published by
     9 * the Free Software Foundation, either version 3 of the License, or
     10 * (at your option) any later version.
     11 *
     12 * HeuristicLab is distributed in the hope that it will be useful,
     13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
     14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
     15 * GNU General Public License for more details.
     16 *
     17 * You should have received a copy of the GNU General Public License
     18 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
     19 */
     20#endregion
     21
     22using HeuristicLab.Core;
    223using HeuristicLab.Data;
    324using HeuristicLab.Encodings.PermutationEncoding;

  • branches/2864_PermutationProblems/HeuristicLab.Problems.LinearOrdering/3.3/LinearOrderingProblem.cs

    r15521 r15541  
    2121
    2222using System;
    23 using System.Drawing;
    2423using System.Linq;
    2524using HeuristicLab.Common;
    … …  
    3029using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
    3130using HeuristicLab.PluginInfrastructure;
    32 using HeuristicLab.Problems.Instances;
    3331using HeuristicLab.Optimization;
    3432using System.Collections.Generic;
    3533using HeuristicLab.Problems.Instances.Types;
     34using HeuristicLab.Problems.Instances;
    3635
    3736namespace HeuristicLab.Problems.LinearOrdering
    … …  
    6059
    6160        #region Parameter Properties
    62         public OptionalValueParameter<Permutation> BestKnownSolutionParameter {
     61        public OptionalValueParameter<Permutation> BestKnownSolutionParameter
     62        {
    6363            get { return (OptionalValueParameter<Permutation>)Parameters["BestKnownSolution"]; }
    6464        }
    6565
    66         public OptionalValueParameter<DoubleMatrix> MatrixParameter {
     66        public OptionalValueParameter<DoubleMatrix> MatrixParameter
     67        {
    6768            get { return (OptionalValueParameter<DoubleMatrix>)Parameters["Matrix"]; }
    6869        }
    … …  
    7071
    7172        #region Properties
    72         public Permutation BestKnownSolution {
     73        public Permutation BestKnownSolution
     74        {
    7375            get { return BestKnownSolutionParameter.Value; }
    74             set {
     76            set
     77            {
    7578                BestKnownSolutionParameter.Value = value;
    7679                if (BestKnownSolutionChanged != null) { OnBestKnownSolutionChanged(); }
    7780            }
    7881        }
    79         public DoubleMatrix Matrix {
     82        public DoubleMatrix Matrix
     83        {
    8084            get { return MatrixParameter.Value; }
    8185            set { MatrixParameter.Value = value; }
    … …  
    9599        [Obsolete]
    96100        [Storable(Name = "operators")]
    97         private IEnumerable<IOperator> oldOperators {
     101        private IEnumerable<IOperator> oldOperators
     102        {
    98103            get { return null; }
    99             set {
     104            set
     105            {
    100106                if (value != null && value.Any())
    101107                    Operators.AddRange(value);
    … …  
    109115          : base(original, cloner)
    110116        {
    111             RegisterEventHandlers();
    112117        }
    113118        public LinearOrderingProblem()
    114           : base(new AwesomeTriangulationEvaluator(), new RandomPermutationCreator())
     119          : base(new SuperdiagonalMatrixTriangulationEvaluator(), new RandomPermutationCreator())
    115120        {
    116121            Parameters.Add(new OptionalValueParameter<Permutation>("BestKnownSolution", "The best known solution of this LOP instance."));
    117             Parameters.Add(new OptionalValueParameter<DoubleMatrix>("Matrix", "The matrix which contains the jobs,machines and duration."));
     122            Parameters.Add(new OptionalValueParameter<DoubleMatrix>("Matrix", "The matrix which contains the corresponding LOP-values"));
    118123
    119124            Load(DefaultInstance);
    … …  
    124129            MaximizationParameter.Hidden = true;
    125130
    126             SolutionCreator.PermutationParameter.ActualName = "PFSPOrder";
    127             Evaluator.QualityParameter.ActualName = "Makespan";
     131            SolutionCreator.PermutationParameter.ActualName = "LOPOrder";
     132            Evaluator.QualityParameter.ActualName = "SuperDiagonale";
    128133            ParameterizeSolutionCreator();
    129134            ParameterizeEvaluator();
    130135
    131136            InitializeOperators();
    132             RegisterEventHandlers();
    133137        }
    134138
    … …  
    141145        private void AfterDeserialization()
    142146        {
    143             RegisterEventHandlers();
    144         }
    145 
    146         private void RegisterEventHandlers()
    147         {
    148             SolutionCreator.PermutationParameter.ActualNameChanged += new EventHandler(SolutionCreator_PermutationParameter_ActualNameChanged);
    149             Evaluator.QualityParameter.ActualNameChanged += new EventHandler(Evaluator_QualityParameter_ActualNameChanged);
    150         }
    151 
    152         private void Evaluator_QualityParameter_ActualNameChanged(object sender, EventArgs e)
    153         {
    154             //Nothing to do  ParameterizeAnalyzers();
    155         }
    156 
    157         private void SolutionCreator_PermutationParameter_ActualNameChanged(object sender, EventArgs e)
    158         {
    159             ParameterizeEvaluator();
    160             //ParameterizeAnalyzers();
    161             ParameterizeOperators();
    162         }
    163 
    164         #region Events
    165         private void ScheduleEvaluator_QualityParameter_ActualNameChanged(object sender, EventArgs eventArgs)
    166         {
    167             ParameterizeOperators();
    168         }
    169 
    170         private void SolutionCreator_SchedulingEncodingParameter_ActualNameChanged(object sender, EventArgs eventArgs)
    171         {
    172             ParameterizeOperators();
    173         }
    174 
    175         private void ScheduleDecoder_ScheduleParameter_ActualNameChanged(object sender, EventArgs eventArgs)
    176         {
    177             ParameterizeOperators();
    178         }
    179         #endregion
     147        }
    180148
    181149        #region Problem Instance Handling
    … …  
    193161                if (!permut.Contains(0)) { permut = permut.Select(v => v - 1).ToArray(); }
    194162                double bestKnownQuality = MatrixTriangulationEvaluator.Apply(
    195                     new AwesomeTriangulationEvaluator(),
     163                    new SuperdiagonalMatrixTriangulationEvaluator(),
    196164                    new DoubleMatrix(data.Matrix),
    197165                    new Permutation(PermutationTypes.Absolute, permut)
    … …  
    212180                Description = Description,
    213181                BestKnownQuality = BestKnownQuality.Value,
    214                 //BestKnownPermutation = Matrix.row,
    215                 //Machines = Matrix.Columns
     182                BestKnownPermutation = BestKnownSolution.ToArray(),
     183                Dimension = Matrix.Rows,
     184                Matrix = Matrix.CloneAsMatrix()
    216185            };
    217             for (int i = 0; i < Matrix.Rows; i++)
    218             {
    219                 for (int j = 0; j < Matrix.Columns; j++)
    220                 {
    221                     //result.ProcessingTimes[i, j] = Matrix[i, j];
    222                 }
    223             }
    224186
    225187            return result;
    … …  
    230192        private void InitializeOperators()
    231193        {
    232             var operators = new HashSet<IPermutationOperator>(new IPermutationOperator[] {
    233                 new OrderCrossover2(),
    234                 new InversionManipulator(),
    235                 new StochasticInversionMultiMoveGenerator()
    236             }, new TypeEqualityComparer<IPermutationOperator>());
    237 
    238             foreach (var op in ApplicationManager.Manager.GetInstances<IPermutationOperator>())
    239                 operators.Add(op);
    240             Operators.AddRange(operators);
     194            Operators.AddRange(ApplicationManager.Manager.GetInstances<IPermutationOperator>());
    241195            ParameterizeOperators();
    242196            UpdateMoveEvaluators();
    … …  
    294248        private void ParameterizeSolutionCreator()
    295249        {
    296             SolutionCreator.LengthParameter.Value = new IntValue(Matrix.Columns); //Jobs
     250            SolutionCreator.LengthParameter.Value = new IntValue(Matrix.Columns);
    297251
    298252            SolutionCreator.LengthParameter.Hidden = SolutionCreator.LengthParameter.Value != null;
    … …  
    302256        private void ParameterizeEvaluator()
    303257        {
    304             if (Evaluator is AwesomeTriangulationEvaluator)
     258            if (Evaluator is IMatrixTriangulationEvaluator)
    305259            {
    306260                IMatrixTriangulationEvaluator evaluator = (IMatrixTriangulationEvaluator)Evaluator;

  • branches/2864_PermutationProblems/HeuristicLab.Problems.LinearOrdering/3.3/Plugin.cs

    r15521 r15541  
    1 using HeuristicLab.PluginInfrastructure;
     1#region License Information
     2/* HeuristicLab
     3 * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     4 *
     5 * This file is part of HeuristicLab.
     6 *
     7 * HeuristicLab is free software: you can redistribute it and/or modify
     8 * it under the terms of the GNU General Public License as published by
     9 * the Free Software Foundation, either version 3 of the License, or
     10 * (at your option) any later version.
     11 *
     12 * HeuristicLab is distributed in the hope that it will be useful,
     13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
     14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
     15 * GNU General Public License for more details.
     16 *
     17 * You should have received a copy of the GNU General Public License
     18 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
     19 */
     20#endregion
     21
     22using HeuristicLab.PluginInfrastructure;
    223
    324namespace HeuristicLab.Problems.LinearOrdering

  • branches/2864_PermutationProblems/HeuristicLab.Problems.LinearOrdering/3.3/Properties/AssemblyInfo.cs

    r15521 r15541  
    1 using System.Reflection;
     1#region License Information
     2/* HeuristicLab
     3 * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
     4 *
     5 * This file is part of HeuristicLab.
     6 *
     7 * HeuristicLab is free software: you can redistribute it and/or modify
     8 * it under the terms of the GNU General Public License as published by
     9 * the Free Software Foundation, either version 3 of the License, or
     10 * (at your option) any later version.
     11 *
     12 * HeuristicLab is distributed in the hope that it will be useful,
     13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
     14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
     15 * GNU General Public License for more details.
     16 *
     17 * You should have received a copy of the GNU General Public License
     18 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
     19 */
     20#endregion
     21
     22using System.Reflection;
    223using System.Runtime.InteropServices;
    324
    … …  
    3354// [assembly: AssemblyVersion("1.0.*")]
    3455[assembly: AssemblyVersion("3.3.0.0")]
    35 [assembly: AssemblyFileVersion("3.3.14.14965")]
     56[assembly: AssemblyFileVersion("3.3.14.15521")]
    3657
Note: See TracChangeset for help on using the changeset viewer.