Improvement DACS3 searching performance using local search

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

4 Citations (Scopus)

Abstract

Currently, Ant Colony Optimization (ACO) metaheuristic becomes the most prominent techniques applied in TSP. It is based on the cooperation of a complex society of ants through a chemical substance called pheromone. Several versions of metaheuristic ACOs' have been developed through several improvement processes to produce better algorithm. Past research has proposed a Dynamic Ant Colony System with Three Level Updates (DACS3) algorithm that embedding a Malaysian House Red Ant behavior into current ACS. The algorithm consists of three levels of pheromone updating rules such as local, intermediate and global pheromone updates. Embedding such behavior has improved quality of solution and time taken to reach the solution. However, the algorithm performance is reduced for large data set. Therefore this research aims to improve the algorithm using various supportive and improvement strategies. Three supportive strategies are used such as dynamic candidate list, elitist ants and pheromone trail smoothing whereas improvement strategies used local search. The capability of DACS3 is measured based on quality of solution, time taken to reach the solution and algorithm performance. Moreover, ROC test was carried out between DACS3 and ACS on TSP datasets ranging from 100 to 318 cities. The result shows that applying the above strategies improve the quality of solution on few data and remain on others. Nonetheless it also improves the time taken to reach the solution by 4%-90%. The ROC test result shows that DACS3 is more sensitive then ACS. This research proves that applying various supportive and improvement strategies has improves the DACS3 performance.

Original languageEnglish
Title of host publication2009 2nd Conference on Data Mining and Optimization, DMO 2009
Pages160-166
Number of pages7
DOIs
Publication statusPublished - 2009
Event2009 2nd Conference on Data Mining and Optimization, DMO 2009 - Bangi, Selangor
Duration: 27 Oct 200928 Oct 2009

Other

Other2009 2nd Conference on Data Mining and Optimization, DMO 2009
CityBangi, Selangor
Period27/10/0928/10/09

Fingerprint

Ant colony optimization
Local search (optimization)

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Software

Cite this

Md. Rais, H., Ali Othman, Z., & Hamdan, A. R. (2009). Improvement DACS3 searching performance using local search. In 2009 2nd Conference on Data Mining and Optimization, DMO 2009 (pp. 160-166). [5341892] https://doi.org/10.1109/DMO.2009.5341892

Improvement DACS3 searching performance using local search. / Md. Rais, Helmi; Ali Othman, Zulaiha; Hamdan, Abdul Razak.

2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. p. 160-166 5341892.

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

Md. Rais, H, Ali Othman, Z & Hamdan, AR 2009, Improvement DACS3 searching performance using local search. in 2009 2nd Conference on Data Mining and Optimization, DMO 2009., 5341892, pp. 160-166, 2009 2nd Conference on Data Mining and Optimization, DMO 2009, Bangi, Selangor, 27/10/09. https://doi.org/10.1109/DMO.2009.5341892
Md. Rais H, Ali Othman Z, Hamdan AR. Improvement DACS3 searching performance using local search. In 2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. p. 160-166. 5341892 https://doi.org/10.1109/DMO.2009.5341892
Md. Rais, Helmi ; Ali Othman, Zulaiha ; Hamdan, Abdul Razak. / Improvement DACS3 searching performance using local search. 2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. pp. 160-166
@inproceedings{37c61d481f924ba5a3124977cb2ee7b6,
title = "Improvement DACS3 searching performance using local search",
abstract = "Currently, Ant Colony Optimization (ACO) metaheuristic becomes the most prominent techniques applied in TSP. It is based on the cooperation of a complex society of ants through a chemical substance called pheromone. Several versions of metaheuristic ACOs' have been developed through several improvement processes to produce better algorithm. Past research has proposed a Dynamic Ant Colony System with Three Level Updates (DACS3) algorithm that embedding a Malaysian House Red Ant behavior into current ACS. The algorithm consists of three levels of pheromone updating rules such as local, intermediate and global pheromone updates. Embedding such behavior has improved quality of solution and time taken to reach the solution. However, the algorithm performance is reduced for large data set. Therefore this research aims to improve the algorithm using various supportive and improvement strategies. Three supportive strategies are used such as dynamic candidate list, elitist ants and pheromone trail smoothing whereas improvement strategies used local search. The capability of DACS3 is measured based on quality of solution, time taken to reach the solution and algorithm performance. Moreover, ROC test was carried out between DACS3 and ACS on TSP datasets ranging from 100 to 318 cities. The result shows that applying the above strategies improve the quality of solution on few data and remain on others. Nonetheless it also improves the time taken to reach the solution by 4{\%}-90{\%}. The ROC test result shows that DACS3 is more sensitive then ACS. This research proves that applying various supportive and improvement strategies has improves the DACS3 performance.",
author = "{Md. Rais}, Helmi and {Ali Othman}, Zulaiha and Hamdan, {Abdul Razak}",
year = "2009",
doi = "10.1109/DMO.2009.5341892",
language = "English",
isbn = "9781424449446",
pages = "160--166",
booktitle = "2009 2nd Conference on Data Mining and Optimization, DMO 2009",

}

TY - GEN

T1 - Improvement DACS3 searching performance using local search

AU - Md. Rais, Helmi

AU - Ali Othman, Zulaiha

AU - Hamdan, Abdul Razak

PY - 2009

Y1 - 2009

N2 - Currently, Ant Colony Optimization (ACO) metaheuristic becomes the most prominent techniques applied in TSP. It is based on the cooperation of a complex society of ants through a chemical substance called pheromone. Several versions of metaheuristic ACOs' have been developed through several improvement processes to produce better algorithm. Past research has proposed a Dynamic Ant Colony System with Three Level Updates (DACS3) algorithm that embedding a Malaysian House Red Ant behavior into current ACS. The algorithm consists of three levels of pheromone updating rules such as local, intermediate and global pheromone updates. Embedding such behavior has improved quality of solution and time taken to reach the solution. However, the algorithm performance is reduced for large data set. Therefore this research aims to improve the algorithm using various supportive and improvement strategies. Three supportive strategies are used such as dynamic candidate list, elitist ants and pheromone trail smoothing whereas improvement strategies used local search. The capability of DACS3 is measured based on quality of solution, time taken to reach the solution and algorithm performance. Moreover, ROC test was carried out between DACS3 and ACS on TSP datasets ranging from 100 to 318 cities. The result shows that applying the above strategies improve the quality of solution on few data and remain on others. Nonetheless it also improves the time taken to reach the solution by 4%-90%. The ROC test result shows that DACS3 is more sensitive then ACS. This research proves that applying various supportive and improvement strategies has improves the DACS3 performance.

AB - Currently, Ant Colony Optimization (ACO) metaheuristic becomes the most prominent techniques applied in TSP. It is based on the cooperation of a complex society of ants through a chemical substance called pheromone. Several versions of metaheuristic ACOs' have been developed through several improvement processes to produce better algorithm. Past research has proposed a Dynamic Ant Colony System with Three Level Updates (DACS3) algorithm that embedding a Malaysian House Red Ant behavior into current ACS. The algorithm consists of three levels of pheromone updating rules such as local, intermediate and global pheromone updates. Embedding such behavior has improved quality of solution and time taken to reach the solution. However, the algorithm performance is reduced for large data set. Therefore this research aims to improve the algorithm using various supportive and improvement strategies. Three supportive strategies are used such as dynamic candidate list, elitist ants and pheromone trail smoothing whereas improvement strategies used local search. The capability of DACS3 is measured based on quality of solution, time taken to reach the solution and algorithm performance. Moreover, ROC test was carried out between DACS3 and ACS on TSP datasets ranging from 100 to 318 cities. The result shows that applying the above strategies improve the quality of solution on few data and remain on others. Nonetheless it also improves the time taken to reach the solution by 4%-90%. The ROC test result shows that DACS3 is more sensitive then ACS. This research proves that applying various supportive and improvement strategies has improves the DACS3 performance.

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

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

U2 - 10.1109/DMO.2009.5341892

DO - 10.1109/DMO.2009.5341892

M3 - Conference contribution

AN - SCOPUS:72449154601

SN - 9781424449446

SP - 160

EP - 166

BT - 2009 2nd Conference on Data Mining and Optimization, DMO 2009

ER -