کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9651006 | 666027 | 2005 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A hybrid search algorithm with heuristics for resource allocation problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
The resource allocation problem is to allocate resources to activities so that the cost becomes as optimal as possible. In this paper, a hybrid search algorithm with heuristics for resource allocation problem encountered in practice is proposed. The proposed algorithm has both the advantages of genetic algorithm (GA) and ant colony optimization (ACO) that can explore the search space and exploit the best solution. In our implementation, both GA and ACO are well designed for the resource allocation problem. Furthermore, heuristics are used to ameliorate the search performance for resource allocation problem. Simulation results were reported and the proposed algorithm indeed have admirable performance for tested problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 173, Issues 1â3, 16 June 2005, Pages 155-167
Journal: Information Sciences - Volume 173, Issues 1â3, 16 June 2005, Pages 155-167
نویسندگان
Zne-Jung Lee, Chou-Yuan Lee,