Volume 6, Issue 2 (6-2014)                   IJICTR 2014, 6(2): 53-65 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Rahmaninia M, Bigdeli E, Afsharchi M. A Scalable Algorithm to Solve Distributed Constraint Optimization . IJICTR. 2014; 6 (2) :53-65
URL: http://ijict.itrc.ac.ir/article-1-131-en.html
1- Department of Computer Engineering Ghasre-shirin Branch, IAU Ghasre-shirin, Iran
2- Department of Computer Science IASBS Zanjan, Iran
3- Department of Computer Engineering University of Zanjan Zanjan, Iran
Abstract:   (1488 Views)
Recently, Distributed Constraint Optimization Problems (DCOP) have been drawing a growing body of attention as an important research area in multi agent systems as a large body of real problems can be modeled by them. The primary goal of this research is to design a distributed and effective algorithm to solve DCOP. There are various criteria that measure the efficiency of DCOP algorithms, but the most efficient algorithm for DCOP is the one by which the computation and communication cost is as low as possible and the quality of the solution is high. In this paper, we focus on an approximate DCOP algorithm called DALO (Distributed Asynchronous Local Optimization). Using the main idea of the DALO algorithm, we propose a new algorithm to solve DCOP, which exhibits two important improvements over the DALO algorithm. First we use a sequential partial approach to select a coefficient of leaders to compute the best assignment for agents by which the computation and communication cost decrease in the whole DCOP. The second improvement is an evolutionary approach by which the computation and communication burden for each agent decreases. We present some empirical evidences that show our algorithm performs better than the DALO algorithm.
Full-Text [PDF 1943 kb]   (717 Downloads)    
Type of Study: Research | Subject: Information Technology

Add your comments about this article : Your username or Email: