<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T09:32:14Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/3233" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/3233</identifier><datestamp>2017-03-21T15:52:59Z</datestamp><setSpec>com_10012_9900</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9914</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="39ea14aa-5066-4beb-aa74-f2fd925af7ad" confidence="600">Malisia, Alice Ralickas</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-09-13T20:16:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2007-09-13T20:16:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2007-09-13T20:16:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2007</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/3233</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Opposition-based learning (OBL) was recently proposed to extend di erent machine learning&#xd;
algorithms. The main idea of OBL is to consider opposite estimates, actions or states&#xd;
as an attempt to increase the coverage of the solution space and to reduce exploration time.&#xd;
OBL has already been applied to reinforcement learning, neural networks and genetic algorithms.&#xd;
This thesis explores the application of OBL to ant algorithms. Ant algorithms&#xd;
are based on the trail laying and following behaviour of ants. They have been successfully&#xd;
applied to many complex optimization problems. However, like any other technique, they&#xd;
can benefit from performance improvements. Thus, this work was motivated by the idea of&#xd;
developing more complex pheromone and path selection behaviour for the algorithm using&#xd;
the concept of opposition.&#xd;
&#xd;
This work proposes opposition-based extensions to the construction and update phases&#xd;
of the ant algorithm. The modifications that focus on the solution construction include&#xd;
three direct and two indirect methods. The three direct methods work by pairing the ants&#xd;
and synchronizing their path selection. The two other approaches modify the decisions of&#xd;
the ants by using opposite-pheromone content. The extension of the update phase lead to&#xd;
an approach that performs additional pheromone updates using opposite decisions.&#xd;
&#xd;
Experimental validation was done using two versions of the ant algorithm: the Ant&#xd;
System and the Ant Colony System. The di erent OBL extensions were applied to the&#xd;
Travelling Salesman Problem (TSP) and to the Grid World Problem (GWP). Results&#xd;
demonstrate that the concept of opposition is not easily applied to the ant algorithm.&#xd;
One pheromone-based method showed performance improvements that were statistically&#xd;
significant for the TSP. The quality of the solutions increased and more optimal solutions&#xd;
were found. The extension to the update phase showed some improvements for the TSP&#xd;
and led to accuracy improvements and a significant speed-up for the GWP. The other&#xd;
extensions showed no clear improvement.&#xd;
&#xd;
The proposed methods for applying opposition to the ant algorithm have potential, but&#xd;
more investigations are required before ant colony optimization can fully benefit from opposition.&#xd;
Most importantly, fundamental theoretical work with graphs, specifically, clearly&#xd;
defining opposite paths or opposite path components, is needed. Overall, the results indicate&#xd;
that OBL ideas can be beneficial for ant algorithms.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">ant colony optimization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">opposition-based learning</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">machine learning</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">ant colony system</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">ant system</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">OBL</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">ant algorithm</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">System Design Engineering</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Investigating the Application of Opposition-Based Ideas to Ant Algorithms</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Systems Design Engineering</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Applied Science</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>