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: | Nasser Lotfi, Jamshid Tamouk |
---|---|
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 |
Similar Items
-
Hybrid Variable Neighborhood and Simulated Annealing Heuristic Algorithm to Solve RCPSP
by: Juan Carlos Rivera, et al.
Published: (2013-02-01) -
A new variable neighborhood search approach for solving dynamic memory allocation problem
by: Ivanović Marija, et al.
Published: (2018-01-01) -
Metaheuristic approaches to solving large-scale Bilevel Uncapacitated Facility Location Problem with clients' preferences
by: Marić Miroslav, et al.
Published: (2015-01-01) -
Hybrid Algorithms for Inbound and Outbound Truck Scheduling in Cross-Docking Systems
by: Gen-Han Wu, et al.
Published: (2022-10-01) -
Two-Stage Metaheuristic Algorithms for Order-Batching and Routing Problems
by: Gen-Han Wu, et al.
Published: (2022-10-01)