Title

Search Context Awareness in Several Ant Colony Optimization Models

Abstract

In ant colony optimization (ACO) methods, including Ant System and MAX-MIN Ant System, each ant stochastically generates its candidate solution, in a given iteration, based on the same pheromone t and heuristic η information as every other ant. Stubborn ants are a variation in which each ant is sensitive to the context of its own personal search history. Specifically, if an ant generates a particular candidate solution in a given iteration, then the components of that solution will have a higher probability of being selected in the candidate solution generated by that ant in the next iteration. We evaluate this variation in the context of the Traveling Salesman Problem (TSP), finding that it can both improve the quality of the solution and reduce execution-time.

Department(s)

Electrical and Computer Engineering

International Standard Serial Number (ISSN)

10765204

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2013 International Society for Computers and Their Applications (ISCA), All rights reserved.

This document is currently not available here.


Share

 
COinS