Abstract

We present two algorithms within the framework of the Ant Colony Optimization (ACO) metaheuristic. The rst algorithm seeks to increase the exploration bias of Gambardella et al.'s (2012) Enhanced Ant Colony System (EACS) model, a model which heavily increases the exploitation bias of the already highly exploitative ACS model in order to gain the bene t of increased speed. Our algorithm aims to strike a balance between these two models. The second is also an extension of EACS, based on Jayadeva et al.'s (2013) EigenAnt algorithm. EigenAnt aims to avoid the problem of stagnation found in ACO algorithms by, among other unique properties, utilizing a selective rather than global pheromone evaporation model, and by discarding heuristics in the solution construction phase. A performance comparison between our two models, the legacy ACS model, and the EACS model is presented. The Sequential Ordering Problem (SOP), one of the main problems used to demonstrate EACS, and one still actively studied to this day, was utilized to conduct the comparison.

Department

Computer Science & Engineering Department

Degree Name

MS in Computer Science

Graduation Date

2-1-2014

Submission Date

July 2013

First Advisor

Abdelbar, Ashraf

Committee Member 1

Rafea, Ahmed

Committee Member 2

Moustafa, Mohamed

Extent

62 p.

Document Type

Master's Thesis

Library of Congress Subject Heading 1

Mathematical optimization.

Library of Congress Subject Heading 2

Operations research.

Rights

The author retains all rights with regard to copyright. The author certifies that written permission from the owner(s) of third-party copyrighted matter included in the thesis, dissertation, paper, or record of study has been obtained. The author further certifies that IRB approval has been obtained for this thesis, or that IRB approval is not necessary for this thesis. Insofar as this thesis, dissertation, paper, or record of study is an educational record as defined in the Family Educational Rights and Privacy Act (FERPA) (20 USC 1232g), the author has granted consent to disclosure of it to anyone who requests a copy.

Institutional Review Board (IRB) Approval

Not necessary for this item

Download

Share

COinS