WDM网状网络中单跳波长分配的蚁群算法

17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05) Pub Date : 2005-11-14 DOI:10.1109/ICTAI.2005.33

T. S. Chin

{"title":"WDM网状网络中单跳波长分配的蚁群算法","authors":"T. S. Chin","doi":"10.1109/ICTAI.2005.33","DOIUrl":null,"url":null,"abstract":"A RWA linear programming formulation was formulated and ILP solver was used along with good approximation techniques (heuristic) to solve the static RWA problem The objective was to maximize the one hop traffic, given a set of lightpath requests/traffic demand. However, the proposed heuristic has the limitation of stagnation. Thus we applied ant colony optimization (ACO) combined with heuristic algorithm to solve the assignment problem to obtain best assignment with highest objective value. The ACO based algorithm can outperform the comparison scheme and provide a better performance and more reliable than the proposed heuristic and ILP solver. The claim made in the paper for the proposed new heuristic and ACO are supported by experimental results","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"395 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"An ant algorithm for single-hop wavelength assignment in WDM mesh network\",\"authors\":\"T. S. Chin\",\"doi\":\"10.1109/ICTAI.2005.33\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A RWA linear programming formulation was formulated and ILP solver was used along with good approximation techniques (heuristic) to solve the static RWA problem The objective was to maximize the one hop traffic, given a set of lightpath requests/traffic demand. However, the proposed heuristic has the limitation of stagnation. Thus we applied ant colony optimization (ACO) combined with heuristic algorithm to solve the assignment problem to obtain best assignment with highest objective value. The ACO based algorithm can outperform the comparison scheme and provide a better performance and more reliable than the proposed heuristic and ILP solver. The claim made in the paper for the proposed new heuristic and ACO are supported by experimental results\",\"PeriodicalId\":294694,\"journal\":{\"name\":\"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)\",\"volume\":\"395 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTAI.2005.33\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2005.33","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

制定了RWA线性规划公式，并使用ILP求解器以及良好的近似技术(启发式)来解决静态RWA问题。目标是在给定一组光路请求/流量需求的情况下最大化一跳流量。然而，所提出的启发式算法存在滞后性的局限性。为此，我们将蚁群算法与启发式算法相结合来求解分配问题，以获得目标值最高的最佳分配。基于蚁群算法的求解方案优于比较方案，比启发式和ILP求解方案具有更好的性能和可靠性。实验结果支持了本文提出的启发式算法和蚁群算法

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An ant algorithm for single-hop wavelength assignment in WDM mesh network

A RWA linear programming formulation was formulated and ILP solver was used along with good approximation techniques (heuristic) to solve the static RWA problem The objective was to maximize the one hop traffic, given a set of lightpath requests/traffic demand. However, the proposed heuristic has the limitation of stagnation. Thus we applied ant colony optimization (ACO) combined with heuristic algorithm to solve the assignment problem to obtain best assignment with highest objective value. The ACO based algorithm can outperform the comparison scheme and provide a better performance and more reliable than the proposed heuristic and ILP solver. The claim made in the paper for the proposed new heuristic and ACO are supported by experimental results

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)

自引率

0.00%

发文量