مشخصات پژوهش

In this thesis, the problem was the Data Allocation Problem (DAP), which is solved by the Parallel PSO (PPSO) algorithm, which has not been used in the literature before. DAP is another optimization problem that is used to measure the efficiency of optimization algorithms. The purpose of DAP is to find the location of fragments at the best sites to alleviate the total cost of the transaction when a site sends a query to other sites. The main goal of this allocation process is to minimize the execution time and transaction costs of queries. The PPSO method is used to solve this problem. The performance of PPSO is investigated in 20 different test problems. The results obtained in the presented method are better than the results of the methods available in the literature in terms of execution time and total cost.