arrow
返回

Single-commodity robust network design problem: Complexity, instances and heuristic solutions

delete2014-11-01
delete9
delete
OA
AI
E
Eduardo Álvarez‐Miranda
V
Valentina Cacchiani
A
Andrea Lodi *
T
Tiziano Parriani
D
Daniel R. Schmidt
DOI:10.1016/j.ejor.2014.04.023delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
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. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Robustness
Network design
Complexity
Heuristic
Proximity search
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

European Journal of Operational Research 封面图
European Journal of Operational Research
IF:
6
论文数:
2.2W
被引数:
6.4W

机构

U
University of Cologne
学者数:
3.0W
论文数: 2.1W
被引数: 2.4W
U
universidad de talca
学者数:
2.5K
论文数: 2.4K
被引数: 1
U
University of Bologna
学者数:
4.5W
论文数: 3.8W
被引数: 4.1W
学者 查看更多机构
引用论文

引用论文

Personality of patients with pseudoseizures
err1986-05-01
err0
PREAI
errC. W. Vanderzant; B. Giordani; S. Berent; F. E. Dreifuss; J. C. Sackellares
err分享
err收藏
The Knowledge Level and Opinions of Physicians about the Medical and Legal Procedures Related to Physical Child Abuse
err2017-04-04
err0
errOAAI
errSema Demirçin; Akın Tütüncüler; Fatmagül Aslan; Sevtap Velipaşaoğlu Güney; Mehmet Atılgan; Hakan Gülkesen
err分享
err收藏
err分享
err收藏
Selective and Sensitive LC-MS Determination of Avenanthramides in Oats
err2006-04-26
err0
PREAI
errJ. Jastrebova; M. Skoglund; J. Nilsson; L. H. Dimberg
err分享
err收藏
学者 查看更多内容