دانلود مقاله ISI انگلیسی شماره 70416
عنوان فارسی مقاله

مشکل طراحی شبکه survivable هاپ محدود با لبه های قابل اعتماد

کد مقاله سال انتشار مقاله انگلیسی ترجمه فارسی تعداد کلمات
70416 2015 9 صفحه PDF سفارش دهید محاسبه نشده
خرید مقاله
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.
عنوان انگلیسی
On the hop-constrained survivable network design problem with reliable edges
منبع

Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)

Journal : Computers & Operations Research, Volume 64, December 2015, Pages 159–167

کلمات کلیدی
طراحی شبکه؛ Survivability؛ محدودیت هاپ؛ تجزیه Benders؛ الگوریتم شاخه و برش
پیش نمایش مقاله
پیش نمایش مقاله مشکل طراحی شبکه survivable هاپ محدود با لبه های قابل اعتماد

چکیده انگلیسی

In this paper, we study the hop-constrained survivable network design problem with reliable edges. Given a graph with non-negative edge costs and node pairs Q, the hop-constrained survivable network design problem consists of constructing a minimum cost set of edges so that the induced subgraph contains at least K edge-disjoint paths containing at most L edges between each pair in Q. In addition, we consider here a subset of reliable edges that are not subject to failure. We study two variants: a static problem where the reliability of edges is given, and an upgrading problem where edges can be upgraded to the reliable status at a given cost. We adapt for the two variants an extended formulation proposed in Botton, Fortz, Gouveia, Poss (2011) [1] for the case without reliable edges. As before, we use Benders decomposition to accelerate the solving process. Our computational results indicate that these two variants appear to be more difficult to solve than the original problem (without reliable edges). We conclude with an economical analysis which evaluates the incentive of using reliable edges in the network.

خرید مقاله
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.