Incremental network design with shortest paths

被引：38
|
作者：
Baxter, Matthew [1 ]
Elgindy, Tarek [1 ]
Ernst, Andreas T. [1 ]
Kalinowski, Thomas [2 ]
Savelsbergh, Martin W. P. [2 ]
机构：
[1] CSIRO, CSIRO Math Informat & Stat, Canberra, ACT, Australia
[2] Univ Newcastle, Callaghan, NSW 2308, Australia
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2014年 / 238卷 / 03期
关键词：
Network design; Multi-period; Heuristic; Approximation algorithm; Integer programming; INFRASTRUCTURE SYSTEMS; RESTORATION;
D O I：
10.1016/j.ejor.2014.04.018
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
We introduce a class of incremental network design problems focused on investigating the optimal choice and timing of network expansions. We concentrate on an incremental network design problem with shortest paths. We investigate structural properties of optimal solutions, show that the simplest variant is NP-hard, analyze the worst-case performance of natural greedy heuristics, derive a 4-approximation algorithm, and conduct a small computational study. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码：675 / 684
页数：10
相关论文
共 50 条
  • [41] ON ORIENTATIONS AND SHORTEST PATHS
    HASSIN, R
    MEGIDDO, N
    LINEAR ALGEBRA AND ITS APPLICATIONS, 1989, 114 : 589 - 602
  • [42] 3 ALGORITHMS FOR CALCULATING SOME OR ALL OF SHORTEST PATHS IN A SPARSE NETWORK
    WHITAKER, RA
    GEOGRAPHICAL ANALYSIS, 1977, 9 (03) : 266 - 277
  • [43] The K shortest transit paths choosing algorithm in stochastic transit network
    Zhao, Liyuan
    Xiong, Yiliang
    Sun, Hong
    ROUGH SETS AND KNOWLEDGE TECHNOLOGY, 2008, 5009 : 747 - +
  • [44] COMPUTATIONAL EXPERIENCE WITH AN ALGORITHM FOR FINDING K-SHORTEST PATHS IN A NETWORK
    SHIER, DR
    JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1974, B 78 (03): : 139 - 165
  • [45] RETRACTED: Shortest paths in a lattice network: a comparative study (Retracted Article)
    Ibrahim, IA
    Selim, SM
    COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (11) : 1131 - 1139
  • [46] K-shortest paths and minimum spanning tree in traffic network
    Chen, J.-R. (chenjr@mail.lzjtu.cn), 1600, Editorial Department of Journal of Chang'an University (Natural Science Edition) (34):
  • [47] Finding K shortest looping paths in a traffic-light network
    Yang, HH
    Chen, YL
    COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (03) : 571 - 581
  • [48] Finding the K shortest paths in a schedule-based transit network
    Xu, Wangtu
    He, Shiwei
    Song, Rui
    Chaudhry, Sohail S.
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (08) : 1812 - 1826
  • [49] Finding the first K shortest paths in a time-window network
    Chen, YL
    Yang, HH
    COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (04) : 499 - 513
  • [50] INFINITE PATHS THAT CONTAIN ONLY SHORTEST PATHS
    WATKINS, ME
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1986, 41 (03) : 341 - 355
12345