کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
479069 | 1446191 | 2007 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem](/preview/png/479069.png)
چکیده انگلیسی
This paper deals with the Uncapacitated Single Allocation p-Hub Median Problem (USApHMP). Two genetic algorithm (GA) approaches are proposed for solving this NP-hard problem. New encoding schemes are implemented with appropriate objective functions. Both approaches keep the feasibility of individuals by using specific representation and modified genetic operators. The numerical experiments were carried out on the standard ORLIB hub data set. Both methods proved to be robust and efficient in solving USApHMP with up to 200 nodes and 20 hubs. The second GA approach achieves all previously known optimal solutions and achieves the best-known solutions on large-scale instances.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 182, Issue 1, 1 October 2007, Pages 15–28
Journal: European Journal of Operational Research - Volume 182, Issue 1, 1 October 2007, Pages 15–28
نویسندگان
Jozef Kratica, Zorica Stanimirović, Dušan Tošić, Vladimir Filipović,