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

مشکل طراحی شبکه نیرومند تک کالایی: پیچیدگی، نمونه و راه حل های ابتکاری

کد مقاله سال انتشار مقاله انگلیسی ترجمه فارسی تعداد کلمات
70517 2014 13 صفحه PDF سفارش دهید محاسبه نشده
خرید مقاله
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.
عنوان انگلیسی
Single-commodity robust network design problem: Complexity, instances and heuristic solutions
منبع

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

Journal : European Journal of Operational Research, Volume 238, Issue 3, 1 November 2014, Pages 711–723

کلمات کلیدی
نیرومندی؛ طراحی شبکه؛ پیچیدگی؛ ابتکاری؛ جستجو نزدیکی
پیش نمایش مقاله
پیش نمایش مقاله مشکل طراحی شبکه نیرومند تک کالایی: پیچیدگی، نمونه و راه حل های ابتکاری

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

We study a single-commodity Robust Network Design problem (RND) in which an undirected graph with edge costs is given together with a discrete set of balance matrices, representing different supply/demand scenarios. In each scenario, a subset of the nodes is exchanging flow. The goal is to determine the minimum cost installation of capacities on the edges such that the flow exchange is feasible for every scenario. Previously conducted computational investigations on the problem motivated the study of the complexity of some special cases and we present complexity results on them, including hypercubes. In turn, these results lead to the definition of new instances (random graphs with {−1, 0, 1} balances) that are computationally hard for the natural flow formulation. These instances are then solved by means of a new heuristic algorithm for RND, which consists of three phases. In the first phase the graph representing the network is reduced by heuristically deleting a subset of the arcs, and a feasible solution is built. The second phase consists of a neighborhood search on the reduced graph based on a Mixed-Integer (Linear) Programming (MIP) flow model. Finally, the third phase applies a proximity search approach to further improve the solution, taking into account the original graph. The heuristic is tested on the new instances, and the comparison with the solutions obtained by Cplex on a natural flow formulation shows the effectiveness of the proposed method.

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