Minimum cost time-varying network flow problems

被引：18
|
作者：
Nasrabadi, Ebrahim [1 ]
Hashemi, S. Mehdi [1 ]
机构：
[1] Amirkabir Univ Technol, Dept Comp Sci, Tehran, Iran
来源：
OPTIMIZATION METHODS & SOFTWARE | 2010年 / 25卷 / 03期
关键词：
network flows; time-varying networks; shortest dynamic path; minimum cost dynamic flow; MAXIMAL DYNAMIC FLOWS; SHORTEST-PATH; ALGORITHMS;
D O I：
10.1080/10556780903239121
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
This paper deals with a general minimum cost dynamic flow problem in a discrete time model with time-varying transit times, transit costs, transit capacities, storage costs, and storage capacities. For this problem, an algorithm of time complexity O(V nT(n+T)) is presented, where V is an upper bound on the total supply, n is the number of nodes, and T denotes the given time horizon of the dynamic flow problem. The algorithm is a discrete-time version of the successive shortest path algorithm.
引用
收藏
页码：429 / 447
页数：19
相关论文
共 50 条
  • [1] Time-varying minimum cost flow problems
    Cai, X
    Sha, D
    Wong, CK
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 131 (02) : 352 - 374
  • [2] Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
    Khodayifar, Salman
    OPTIMIZATION LETTERS, 2021, 15 (03) : 1009 - 1026
  • [3] Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
    Salman Khodayifar
    Optimization Letters, 2021, 15 : 1009 - 1026
  • [4] Minimum flow problem on network flows with time-varying bounds
    Fathabadi, H. Salehi
    Khodayifar, S.
    Raayatpanah, M. A.
    APPLIED MATHEMATICAL MODELLING, 2012, 36 (09) : 4414 - 4421
  • [5] A time-varying neural network for solving minimum spanning tree problem on time-varying network
    Xu, Zhilei
    Huang, Wei
    Wang, Jinsong
    NEUROCOMPUTING, 2021, 466 : 139 - 147
  • [6] Delay constraint minimum cost routing algorithm for satellite time-varying network
    School of Electronics and Information Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100083, China
    Tien Tzu Hsueh Pao, 2006, 9 (1584-1589):
  • [7] A Time Impulse Neural Network Framework for Solving the Minimum Path Pair Problems of the Time-Varying Network
    Huang, Wei
    Wang, Yongqing
    Zhu, Liehuang
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (08) : 7681 - 7692
  • [8] Noisy Genetic Algorithm for Stochastic, Time-Varying Minimum Time Network Flow Problem
    Opasanon, Sathaporn
    Miller-Hooks, Elise
    TRANSPORTATION RESEARCH RECORD, 2010, (2196) : 75 - 82
  • [9] The maximum flow in a time-varying network
    Sha, D
    Cai, X
    Wong, CK
    OPTIMIZATION, 2000, 48 : 437 - 456
  • [10] Time-varying universal maximum flow problems
    Cai, X
    Sha, D
    Wong, CK
    MATHEMATICAL AND COMPUTER MODELLING, 2001, 33 (4-5) : 407 - 430
12345