Dynamic Optimization of Network Routing Problem Through Ant Colony Optimization (ACO)

Provided by: Academic Hosting & Event Management Solutions
Topic: Software
Format: PDF
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 paper, ACO techniques are applied on SBSE problem by considering network routing problem as case study, in which the nature of problem is dynamic.

Find By Topic