Hybrid Meta-heuristic Algorithm for Task Assignment Problem
Publish Year: 1389
نوع سند: مقاله ژورنالی
زبان: English
View: 355
This Paper With 11 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JOIE-4-7_006
تاریخ نمایه سازی: 22 آبان 1397
Abstract:
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a heterogeneous distributed computing system. To compare our algorithm with previous ones, an extensive computational study on some benchmark problems was conducted. The results obtained from the computational study indicate that the proposed algorithm is a viable and effective approach for the TAP
Keywords:
Task assignment problem , Heterogeneous distributed systems , Hybrid meta-heuristic , Simulated annealing algorithm , Variable neighbourhood search algorithm
Authors
Mohammad Jafar Tarokh
Associate Professor, Department of Industrial Engineering, K.N. Toosi University of Technology, Tehran, Iran
Mehdi Yazdani
Instructor, Department of industrial engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
Mani Sharifi
Assistant Professor, Department of industrial engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
Mohammad Navid Mokhtarian
PHD Student, Department of industrial engineering, Science and research Branch, Islamic Azad University, Tehran, Iran