کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6894539 | 1445925 | 2018 | 36 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A minmax regret version of the time-dependent shortest path problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A minmax regret version of the time-dependent shortest path problem A minmax regret version of the time-dependent shortest path problem](/preview/png/6894539.png)
چکیده انگلیسی
We consider a shortest path problem where the arc costs depend on their relative position on the given path and there exist uncertain cost parameters. We study a minmax regret version of the problem under different types of uncertainty of the involved parameters. First, we provide a Mixed Integer Linear Programming (MILP) formulation by using strong duality in the uncertainty interval case. Second, we develop three algorithms based on Benders decomposition for general polyhedral sets of uncertainty. In order to make the algorithms faster we use constant factor approximations to initialize them. Finally, we report some computational experiments for different uncertainty sets in order to compare the behavior of the proposed algorithms.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 270, Issue 3, 1 November 2018, Pages 968-981
Journal: European Journal of Operational Research - Volume 270, Issue 3, 1 November 2018, Pages 968-981
نویسندگان
Eduardo Conde, Marina Leal, Justo Puerto,