کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
483169 | 1446198 | 2007 | 18 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique](/preview/png/483169.png)
چکیده انگلیسی
This paper deals with the uncapacitated multiple allocation hub location problem. The dual problem of a four-indexed formulation is considered and a heuristic method, based on a dual-ascent technique, is designed. This heuristic, which is reinforced with several specifical subroutines and does not require any external linear problem solver, is the core tool embedded in an exact branch-and-bound framework. Besides, the heuristic provides the branch-and-bound algorithm with good lower bounds for the nodes of the branching tree. The results of the computational experience (with the classical CAB and AP data sets) are included, showing the great effectiveness of this approach: instances with up to 120 nodes are solved.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 179, Issue 3, 16 June 2007, Pages 990–1007
Journal: European Journal of Operational Research - Volume 179, Issue 3, 16 June 2007, Pages 990–1007
نویسندگان
Lázaro Cánovas, Sergio García, Alfredo Marín,