A Hybrid Method based on SA and VNS Algorithms for Solving DAP in DDS
Data allocation problem (DAP) is of great importance in distributed database systems (DDS). Minimizing the total cost of transactions and queries is the main objective of DAP which is mostly affected by the volume of transmitting data through the system. On the other hand, the volume of transmitting...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2021-09-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v29-n2/v29-n2-(pp184-205).pdf |
| _version_ | 1817995474482757632 |
|---|---|
| author | Nasser Lotfi Jamshid Tamouk |
| author_facet | Nasser Lotfi Jamshid Tamouk |
| author_sort | Nasser Lotfi |
| collection | DOAJ |
| description | Data allocation problem (DAP) is of great importance in distributed database systems (DDS). Minimizing the total cost of transactions and queries is the main objective of DAP which is mostly affected by the volume of transmitting data through the system. On the other hand, the volume of transmitting data depends on the fragment-to-site allocations method. DAP as a Np-hard problem has been widely solved by applying soft computing methods like evolutionary algorithms. In the continuation of our previously published research, this paper proposes a novel hybrid method based on Simulated Annealing Algorithm (SA) and Variable Neighborhood Search (VNS) mechanism for Solving DAP. To increase the performance, VNS mechanism is embedded into SA method in the proposed hybrid method. Technically speaking, in order to discover more promising parts of search space, the proposed method (VNSA) explores the search space via SA and fulfills more exploitation by applying neighborhood search mechanism. Moreover, due to the fact that both are a single solution-based method, they explore the search space faster than population-based methods. Performance of the proposed VNSA is experimentally evaluated using well-known benchmarks reported in state-of-the-art literature, and evaluation outcomes prove the robustness and fastness of the proposed hybrid method (VNSA). Furthermore, the results exhibit that VNSA outperforms its competitors and achieves better results in majority of test problems. |
| first_indexed | 2024-04-14T02:06:31Z |
| format | Article |
| id | doaj.art-0426b1b0fb114b3ba82a317bda18853e |
| institution | Directory Open Access Journal |
| issn | 1561-4042 |
| language | English |
| last_indexed | 2024-04-14T02:06:31Z |
| publishDate | 2021-09-01 |
| publisher | Vladimir Andrunachievici Institute of Mathematics and Computer Science |
| record_format | Article |
| series | Computer Science Journal of Moldova |
| spelling | doaj.art-0426b1b0fb114b3ba82a317bda18853e2022-12-22T02:18:38ZengVladimir Andrunachievici Institute of Mathematics and Computer ScienceComputer Science Journal of Moldova1561-40422021-09-01292(86)184205A Hybrid Method based on SA and VNS Algorithms for Solving DAP in DDSNasser Lotfi0Jamshid Tamouk1Faculty of Engineering, Cyprus Science University, Girne, N. , Cyprus via Mersin 10, TurkeyFaculty of Engineering, Eastern Mediterranean University, Famagusta, N. Cyprus via Mersin 10, TurkeyData allocation problem (DAP) is of great importance in distributed database systems (DDS). Minimizing the total cost of transactions and queries is the main objective of DAP which is mostly affected by the volume of transmitting data through the system. On the other hand, the volume of transmitting data depends on the fragment-to-site allocations method. DAP as a Np-hard problem has been widely solved by applying soft computing methods like evolutionary algorithms. In the continuation of our previously published research, this paper proposes a novel hybrid method based on Simulated Annealing Algorithm (SA) and Variable Neighborhood Search (VNS) mechanism for Solving DAP. To increase the performance, VNS mechanism is embedded into SA method in the proposed hybrid method. Technically speaking, in order to discover more promising parts of search space, the proposed method (VNSA) explores the search space via SA and fulfills more exploitation by applying neighborhood search mechanism. Moreover, due to the fact that both are a single solution-based method, they explore the search space faster than population-based methods. Performance of the proposed VNSA is experimentally evaluated using well-known benchmarks reported in state-of-the-art literature, and evaluation outcomes prove the robustness and fastness of the proposed hybrid method (VNSA). Furthermore, the results exhibit that VNSA outperforms its competitors and achieves better results in majority of test problems.http://www.math.md/files/csjm/v29-n2/v29-n2-(pp184-205).pdfdata allocation problemsimulated annealingvariable neighborhood search |
| spellingShingle | Nasser Lotfi Jamshid Tamouk A Hybrid Method based on SA and VNS Algorithms for Solving DAP in DDS Computer Science Journal of Moldova data allocation problem simulated annealing variable neighborhood search |
| title | A Hybrid Method based on SA and VNS Algorithms for Solving DAP in DDS |
| title_full | A Hybrid Method based on SA and VNS Algorithms for Solving DAP in DDS |
| title_fullStr | A Hybrid Method based on SA and VNS Algorithms for Solving DAP in DDS |
| title_full_unstemmed | A Hybrid Method based on SA and VNS Algorithms for Solving DAP in DDS |
| title_short | A Hybrid Method based on SA and VNS Algorithms for Solving DAP in DDS |
| title_sort | hybrid method based on sa and vns algorithms for solving dap in dds |
| topic | data allocation problem simulated annealing variable neighborhood search |
| url | http://www.math.md/files/csjm/v29-n2/v29-n2-(pp184-205).pdf |
| work_keys_str_mv | AT nasserlotfi ahybridmethodbasedonsaandvnsalgorithmsforsolvingdapindds AT jamshidtamouk ahybridmethodbasedonsaandvnsalgorithmsforsolvingdapindds AT nasserlotfi hybridmethodbasedonsaandvnsalgorithmsforsolvingdapindds AT jamshidtamouk hybridmethodbasedonsaandvnsalgorithmsforsolvingdapindds |