<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Simulation on Davis Rippon</title><link>https://davisrippon.com/tags/simulation/</link><description>
Recent content
in Simulation
on Davis Rippon</description><generator>Hugo -- gohugo.io</generator><language>en-gb</language><lastBuildDate>
Wed, 15 Jul 2026 08:24:08 +0000</lastBuildDate><atom:link href="https://davisrippon.com/tags/simulation/index.xml" rel="self" type="application/rss+xml"/><item><title>Ant Colony Optimisation</title><link>https://davisrippon.com/notes/aco/ant-colony-optimisation/</link><pubDate>Wed, 15 Jul 2026 08:24:08 +0000</pubDate><guid>https://davisrippon.com/notes/aco/ant-colony-optimisation/</guid><description>&lt;p&gt;The following is a article adaptation of a research project I did on Ant Colony Optimisation.&lt;/p&gt;&lt;video
src="aco_pheromone.mp4"
controls
width="640"
height="360"
muted
loop
&gt;
Your browser does not support the video tag.
&lt;/video&gt;
&lt;h2&gt;1. Introduction&lt;/h2&gt;&lt;p&gt;The Travelling Salesman Problem (TSP) is an NP-hard combinatorial optimisation problem aimed at finding the minimum-cost Hamiltonian circuit&lt;sup id="loc-1" role="doc-noteref"&gt;&lt;a href="#loc-11"&gt;1&lt;/a&gt;&lt;/sup&gt; for some weighted graph.&lt;/p&gt;&lt;p&gt;TSP is ubiquitous across various domains and fields, such as network performance, package delivery routing, water resource management, and beyond &lt;a id="loc-2" href="#loc-7" role="doc-biblioref"&gt;[1]&lt;/a&gt;.&lt;/p&gt;</description></item></channel></rss>