A novel global harmony search algorithm for task assignment problem

Zou, D, Gao, L, Li, S, Wu, J and Wang, X 2010, 'A novel global harmony search algorithm for task assignment problem', Journal of Systems and Software, vol. 83, no. 10, pp. 1678-1688.


Document type: Journal Article
Collection: Journal Articles

Title A novel global harmony search algorithm for task assignment problem
Author(s) Zou, D
Gao, L
Li, S
Wu, J
Wang, X
Year 2010
Journal name Journal of Systems and Software
Volume number 83
Issue number 10
Start page 1678
End page 1688
Total pages 11
Publisher Elsevier Inc.
Abstract The objective of task assignment problem (TAP) is to minimize the sum of interprocessor communication and task processing costs for a distributed system which subjects to several resource constraints. We use a novel global harmony search algorithm (NGHS) to solve this problem, and the NGHS algorithm has demonstrated higher efficiency than the improved harmony search algorithm (IHS) on finding the near optimal task assignment. We also devise a new method called normalized penalty function method to tradeo® the costs and the constraints. A large number of experiments show that our algorithm performs well on finding the near optimal task assignment, and it is a viable approach for the task assignment problem.
Subject Optimisation
Keyword(s) Function method
Improved harmony search algorithm
Normalized penalty
Novel global harmony search algorithm
Task assignment problem
DOI - identifier 10.1016/j.jss.2010.04.070
Copyright notice © 2010 Elsevier Inc
ISSN 01641212
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 45 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 47 times in Scopus Article | Citations
Altmetric details:
Access Statistics: 265 Abstract Views  -  Detailed Statistics
Created: Fri, 25 May 2012, 12:57:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us