Improved Dynamic Ant Colony System (DACS) on symmetric Traveling Salesman Problem (TSP)

Helmi Md Rais, Zulaiha Ali Othman, Abdul Razak Hamdan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

21 Citations (Scopus)

Abstract

Ants are a fascinating creature that demonstrates a capability of finding food and bring it back to their nest. Their ability as a colony to find paths or routes to the food sources has inspired the development of an algorithm namely Ant Colony System (ACS). The principle of cooperation has been the backbone in these algorithmic developments. However, observing the behavior of a single ant can provide an added value to the principle. Ants communicate to each other through a chemical substance called pheromone. Manipulating and empowering this substance is the trivial factor in finding the best solution. However, without considering the experiences of individuals would contribute a complete waste of available knowledge. Having the concepts of a single ant trying to reconstruct or reconnect the paths that was previously laid by its colony when a certain obstacle placed on its normal paths has added another level of pheromone updates. Thus, this new level of pheromone updates which manipulating and empowering the searching experiences of individual ants can improve the current ACS algorithm. Traveling Salesman Problem (TSP) was used as a case study to show the capability of the algorithm in order to find the best solution in terms of the shortest distance. At the end of this paper, we presented an experimental result on a benchmark data to show how it could improve the fundamental ofACS algorithm.

Original languageEnglish
Title of host publication2007 International Conference on Intelligent and Advanced Systems, ICIAS 2007
Pages43-48
Number of pages6
DOIs
Publication statusPublished - 2007
Event2007 International Conference on Intelligent and Advanced Systems, ICIAS 2007 - Kuala Lumpur
Duration: 25 Nov 200728 Nov 2007

Other

Other2007 International Conference on Intelligent and Advanced Systems, ICIAS 2007
CityKuala Lumpur
Period25/11/0728/11/07

Fingerprint

Traveling salesman problem

Keywords

  • Dynamic Ant Colony System (DACS)
  • Optimization
  • Social insects
  • Swarm intelligent
  • Traveling Salesman Problem (TSP)

ASJC Scopus subject areas

  • Artificial Intelligence
  • Control and Systems Engineering

Cite this

Rais, H. M., Ali Othman, Z., & Hamdan, A. R. (2007). Improved Dynamic Ant Colony System (DACS) on symmetric Traveling Salesman Problem (TSP). In 2007 International Conference on Intelligent and Advanced Systems, ICIAS 2007 (pp. 43-48). [4658345] https://doi.org/10.1109/ICIAS.2007.4658345

Improved Dynamic Ant Colony System (DACS) on symmetric Traveling Salesman Problem (TSP). / Rais, Helmi Md; Ali Othman, Zulaiha; Hamdan, Abdul Razak.

2007 International Conference on Intelligent and Advanced Systems, ICIAS 2007. 2007. p. 43-48 4658345.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rais, HM, Ali Othman, Z & Hamdan, AR 2007, Improved Dynamic Ant Colony System (DACS) on symmetric Traveling Salesman Problem (TSP). in 2007 International Conference on Intelligent and Advanced Systems, ICIAS 2007., 4658345, pp. 43-48, 2007 International Conference on Intelligent and Advanced Systems, ICIAS 2007, Kuala Lumpur, 25/11/07. https://doi.org/10.1109/ICIAS.2007.4658345
Rais HM, Ali Othman Z, Hamdan AR. Improved Dynamic Ant Colony System (DACS) on symmetric Traveling Salesman Problem (TSP). In 2007 International Conference on Intelligent and Advanced Systems, ICIAS 2007. 2007. p. 43-48. 4658345 https://doi.org/10.1109/ICIAS.2007.4658345
Rais, Helmi Md ; Ali Othman, Zulaiha ; Hamdan, Abdul Razak. / Improved Dynamic Ant Colony System (DACS) on symmetric Traveling Salesman Problem (TSP). 2007 International Conference on Intelligent and Advanced Systems, ICIAS 2007. 2007. pp. 43-48
@inproceedings{212422cf69e84b2185a648c5e0311369,
title = "Improved Dynamic Ant Colony System (DACS) on symmetric Traveling Salesman Problem (TSP)",
abstract = "Ants are a fascinating creature that demonstrates a capability of finding food and bring it back to their nest. Their ability as a colony to find paths or routes to the food sources has inspired the development of an algorithm namely Ant Colony System (ACS). The principle of cooperation has been the backbone in these algorithmic developments. However, observing the behavior of a single ant can provide an added value to the principle. Ants communicate to each other through a chemical substance called pheromone. Manipulating and empowering this substance is the trivial factor in finding the best solution. However, without considering the experiences of individuals would contribute a complete waste of available knowledge. Having the concepts of a single ant trying to reconstruct or reconnect the paths that was previously laid by its colony when a certain obstacle placed on its normal paths has added another level of pheromone updates. Thus, this new level of pheromone updates which manipulating and empowering the searching experiences of individual ants can improve the current ACS algorithm. Traveling Salesman Problem (TSP) was used as a case study to show the capability of the algorithm in order to find the best solution in terms of the shortest distance. At the end of this paper, we presented an experimental result on a benchmark data to show how it could improve the fundamental ofACS algorithm.",
keywords = "Dynamic Ant Colony System (DACS), Optimization, Social insects, Swarm intelligent, Traveling Salesman Problem (TSP)",
author = "Rais, {Helmi Md} and {Ali Othman}, Zulaiha and Hamdan, {Abdul Razak}",
year = "2007",
doi = "10.1109/ICIAS.2007.4658345",
language = "English",
isbn = "1424413559",
pages = "43--48",
booktitle = "2007 International Conference on Intelligent and Advanced Systems, ICIAS 2007",

}

TY - GEN

T1 - Improved Dynamic Ant Colony System (DACS) on symmetric Traveling Salesman Problem (TSP)

AU - Rais, Helmi Md

AU - Ali Othman, Zulaiha

AU - Hamdan, Abdul Razak

PY - 2007

Y1 - 2007

N2 - Ants are a fascinating creature that demonstrates a capability of finding food and bring it back to their nest. Their ability as a colony to find paths or routes to the food sources has inspired the development of an algorithm namely Ant Colony System (ACS). The principle of cooperation has been the backbone in these algorithmic developments. However, observing the behavior of a single ant can provide an added value to the principle. Ants communicate to each other through a chemical substance called pheromone. Manipulating and empowering this substance is the trivial factor in finding the best solution. However, without considering the experiences of individuals would contribute a complete waste of available knowledge. Having the concepts of a single ant trying to reconstruct or reconnect the paths that was previously laid by its colony when a certain obstacle placed on its normal paths has added another level of pheromone updates. Thus, this new level of pheromone updates which manipulating and empowering the searching experiences of individual ants can improve the current ACS algorithm. Traveling Salesman Problem (TSP) was used as a case study to show the capability of the algorithm in order to find the best solution in terms of the shortest distance. At the end of this paper, we presented an experimental result on a benchmark data to show how it could improve the fundamental ofACS algorithm.

AB - Ants are a fascinating creature that demonstrates a capability of finding food and bring it back to their nest. Their ability as a colony to find paths or routes to the food sources has inspired the development of an algorithm namely Ant Colony System (ACS). The principle of cooperation has been the backbone in these algorithmic developments. However, observing the behavior of a single ant can provide an added value to the principle. Ants communicate to each other through a chemical substance called pheromone. Manipulating and empowering this substance is the trivial factor in finding the best solution. However, without considering the experiences of individuals would contribute a complete waste of available knowledge. Having the concepts of a single ant trying to reconstruct or reconnect the paths that was previously laid by its colony when a certain obstacle placed on its normal paths has added another level of pheromone updates. Thus, this new level of pheromone updates which manipulating and empowering the searching experiences of individual ants can improve the current ACS algorithm. Traveling Salesman Problem (TSP) was used as a case study to show the capability of the algorithm in order to find the best solution in terms of the shortest distance. At the end of this paper, we presented an experimental result on a benchmark data to show how it could improve the fundamental ofACS algorithm.

KW - Dynamic Ant Colony System (DACS)

KW - Optimization

KW - Social insects

KW - Swarm intelligent

KW - Traveling Salesman Problem (TSP)

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

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

U2 - 10.1109/ICIAS.2007.4658345

DO - 10.1109/ICIAS.2007.4658345

M3 - Conference contribution

AN - SCOPUS:57349187044

SN - 1424413559

SN - 9781424413553

SP - 43

EP - 48

BT - 2007 International Conference on Intelligent and Advanced Systems, ICIAS 2007

ER -