文章基本信息

标题：Dynamic Optimization of Network Routing Problem through Ant Colony Optimization (ACO)
本地全文：下载
作者：Khalid Mahmood ; Shahid Kamal ; Hamid Masood Khan 等
期刊名称：Computer Engineering and Intelligent Systems
印刷版ISSN：2222-1727
电子版ISSN：2222-2863
出版年度：2012
卷号：3
期号：8
页码：60-68
语种：English
出版社：International Institute for Science, Technology Education
摘要：Search Based Software Engineering (SBSE) is a new paradigm of Software engineering, which considers software engineering problems as search problems and emphasizes to find out optimal solution for the given set of available solutions using metaheuristic techniques like hill climbing simulated annealing, evolutionary programming and tabu search. On the other hand AI techniques like Swarm particle optimization and Ant colony optimization (ACO) are used to find out solutions for dynamic problems. SBSE is yet not used for dynamic problems. In this study ACO techniques are applied on SBSE problem by considering Network routing problem as case study, in which the nature of problem is dynamic.
关键词：SBSE; ACO; Metaheuristic search techniques; dynamic optimization