期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2012
卷号：3
期号：2
页码：821-824
语种：English
出版社：Ayushmaan Technologies
摘要：The Load Balancing Problem consists of assigning the load of an overloaded node to another under loaded node with minimum cost. Each node has a limited amount of capacity and each task must be assigned to one and only one node, requiring a certain amount of the node’s capacity. In this paper, the application of Ant Colony Optimization (ACO) is presented. The Ant heuristic can be seen as an adaptive sampling algorithm that takes into consideration the experience gathered in earlier iterations of the algorithm. Several neighborhoods are studied, that produces good moves without increasing the computational effort. The algorithm proposed in this paper is inspired by scatter search using ant heuristics. The main feature of the hybrid algorithm is to hybridize the solution construction mechanism of the Scatter Search (SS) with Ant Colony Optimization (ACO). In this algorithm, ACO algorithm is used to generate the initial solutions which form the reference set. Within the scatter search framework, after two-solution combination method for the reference set has been applied, ACO method is employed to generate new solutions through updating the common arc pheromone mechanism.
