Strategies DACS3 increasing its performances

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). Several ACS versions have been proposed which aim to achieve an optimum solution by adjusting pheromone levels. Embedding Malaysian House Red Ant behavior into ACS known as Dynamic Ant Colony Systems with Three Level Updates (DACS3) has increased the ability to reach shortest path. However, embedding such behavior has reduced the performance of the algorithm. Therefore, this paper presents the improvement of DACS3 by applying several strategies focuses on the improvement of the local techniques such as dynamic candidate list, smoothing and elitist ant. The performance of DACS3 is measured based on shortest distance and time taken to reach the solution against original DACS3 and ACS algorithms on TSP datasets ranging from 14 to 159 cities. The result shows that appyling several strategics into DACS3 has increased its ability to reach the shortest distance for most of the data and performs better for most datasets accept for Bier127, however the differences is very small.

Original languageEnglish
Pages (from-to)488-499
Number of pages12
JournalEuropean Journal of Scientific Research
Volume27
Issue number4
Publication statusPublished - 2009

Fingerprint

Ant Colony System
Ants
ant
Traveling salesman problem
Travelling salesman problems
Shortest path
Pheromones
Aptitude
Solenopsis geminata
Pheromone
pheromones
Dynamic Systems
Smoothing
Formicidae
Update
Strategy
ant colonies
pheromone
smoothing

Keywords

  • Ant Colony Optimization (ACO)
  • Dynamic Ant Colony System with three level updates (DACS3)
  • Traveling Salesman Problem (TSP)

ASJC Scopus subject areas

  • General

Cite this

Strategies DACS3 increasing its performances. / Ali Othman, Zulaiha; Rais, Helmi Md; Hamdan, Abdul Razak.

In: European Journal of Scientific Research, Vol. 27, No. 4, 2009, p. 488-499.

Research output: Contribution to journalArticle

@article{80e2d4a4d8724bbbb9ee32ad2ee54032,
title = "Strategies DACS3 increasing its performances",
abstract = "Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). Several ACS versions have been proposed which aim to achieve an optimum solution by adjusting pheromone levels. Embedding Malaysian House Red Ant behavior into ACS known as Dynamic Ant Colony Systems with Three Level Updates (DACS3) has increased the ability to reach shortest path. However, embedding such behavior has reduced the performance of the algorithm. Therefore, this paper presents the improvement of DACS3 by applying several strategies focuses on the improvement of the local techniques such as dynamic candidate list, smoothing and elitist ant. The performance of DACS3 is measured based on shortest distance and time taken to reach the solution against original DACS3 and ACS algorithms on TSP datasets ranging from 14 to 159 cities. The result shows that appyling several strategics into DACS3 has increased its ability to reach the shortest distance for most of the data and performs better for most datasets accept for Bier127, however the differences is very small.",
keywords = "Ant Colony Optimization (ACO), Dynamic Ant Colony System with three level updates (DACS3), Traveling Salesman Problem (TSP)",
author = "{Ali Othman}, Zulaiha and Rais, {Helmi Md} and Hamdan, {Abdul Razak}",
year = "2009",
language = "English",
volume = "27",
pages = "488--499",
journal = "European Journal of Scientific Research",
issn = "1450-202X",
publisher = "European Journals Inc.",
number = "4",

}

TY - JOUR

T1 - Strategies DACS3 increasing its performances

AU - Ali Othman, Zulaiha

AU - Rais, Helmi Md

AU - Hamdan, Abdul Razak

PY - 2009

Y1 - 2009

N2 - Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). Several ACS versions have been proposed which aim to achieve an optimum solution by adjusting pheromone levels. Embedding Malaysian House Red Ant behavior into ACS known as Dynamic Ant Colony Systems with Three Level Updates (DACS3) has increased the ability to reach shortest path. However, embedding such behavior has reduced the performance of the algorithm. Therefore, this paper presents the improvement of DACS3 by applying several strategies focuses on the improvement of the local techniques such as dynamic candidate list, smoothing and elitist ant. The performance of DACS3 is measured based on shortest distance and time taken to reach the solution against original DACS3 and ACS algorithms on TSP datasets ranging from 14 to 159 cities. The result shows that appyling several strategics into DACS3 has increased its ability to reach the shortest distance for most of the data and performs better for most datasets accept for Bier127, however the differences is very small.

AB - Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). Several ACS versions have been proposed which aim to achieve an optimum solution by adjusting pheromone levels. Embedding Malaysian House Red Ant behavior into ACS known as Dynamic Ant Colony Systems with Three Level Updates (DACS3) has increased the ability to reach shortest path. However, embedding such behavior has reduced the performance of the algorithm. Therefore, this paper presents the improvement of DACS3 by applying several strategies focuses on the improvement of the local techniques such as dynamic candidate list, smoothing and elitist ant. The performance of DACS3 is measured based on shortest distance and time taken to reach the solution against original DACS3 and ACS algorithms on TSP datasets ranging from 14 to 159 cities. The result shows that appyling several strategics into DACS3 has increased its ability to reach the shortest distance for most of the data and performs better for most datasets accept for Bier127, however the differences is very small.

KW - Ant Colony Optimization (ACO)

KW - Dynamic Ant Colony System with three level updates (DACS3)

KW - Traveling Salesman Problem (TSP)

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

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

M3 - Article

VL - 27

SP - 488

EP - 499

JO - European Journal of Scientific Research

JF - European Journal of Scientific Research

SN - 1450-202X

IS - 4

ER -