کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
303517 | 512745 | 2011 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The large scale maximal covering location problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی عمران و سازه
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The maximal covering location problem (MCLP) is a challenging problem with numerous applications in practice. Previous publications in the area of MCLP proposed models and presented solution methodologies to solve this problem with up to 900 nodes. Due to the fact that in real-life applications, the number of nodes could be much higher, this paper presents a customized Genetic Algorithm (GA) to solve MCLP instances, with up to 2500 nodes. Results show that the proposed approach is capable of solving problems with a fair amount of exactness. In order to fine-tune the algorithm, Tukey’s Least Significant Difference (LSD) tests are employed on a set of test problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Scientia Iranica - Volume 18, Issue 6, December 2011, Pages 1564–1570
Journal: Scientia Iranica - Volume 18, Issue 6, December 2011, Pages 1564–1570
نویسندگان
M.H. Fazel Zarandi, S. Davari, S.A. Haddad Sisakht,