|
Abstract
|
In this thesis, the problem was the Data Allocation Problem (DAP), which is solved by the Sine Cosine Optimization Algorithm (SCOA), 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 SCOA method is used to solve this problem. The performance of SCOA is investigated in 20 different test problems. The results obtained using the presented method are better than those of the methods available in the literature regarding execution time and total cost.
|