Reducing iteration using candidate list

Helmi Md Rais, Zulaiha Ali Othman, Abdul Razak Hamdan

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

7 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 a newly developed algorithm called Dynamic Ant Colony System 3 Level Updates (DACS3). The principle of cooperation and the behavior of a single ant finding path has been the backbone in this algorithmic development. 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, a long searching time required by DACS3 to find the best solution is a problem factor that needs to be addressed. Thus, adding a suitable strategy like candidate list concept would helps DACS3 improve its' performance. 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 several benchmark data to show improvement of DACS3 algorithm.

Original languageEnglish
Title of host publicationProceedings - International Symposium on Information Technology 2008, ITSim
Volume4
DOIs
Publication statusPublished - 2008
EventInternational Symposium on Information Technology 2008, ITSim - Kuala Lumpur
Duration: 26 Aug 200829 Aug 2008

Other

OtherInternational Symposium on Information Technology 2008, ITSim
CityKuala Lumpur
Period26/8/0829/8/08

Fingerprint

Traveling salesman problem

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Rais, H. M., Ali Othman, Z., & Hamdan, A. R. (2008). Reducing iteration using candidate list. In Proceedings - International Symposium on Information Technology 2008, ITSim (Vol. 4). [4632052] https://doi.org/10.1109/ITSIM.2008.4632052

Reducing iteration using candidate list. / Rais, Helmi Md; Ali Othman, Zulaiha; Hamdan, Abdul Razak.

Proceedings - International Symposium on Information Technology 2008, ITSim. Vol. 4 2008. 4632052.

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

Rais, HM, Ali Othman, Z & Hamdan, AR 2008, Reducing iteration using candidate list. in Proceedings - International Symposium on Information Technology 2008, ITSim. vol. 4, 4632052, International Symposium on Information Technology 2008, ITSim, Kuala Lumpur, 26/8/08. https://doi.org/10.1109/ITSIM.2008.4632052
Rais HM, Ali Othman Z, Hamdan AR. Reducing iteration using candidate list. In Proceedings - International Symposium on Information Technology 2008, ITSim. Vol. 4. 2008. 4632052 https://doi.org/10.1109/ITSIM.2008.4632052
Rais, Helmi Md ; Ali Othman, Zulaiha ; Hamdan, Abdul Razak. / Reducing iteration using candidate list. Proceedings - International Symposium on Information Technology 2008, ITSim. Vol. 4 2008.
@inproceedings{1bcb685106934d8491065584839a1c4b,
title = "Reducing iteration using candidate list",
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 a newly developed algorithm called Dynamic Ant Colony System 3 Level Updates (DACS3). The principle of cooperation and the behavior of a single ant finding path has been the backbone in this algorithmic development. 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, a long searching time required by DACS3 to find the best solution is a problem factor that needs to be addressed. Thus, adding a suitable strategy like candidate list concept would helps DACS3 improve its' performance. 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 several benchmark data to show improvement of DACS3 algorithm.",
author = "Rais, {Helmi Md} and {Ali Othman}, Zulaiha and Hamdan, {Abdul Razak}",
year = "2008",
doi = "10.1109/ITSIM.2008.4632052",
language = "English",
isbn = "9781424423286",
volume = "4",
booktitle = "Proceedings - International Symposium on Information Technology 2008, ITSim",

}

TY - GEN

T1 - Reducing iteration using candidate list

AU - Rais, Helmi Md

AU - Ali Othman, Zulaiha

AU - Hamdan, Abdul Razak

PY - 2008

Y1 - 2008

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 a newly developed algorithm called Dynamic Ant Colony System 3 Level Updates (DACS3). The principle of cooperation and the behavior of a single ant finding path has been the backbone in this algorithmic development. 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, a long searching time required by DACS3 to find the best solution is a problem factor that needs to be addressed. Thus, adding a suitable strategy like candidate list concept would helps DACS3 improve its' performance. 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 several benchmark data to show improvement of DACS3 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 a newly developed algorithm called Dynamic Ant Colony System 3 Level Updates (DACS3). The principle of cooperation and the behavior of a single ant finding path has been the backbone in this algorithmic development. 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, a long searching time required by DACS3 to find the best solution is a problem factor that needs to be addressed. Thus, adding a suitable strategy like candidate list concept would helps DACS3 improve its' performance. 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 several benchmark data to show improvement of DACS3 algorithm.

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

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

U2 - 10.1109/ITSIM.2008.4632052

DO - 10.1109/ITSIM.2008.4632052

M3 - Conference contribution

AN - SCOPUS:57349095236

SN - 9781424423286

VL - 4

BT - Proceedings - International Symposium on Information Technology 2008, ITSim

ER -