Ant-Colony Optimization C#

AntColony/.gitignore

@@ -0,0 +1,487 @@
+1000.txt
+iteration-results.txt
+
+## Ignore Visual Studio temporary files, build results, and
+## files generated by popular Visual Studio add-ons.
+##
+## Get latest from `dotnet new gitignore`
+
+# dotenv files
+.env
+
+# User-specific files
+*.rsuser
+*.suo
+*.user
+*.userosscache
+*.sln.docstates
+
+# User-specific files (MonoDevelop/Xamarin Studio)
+*.userprefs
+
+# Mono auto generated files
+mono_crash.*
+
+# Build results
+[Dd]ebug/
+[Dd]ebugPublic/
+[Rr]elease/
+[Rr]eleases/
+x64/
+x86/
+[Ww][Ii][Nn]32/
+[Aa][Rr][Mm]/
+[Aa][Rr][Mm]64/
+bld/
+[Bb]in/
+[Oo]bj/
+[Ll]og/
+[Ll]ogs/
+
+# Visual Studio 2015/2017 cache/options directory
+.vs/
+# Uncomment if you have tasks that create the project's static files in wwwroot
+#wwwroot/
+
+# Visual Studio 2017 auto generated files
+Generated\ Files/
+
+# MSTest test Results
+[Tt]est[Rr]esult*/
+[Bb]uild[Ll]og.*
+
+# NUnit
+*.VisualState.xml
+TestResult.xml
+nunit-*.xml
+
+# Build Results of an ATL Project
+[Dd]ebugPS/
+[Rr]eleasePS/
+dlldata.c
+
+# Benchmark Results
+BenchmarkDotNet.Artifacts/
+
+# .NET
+project.lock.json
+project.fragment.lock.json
+artifacts/
+
+# Tye
+.tye/
+
+# ASP.NET Scaffolding
+ScaffoldingReadMe.txt
+
+# StyleCop
+StyleCopReport.xml
+
+# Files built by Visual Studio
+*_i.c
+*_p.c
+*_h.h
+*.ilk
+*.meta
+*.obj
+*.iobj
+*.pch
+*.pdb
+*.ipdb
+*.pgc
+*.pgd
+*.rsp
+*.sbr
+*.tlb
+*.tli
+*.tlh
+*.tmp
+*.tmp_proj
+*_wpftmp.csproj
+*.log
+*.tlog
+*.vspscc
+*.vssscc
+.builds
+*.pidb
+*.svclog
+*.scc
+
+# Chutzpah Test files
+_Chutzpah*
+
+# Visual C++ cache files
+ipch/
+*.aps
+*.ncb
+*.opendb
+*.opensdf
+*.sdf
+*.cachefile
+*.VC.db
+*.VC.VC.opendb
+
+# Visual Studio profiler
+*.psess
+*.vsp
+*.vspx
+*.sap
+
+# Visual Studio Trace Files
+*.e2e
+
+# TFS 2012 Local Workspace
+$tf/
+
+# Guidance Automation Toolkit
+*.gpState
+
+# ReSharper is a .NET coding add-in
+_ReSharper*/
+*.[Rr]e[Ss]harper
+*.DotSettings.user
+
+# TeamCity is a build add-in
+_TeamCity*
+
+# DotCover is a Code Coverage Tool
+*.dotCover
+
+# AxoCover is a Code Coverage Tool
+.axoCover/*
+!.axoCover/settings.json
+
+# Coverlet is a free, cross platform Code Coverage Tool
+coverage*.json
+coverage*.xml
+coverage*.info
+
+# Visual Studio code coverage results
+*.coverage
+*.coveragexml
+
+# NCrunch
+_NCrunch_*
+.*crunch*.local.xml
+nCrunchTemp_*
+
+# MightyMoose
+*.mm.*
+AutoTest.Net/
+
+# Web workbench (sass)
+.sass-cache/
+
+# Installshield output folder
+[Ee]xpress/
+
+# DocProject is a documentation generator add-in
+DocProject/buildhelp/
+DocProject/Help/*.HxT
+DocProject/Help/*.HxC
+DocProject/Help/*.hhc
+DocProject/Help/*.hhk
+DocProject/Help/*.hhp
+DocProject/Help/Html2
+DocProject/Help/html
+
+# Click-Once directory
+publish/
+
+# Publish Web Output
+*.[Pp]ublish.xml
+*.azurePubxml
+# Note: Comment the next line if you want to checkin your web deploy settings,
+# but database connection strings (with potential passwords) will be unencrypted
+*.pubxml
+*.publishproj
+
+# Microsoft Azure Web App publish settings. Comment the next line if you want to
+# checkin your Azure Web App publish settings, but sensitive information contained
+# in these scripts will be unencrypted
+PublishScripts/
+
+# NuGet Packages
+*.nupkg
+# NuGet Symbol Packages
+*.snupkg
+# The packages folder can be ignored because of Package Restore
+**/[Pp]ackages/*
+# except build/, which is used as an MSBuild target.
+!**/[Pp]ackages/build/
+# Uncomment if necessary however generally it will be regenerated when needed
+#!**/[Pp]ackages/repositories.config
+# NuGet v3's project.json files produces more ignorable files
+*.nuget.props
+*.nuget.targets
+
+# Microsoft Azure Build Output
+csx/
+*.build.csdef
+
+# Microsoft Azure Emulator
+ecf/
+rcf/
+
+# Windows Store app package directories and files
+AppPackages/
+BundleArtifacts/
+Package.StoreAssociation.xml
+_pkginfo.txt
+*.appx
+*.appxbundle
+*.appxupload
+
+# Visual Studio cache files
+# files ending in .cache can be ignored
+*.[Cc]ache
+# but keep track of directories ending in .cache
+!?*.[Cc]ache/
+
+# Others
+ClientBin/
+~$*
+*~
+*.dbmdl
+*.dbproj.schemaview
+*.jfm
+*.pfx
+*.publishsettings
+orleans.codegen.cs
+
+# Including strong name files can present a security risk
+# (https://github.com/github/gitignore/pull/2483#issue-259490424)
+#*.snk
+
+# Since there are multiple workflows, uncomment next line to ignore bower_components
+# (https://github.com/github/gitignore/pull/1529#issuecomment-104372622)
+#bower_components/
+
+# RIA/Silverlight projects
+Generated_Code/
+
+# Backup & report files from converting an old project file
+# to a newer Visual Studio version. Backup files are not needed,
+# because we have git ;-)
+_UpgradeReport_Files/
+Backup*/
+UpgradeLog*.XML
+UpgradeLog*.htm
+ServiceFabricBackup/
+*.rptproj.bak
+
+# SQL Server files
+*.mdf
+*.ldf
+*.ndf
+
+# Business Intelligence projects
+*.rdl.data
+*.bim.layout
+*.bim_*.settings
+*.rptproj.rsuser
+*- [Bb]ackup.rdl
+*- [Bb]ackup ([0-9]).rdl
+*- [Bb]ackup ([0-9][0-9]).rdl
+
+# Microsoft Fakes
+FakesAssemblies/
+
+# GhostDoc plugin setting file
+*.GhostDoc.xml
+
+# Node.js Tools for Visual Studio
+.ntvs_analysis.dat
+node_modules/
+
+# Visual Studio 6 build log
+*.plg
+
+# Visual Studio 6 workspace options file
+*.opt
+
+# Visual Studio 6 auto-generated workspace file (contains which files were open etc.)
+*.vbw
+
+# Visual Studio 6 auto-generated project file (contains which files were open etc.)
+*.vbp
+
+# Visual Studio 6 workspace and project file (working project files containing files to include in project)
+*.dsw
+*.dsp
+
+# Visual Studio 6 technical files
+*.ncb
+*.aps
+
+# Visual Studio LightSwitch build output
+**/*.HTMLClient/GeneratedArtifacts
+**/*.DesktopClient/GeneratedArtifacts
+**/*.DesktopClient/ModelManifest.xml
+**/*.Server/GeneratedArtifacts
+**/*.Server/ModelManifest.xml
+_Pvt_Extensions
+
+# Paket dependency manager
+.paket/paket.exe
+paket-files/
+
+# FAKE - F# Make
+.fake/
+
+# CodeRush personal settings
+.cr/personal
+
+# Python Tools for Visual Studio (PTVS)
+__pycache__/
+*.pyc
+
+# Cake - Uncomment if you are using it
+# tools/**
+# !tools/packages.config
+
+# Tabs Studio
+*.tss
+
+# Telerik's JustMock configuration file
+*.jmconfig
+
+# BizTalk build output
+*.btp.cs
+*.btm.cs
+*.odx.cs
+*.xsd.cs
+
+# OpenCover UI analysis results
+OpenCover/
+
+# Azure Stream Analytics local run output
+ASALocalRun/
+
+# MSBuild Binary and Structured Log
+*.binlog
+
+# NVidia Nsight GPU debugger configuration file
+*.nvuser
+
+# MFractors (Xamarin productivity tool) working folder
+.mfractor/
+
+# Local History for Visual Studio
+.localhistory/
+
+# Visual Studio History (VSHistory) files
+.vshistory/
+
+# BeatPulse healthcheck temp database
+healthchecksdb
+
+# Backup folder for Package Reference Convert tool in Visual Studio 2017
+MigrationBackup/
+
+# Ionide (cross platform F# VS Code tools) working folder
+.ionide/
+
+# Fody - auto-generated XML schema
+FodyWeavers.xsd
+
+# VS Code files for those working on multiple tools
+.vscode/*
+!.vscode/settings.json
+!.vscode/tasks.json
+!.vscode/launch.json
+!.vscode/extensions.json
+*.code-workspace
+
+# Local History for Visual Studio Code
+.history/
+
+# Windows Installer files from build outputs
+*.cab
+*.msi
+*.msix
+*.msm
+*.msp
+
+# JetBrains Rider
+*.sln.iml
+.idea/
+
+##
+## Visual studio for Mac
+##
+
+
+# globs
+Makefile.in
+*.userprefs
+*.usertasks
+config.make
+config.status
+aclocal.m4
+install-sh
+autom4te.cache/
+*.tar.gz
+tarballs/
+test-results/
+
+# Mac bundle stuff
+*.dmg
+*.app
+
+# content below from: https://github.com/github/gitignore/blob/main/Global/macOS.gitignore
+# General
+.DS_Store
+.AppleDouble
+.LSOverride
+
+# Icon must end with two \r
+Icon
+
+
+# Thumbnails
+._*
+
+# Files that might appear in the root of a volume
+.DocumentRevisions-V100
+.fseventsd
+.Spotlight-V100
+.TemporaryItems
+.Trashes
+.VolumeIcon.icns
+.com.apple.timemachine.donotpresent
+
+# Directories potentially created on remote AFP share
+.AppleDB
+.AppleDesktop
+Network Trash Folder
+Temporary Items
+.apdisk
+
+# content below from: https://github.com/github/gitignore/blob/main/Global/Windows.gitignore
+# Windows thumbnail cache files
+Thumbs.db
+ehthumbs.db
+ehthumbs_vista.db
+
+# Dump file
+*.stackdump
+
+# Folder config file
+[Dd]esktop.ini
+
+# Recycle Bin used on file shares
+$RECYCLE.BIN/
+
+# Windows Installer files
+*.cab
+*.msi
+*.msix
+*.msm
+*.msp
+
+# Windows shortcuts
+*.lnk
+
+# Vim temporary swap files
+*.swp

AntColony/Algorithm/ACO.cs

@@ -0,0 +1,213 @@
+using Microsoft.VisualBasic;
+
+namespace AntColony.Algorithm;
+
+/// <summary>
+/// Алгоритм построения кратчайшего пути с помощью симуляции муравьиной колонии
+/// </summary>
+public class AntColonyOptimizer
+{
+    private readonly int numberOfCities;
+    private readonly double[][] distances;
+    private readonly double[][] pheromones;
+    private readonly double alpha; // Важность феромонов
+    private readonly double beta;  // Важность расстояния 
+    private readonly double evaporationRate;
+    private readonly double Q;     // Множитель депозита феромонов
+    private readonly int numberOfAnts;
+
+    /// <summary>
+    /// Инициализировать алгоритм
+    /// </summary>
+    /// <param name="distances">Матрица расстояний</param>
+    /// <param name="numberOfAnts">Количество муравьев</param>
+    /// <param name="alpha">Значение α (определяет вес феромонов)</param>
+    /// <param name="beta">Значение β (определяет вес расстояния)</param>
+    /// <param name="evaporationRate">Скорость испарения</param>
+    /// <param name="Q">Значение Q</param>
+    public AntColonyOptimizer(double[][] distances, int numberOfAnts = 20, double alpha = 1, double beta = 2,
+        double evaporationRate = 0.1, double Q = 100)
+    {
+        numberOfCities = distances.GetLength(0);
+        this.distances = distances;
+        this.numberOfAnts = numberOfAnts;
+        this.alpha = alpha;
+        this.beta = beta;
+        this.evaporationRate = evaporationRate;
+        this.Q = Q;
+
+        // Строим стартовую матрицу феромонов
+        pheromones = new double[numberOfCities][];
+        for (int i = 0; i < numberOfCities; i++)
+        {
+            var r = new double[numberOfCities];
+            for (int j = 0; j < numberOfCities; j++)
+            {
+                if (i != j)
+                    r[j] = 1.0; // Начальное значение
+            }
+            pheromones[i] = r;
+        }
+    }
+
+    /// <summary>
+    /// Решить задачу комивояжера (построить Гамильтонов граф)
+    /// </summary>
+    /// <param name="maxIterations">Максимальное число итераций</param>
+    /// <returns>Лучший путь и его расстояние</returns>
+    public (List<int> bestTour, double bestDistance) Solve(int maxIterations)
+    {
+        List<int> bestTourEver = [];
+        double bestDistanceEver = double.MaxValue;
+        Lock distanceLock = new();
+        Lock pheromoneLock = new();
+
+        // for (int iteration = 0; iteration < maxIterations; iteration++)
+        Parallel.For(0, maxIterations, i =>
+        {
+            List<List<int>> antTours = [];
+            List<double> antDistances = [];
+
+            // Каждый муравей строит путь
+            for (int ant = 0; ant < numberOfAnts; ant++)
+            {
+                var (tour, distance) = ConstructTour();
+                antTours.Add(tour);
+                antDistances.Add(distance);
+
+                // Если текущий путь лучше - обновляем
+                lock (distanceLock)
+                {
+                    if (distance < bestDistanceEver)
+                    {
+                        bestDistanceEver = distance;
+                        bestTourEver = [.. tour];
+                    }
+                }
+            }
+
+            // Обновляем феромоны для всех путей
+            lock (pheromoneLock)
+            {
+                UpdatePheromones(antTours, antDistances);
+            }
+            // File.AppendAllText("./iteration-results", bestDistanceEver.ToString() + '\n');
+            // }
+        });
+
+        return (bestTourEver, bestDistanceEver);
+    }
+
+    private (List<int> tour, double distance) ConstructTour()
+    {
+        List<int> tour = [];
+        var visited = new bool[numberOfCities];
+        var currentCity = Random.Shared.Next(numberOfCities);
+
+        tour.Add(currentCity);
+        visited[currentCity] = true;
+
+        // Строим путь
+        while (tour.Count < numberOfCities)
+        {
+            int nextCity = SelectNextCity(currentCity, visited);
+            tour.Add(nextCity);
+            visited[nextCity] = true;
+            currentCity = nextCity;
+        }
+
+        // Добавляем возврат на начальную точку
+        tour.Add(tour[0]);
+
+        return (tour, CalculateTourDistance(tour));
+    }
+
+    /// <summary>
+    /// Выбрать следующий город
+    /// </summary>
+    /// <param name="currentCity">В каком городе муравей находится сейчас</param>
+    /// <param name="visited">Какие города муравей уже посетил</param>
+    /// <returns>Номер следующего города</returns>
+    private int SelectNextCity(int currentCity, bool[] visited)
+    {
+        var probabilities = new double[numberOfCities];
+        double probabilitiesSum = 0;
+
+        // Вероятности для каждого непосещенного города
+        for (int i = 0; i < numberOfCities; i++)
+        {
+            if (!visited[i])
+            {
+                if (distances[currentCity][i] == 0) continue;
+                probabilities[i] = Math.Pow(pheromones[currentCity][i], alpha) *
+                                 Math.Pow(1.0 / distances[currentCity][i], beta);
+                probabilitiesSum += probabilities[i];
+            }
+        }
+
+        // Случайно выбираем следующий город (по вероятностям)
+        double randomValue = Random.Shared.NextDouble() * probabilitiesSum;
+        double sum = 0;
+
+        for (int i = 0; i < numberOfCities; i++)
+        {
+            if (!visited[i])
+            {
+                sum += probabilities[i];
+                if (sum >= randomValue)
+                    return i;
+            }
+        }
+
+        // Иначе возвращаемся к первому непосещенному городу
+        return Array.FindIndex(visited, v => !v);
+    }
+
+    /// <summary>
+    /// Обновить матрицу феромонов
+    /// </summary>
+    /// <param name="antTours">Пути муравьев</param>
+    /// <param name="antDistances">Их расстояния</param>
+    private void UpdatePheromones(List<List<int>> antTours, List<double> antDistances)
+    {
+        // Испарение
+        for (int i = 0; i < numberOfCities; i++)
+        {
+            for (int j = 0; j < numberOfCities; j++)
+            {
+                if (i != j)
+                    pheromones[i][j] *= 1.0 - evaporationRate;
+            }
+        }
+
+        // Добавляем новые феромоны
+        for (int ant = 0; ant < antTours.Count; ant++)
+        {
+            double pheromoneDeposit = Q / antDistances[ant];
+            var tour = antTours[ant];
+
+            for (int i = 0; i < tour.Count - 1; i++)
+            {
+                int city1 = tour[i];
+                int city2 = tour[i + 1];
+                pheromones[city1][city2] += pheromoneDeposit;
+                pheromones[city2][city1] += pheromoneDeposit; // Граф ненаправленный
+            }
+        }
+    }
+
+    /// <summary>
+    /// Рассчитать длину пути
+    /// </summary>
+    /// <param name="tour">Путь</param>
+    /// <returns>Длина пути</returns>
+    private double CalculateTourDistance(List<int> tour)
+    {
+        double distance = 0;
+        for (int i = 0; i < tour.Count - 1; i++)
+        {
+            distance += distances[tour[i]][tour[i + 1]];
+        }
+        return distance;
+    }
+}

AntColony/AntColony.csproj

@@ -0,0 +1,14 @@
+<Project Sdk="Microsoft.NET.Sdk">
+
+  <PropertyGroup>
+    <OutputType>Exe</OutputType>
+    <TargetFramework>net9.0</TargetFramework>
+    <ImplicitUsings>enable</ImplicitUsings>
+    <Nullable>enable</Nullable>
+  </PropertyGroup>
+
+  <ItemGroup>
+    <PackageReference Include="System.CommandLine.Dragonfruit" Version="0.4.0-alpha.22272.1" />
+  </ItemGroup>
+
+</Project>

AntColony/AntColony.sln

@@ -0,0 +1,24 @@
+Microsoft Visual Studio Solution File, Format Version 12.00
+# Visual Studio Version 17
+VisualStudioVersion = 17.5.2.0
+MinimumVisualStudioVersion = 10.0.40219.1
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "AntColony", "AntColony.csproj", "{A8C687D5-7327-2E1F-7755-B1FA6A2FDD16}"
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug|Any CPU = Debug|Any CPU
+		Release|Any CPU = Release|Any CPU
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{A8C687D5-7327-2E1F-7755-B1FA6A2FDD16}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{A8C687D5-7327-2E1F-7755-B1FA6A2FDD16}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{A8C687D5-7327-2E1F-7755-B1FA6A2FDD16}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{A8C687D5-7327-2E1F-7755-B1FA6A2FDD16}.Release|Any CPU.Build.0 = Release|Any CPU
+	EndGlobalSection
+	GlobalSection(SolutionProperties) = preSolution
+		HideSolutionNode = FALSE
+	EndGlobalSection
+	GlobalSection(ExtensibilityGlobals) = postSolution
+		SolutionGuid = {FC45BA4B-B920-49C9-A6E0-28DD5168E14A}
+	EndGlobalSection
+EndGlobal

AntColony/Program.cs

@@ -0,0 +1,96 @@
+using System.Diagnostics;
+using AntColony.Algorithm;
+
+namespace AntColony;
+
+class Program
+{
+    /// <summary></summary>
+    /// <param name="file">Путь до файла с ребрами</param>
+    /// <param name="hasHeader">Файл содержит заголовок</param>
+    /// <param name="iterations">Количество итераций</param>
+    /// <param name="ants">Количество муравьев</param>
+    /// <param name="alpha">Значение α (определяет вес феромонов)</param>
+    /// <param name="beta">Значение β (определяет вес расстояния)</param>
+    /// <param name="evaporationRate">Скорость испарения феромонов</param>
+    /// <param name="q">Значение Q</param>
+    public static void Main(FileInfo file, bool hasHeader = false, int iterations = 100, int ants = 20, double alpha = 1, double beta = 2, double evaporationRate = 0.1, double q = 100)
+    {
+        Console.Write("Чтение файла...");
+
+        var sw = new Stopwatch();
+        sw.Start();
+
+        double[][] distances = ParseEdgeFile(file.FullName, hasHeader);
+        Console.WriteLine($"\rСчитано {distances.Length} вершин за {sw.Elapsed} ({sw.ElapsedMilliseconds} мс).\n");
+
+        var aco = new AntColonyOptimizer(
+            distances: distances,
+            numberOfAnts: 20,
+            alpha: 1,
+            beta: 2,
+            evaporationRate: 0.1,
+            Q: 100
+        );
+
+        sw.Restart();
+
+        var (bestTour, bestDistance) = aco.Solve(iterations);
+
+        Console.WriteLine($"Задача решена за {sw.Elapsed} ({sw.ElapsedMilliseconds} мс).");
+        Console.WriteLine($"Лучший путь: {string.Join(" -> ", bestTour)}.");
+        Console.WriteLine($"Итоговое расстояние: {bestDistance}.");
+    }
+
+    private static double[][] ParseEdgeFile(string filePath, bool skipHeader)
+    {
+        List<string> lines = [.. File.ReadAllLines(filePath)];
+        if (skipHeader) lines.RemoveAt(0);
+
+        HashSet<int> vertices = [];
+        int maxVertex = 0;
+
+        foreach (string line in lines)
+        {
+            string[] parts = line.Split();
+            if (parts.Length != 3)
+                continue;
+
+            if (int.TryParse(parts[0], out int v1))
+                vertices.Add(v1);
+            if (int.TryParse(parts[1], out int v2))
+                vertices.Add(v2);
+
+            maxVertex = int.Max(maxVertex, v1);
+            maxVertex = int.Max(maxVertex, v2);
+        }
+
+        double[][] adjacencyMatrix = new double[maxVertex + 1][];
+
+        for (int i = 0; i < maxVertex + 1; i++)
+        {
+            adjacencyMatrix[i] = new double[maxVertex + 1];
+            for (int j = 0; j < maxVertex + 1; j++)
+            {
+                adjacencyMatrix[i][j] = 0.0;
+            }
+        }
+
+        foreach (string line in lines)
+        {
+            string[] parts = line.Split();
+            if (parts.Length != 3)
+                continue;
+
+            if (int.TryParse(parts[0], out int v1) &&
+                int.TryParse(parts[1], out int v2) &&
+                double.TryParse(parts[2], out double distance))
+            {
+                adjacencyMatrix[v1][v2] = distance;
+                adjacencyMatrix[v2][v1] = distance;
+            }
+        }
+
+        return adjacencyMatrix;
+    }
+}

AntColony/README.md

@@ -0,0 +1,9 @@
+# Алгоритм оптимизации муравьиной колонии для решения задачи комивояжера (поиска Гамильтонова цикла)
+### Результаты
+![График сходимости](readme-files/convergence.png)
+
+**Длина лучшего пути на 1000 итераций для файла 1000.txt:** 2691
+
+**Время синхронного выполнения для 1000 итераций для файла 1000.txt:** 00:01:37.3895740 (97389 мс)
+
+**Время асинхронного выполнения для 1000 итераций для файла 1000.txt:** 00:00:13.2479228 (13247 мс)