Abstract
In this paper, we propose a hybrid method to solve a special version of task allocation problems. This hybrid method combines Tabu search for finding local optimal solutions and noising method for diversifying the search scheme to solve this problem. An experiment is conducted to test the hybrid method against other methods. Experimental results indicate that the hybrid method is efficient so far as the run time is concerned. Besides, it produced much better solutions. Out of 30 problem instances, the hybrid method obtained 23 best solutions for total cost and 27 for fixed cost among the tested algorithms. Scope and purpose This paper considers the problem of assigning tasks to processors such that the communication cost among the processors and the fixed costs of the processors are minimized. A hybrid method is proposed to solve this problem by combining Tabu search and noising method. The proposed hybrid method is proved to outperform the random method, Tabu search, noising method, and HBM algorithm in terms of run time and the quality of solutions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
