<commit_before>﻿using System;
using Microsoft.VisualStudio.TestTools.UnitTesting;

namespace Genetic.Problems
{
    /*
    * I would like to have an evolution algorithm solving traveling salesman problem.
    * As problem is very hard to solve with numerous cities it will be limited to 10 for sake of the test.
    * 
    * Chromosome is a permutation of cities named A,B,C...
    * Length of genome will be fixed to number of cities.
    * Fitness will be calculated as total lenght of route through the cities, with favoring smallest value.
    * Mutation rate should be 2% and single-cut crossing should be applied.
    * For selection I would like to use 'roulete wheel' strategy.
    * I would like population to be not bigger than 50 chromosomes per step.
    * 
    * It is expected that algorithm will be able to find as good or better solution than the greedy algorithm.
    * Timeouts after 100 steps.
    */
    [TestClass]
    public class TravelingSalesmanProblem
    {
        [TestMethod]
        public void SolveTravelingSalesmanProblem()
        {
        }
    }
}
<commit_msg>Traveling salesman problem story updated, I would like to solve it using co-evolution<commit_after>﻿using System;
using Microsoft.VisualStudio.TestTools.UnitTesting;

namespace Genetic.Problems
{
    /*
    * I would like to have an evolution algorithm solving traveling salesman problem.
    * As problem is very hard to solve with numerous cities it will be limited to 10 for sake of the test.
    * 
    * Chromosome is a permutation of cities named A,B,C...
    * Length of genome will be fixed to number of cities.
    * Fitness will be calculated as total lenght of route through the cities, with favoring smallest value.
    * Mutation rate should be 2% and single-cut crossing should be applied.
    * For selection I would like to use 'roulete wheel' strategy.
    * I would like population to be not bigger than 50 chromosomes per step.
    * I would like to have 10 simultaneous population running, with a migration rate of 1 chromosomes happening witch 5% chance.
    * 
    * It is expected that algorithm will be able to find better solution than the greedy algorithm.
    * Timeouts after 100 steps.
    */
    [TestClass]
    public class TravelingSalesmanProblem
    {
        [TestMethod]
        public void SolveTravelingSalesmanProblem()
        {
        }
    }
}

{'fraction_non_alphanumeric': 0.050335570469798654, 'fraction_numerical': 0.008389261744966443, 'mean_word_length': 2.9421487603305785, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '4659331', 'n_tokens_mistral': 656, 'n_tokens_neox': 588, 'n_words': 305}