کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
381633 | 1437512 | 2006 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Solving terminal assignment problems with groups encoding: The wedding banquet problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper presents an extension of the terminal assignment problem (TA) in the case that groups of terminals must be assigned together. We analyze this situation by means of an equivalent problem: the wedding banquet problem (WBP). We provide a description of the problem and its mathematical definition. We also describe an application of the WBP to mobile communications network design. Two hybrid metaheuristics algorithms for the WBP are presented in the paper. We test their performance in several computational experiments, including synthetic instances of the WBP, and a mobile network design application.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Engineering Applications of Artificial Intelligence - Volume 19, Issue 5, August 2006, Pages 569–578
Journal: Engineering Applications of Artificial Intelligence - Volume 19, Issue 5, August 2006, Pages 569–578
نویسندگان
Sancho Salcedo-Sanz, José A. Portilla-Figueras, Fernando García-Vázquez, Silvia Jiménez-Fernández,