کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4959340 | 1445946 | 2017 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs](/preview/png/4959340.png)
چکیده انگلیسی
We introduce Adaptive Kernel Search (AKS), a heuristic framework for the solution of (general) Mixed Integer linear Programs (MIPs). AKS extends and enhances Kernel Search, a heuristic framework that has been shown to produce high-quality solutions for a number of specific (combinatorial) optimization problems in a short amount of time. AKS solves a sequence of carefully constructed restricted MIPs (using a commercial MIP solver). The computational effort required to solve the first restricted MIP guides the construction of the subsequent MIPs. The restricted MIPs are constructed around a kernel, which contains the variables that are presumably non-zero in an optimal solution. Computational results, for a set of 137 instances, show that AKS significantly outperforms other state-of-the-art heuristics for solving MIPs. AKS also compares favorably to CPLEX and offers more flexibility to trade-off solution quality and computing time.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 263, Issue 3, 16 December 2017, Pages 789-804
Journal: European Journal of Operational Research - Volume 263, Issue 3, 16 December 2017, Pages 789-804
نویسندگان
G. Guastaroba, M. Savelsbergh, M.G. Speranza,