Safae Bouzbita, A. El Afia, R. Faizi, Mustapha Zbakh
{"title":"Dynamic adaptation of the ACS-TSP local pheromone decay parameter based on the Hidden Markov Model","authors":"Safae Bouzbita, A. El Afia, R. Faizi, Mustapha Zbakh","doi":"10.1109/CLOUDTECH.2016.7847719","DOIUrl":null,"url":null,"abstract":"The objective of the present paper is to propose an improved Ant Colony System (ACS) algorithm based on a Hidden Markov Model (HMM) so as dynamically adapt the local pheromone decay parameter ξ. The proposed algorithm uses Iteration and Diversity as indicators of the hidden states in the search space in ACS. To test the efficiency of our algorithm, we experimented it on several benchmark Travelling Salesman Problem (TSP) instances. The results have proven the effectiveness of our algorithm in both the convergence speed and the solution quality.","PeriodicalId":133495,"journal":{"name":"2016 2nd International Conference on Cloud Computing Technologies and Applications (CloudTech)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 2nd International Conference on Cloud Computing Technologies and Applications (CloudTech)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CLOUDTECH.2016.7847719","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15
Abstract
The objective of the present paper is to propose an improved Ant Colony System (ACS) algorithm based on a Hidden Markov Model (HMM) so as dynamically adapt the local pheromone decay parameter ξ. The proposed algorithm uses Iteration and Diversity as indicators of the hidden states in the search space in ACS. To test the efficiency of our algorithm, we experimented it on several benchmark Travelling Salesman Problem (TSP) instances. The results have proven the effectiveness of our algorithm in both the convergence speed and the solution quality.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
