Modifying Ant Colony Optimization by introducing the concept of perception radius

Geetika Arora, Satakshi Rana, V. K. Panchal

Research output: Contribution to conferencePaper

3 Citations (Scopus)

Abstract

The main motive of Ant Colony Optimization (ACO) is to find the shortest path from the ants' nest to the food source by sensing the amount of pheromone (a chemical secreted by ants which is used as the communication system) on the different paths available. In this paper, we propose a novel methodology which solves the problem of an ant facing an obstacle in its path from the nest to the food source, in which case the conventional ACO may fail. This work proposes a modified ant colony optimization by introducing the concept of perception radius, for enabling the ants to find the path to the food source even if there is any break in the pheromone trail. The Travelling Salesman Problem, as an example, is solved using the proposed modified ACO and the results obtained are compared with Dijkstra's algorithm. It is clearly demonstrated that our methodology not only works well when breaks or hurdles are encountered by ants but also provides efficient results.

Original languageEnglish
Pages90-95
Number of pages6
DOIs
Publication statusPublished - 01-01-2014
Externally publishedYes
Event2014 International Conference on Reliability, Optimization and Information Technology, ICROIT 2014 - Faridabad, Haryana, India
Duration: 06-02-201408-02-2014

Conference

Conference2014 International Conference on Reliability, Optimization and Information Technology, ICROIT 2014
CountryIndia
CityFaridabad, Haryana
Period06-02-1408-02-14

Fingerprint

Ant colony optimization
Traveling salesman problem
Communication systems

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Safety, Risk, Reliability and Quality

Cite this

Arora, G., Rana, S., & Panchal, V. K. (2014). Modifying Ant Colony Optimization by introducing the concept of perception radius. 90-95. Paper presented at 2014 International Conference on Reliability, Optimization and Information Technology, ICROIT 2014, Faridabad, Haryana, India. https://doi.org/10.1109/ICROIT.2014.6798298
Arora, Geetika ; Rana, Satakshi ; Panchal, V. K. / Modifying Ant Colony Optimization by introducing the concept of perception radius. Paper presented at 2014 International Conference on Reliability, Optimization and Information Technology, ICROIT 2014, Faridabad, Haryana, India.6 p.
@conference{2792420e08874c689731a38f585c6112,
title = "Modifying Ant Colony Optimization by introducing the concept of perception radius",
abstract = "The main motive of Ant Colony Optimization (ACO) is to find the shortest path from the ants' nest to the food source by sensing the amount of pheromone (a chemical secreted by ants which is used as the communication system) on the different paths available. In this paper, we propose a novel methodology which solves the problem of an ant facing an obstacle in its path from the nest to the food source, in which case the conventional ACO may fail. This work proposes a modified ant colony optimization by introducing the concept of perception radius, for enabling the ants to find the path to the food source even if there is any break in the pheromone trail. The Travelling Salesman Problem, as an example, is solved using the proposed modified ACO and the results obtained are compared with Dijkstra's algorithm. It is clearly demonstrated that our methodology not only works well when breaks or hurdles are encountered by ants but also provides efficient results.",
author = "Geetika Arora and Satakshi Rana and Panchal, {V. K.}",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/ICROIT.2014.6798298",
language = "English",
pages = "90--95",
note = "2014 International Conference on Reliability, Optimization and Information Technology, ICROIT 2014 ; Conference date: 06-02-2014 Through 08-02-2014",

}

Arora, G, Rana, S & Panchal, VK 2014, 'Modifying Ant Colony Optimization by introducing the concept of perception radius' Paper presented at 2014 International Conference on Reliability, Optimization and Information Technology, ICROIT 2014, Faridabad, Haryana, India, 06-02-14 - 08-02-14, pp. 90-95. https://doi.org/10.1109/ICROIT.2014.6798298

Modifying Ant Colony Optimization by introducing the concept of perception radius. / Arora, Geetika; Rana, Satakshi; Panchal, V. K.

2014. 90-95 Paper presented at 2014 International Conference on Reliability, Optimization and Information Technology, ICROIT 2014, Faridabad, Haryana, India.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Modifying Ant Colony Optimization by introducing the concept of perception radius

AU - Arora, Geetika

AU - Rana, Satakshi

AU - Panchal, V. K.

PY - 2014/1/1

Y1 - 2014/1/1

N2 - The main motive of Ant Colony Optimization (ACO) is to find the shortest path from the ants' nest to the food source by sensing the amount of pheromone (a chemical secreted by ants which is used as the communication system) on the different paths available. In this paper, we propose a novel methodology which solves the problem of an ant facing an obstacle in its path from the nest to the food source, in which case the conventional ACO may fail. This work proposes a modified ant colony optimization by introducing the concept of perception radius, for enabling the ants to find the path to the food source even if there is any break in the pheromone trail. The Travelling Salesman Problem, as an example, is solved using the proposed modified ACO and the results obtained are compared with Dijkstra's algorithm. It is clearly demonstrated that our methodology not only works well when breaks or hurdles are encountered by ants but also provides efficient results.

AB - The main motive of Ant Colony Optimization (ACO) is to find the shortest path from the ants' nest to the food source by sensing the amount of pheromone (a chemical secreted by ants which is used as the communication system) on the different paths available. In this paper, we propose a novel methodology which solves the problem of an ant facing an obstacle in its path from the nest to the food source, in which case the conventional ACO may fail. This work proposes a modified ant colony optimization by introducing the concept of perception radius, for enabling the ants to find the path to the food source even if there is any break in the pheromone trail. The Travelling Salesman Problem, as an example, is solved using the proposed modified ACO and the results obtained are compared with Dijkstra's algorithm. It is clearly demonstrated that our methodology not only works well when breaks or hurdles are encountered by ants but also provides efficient results.

UR - http://www.scopus.com/inward/record.url?scp=84900325407&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84900325407&partnerID=8YFLogxK

U2 - 10.1109/ICROIT.2014.6798298

DO - 10.1109/ICROIT.2014.6798298

M3 - Paper

AN - SCOPUS:84900325407

SP - 90

EP - 95

ER -

Arora G, Rana S, Panchal VK. Modifying Ant Colony Optimization by introducing the concept of perception radius. 2014. Paper presented at 2014 International Conference on Reliability, Optimization and Information Technology, ICROIT 2014, Faridabad, Haryana, India. https://doi.org/10.1109/ICROIT.2014.6798298