期刊
COMPUTERS & OPERATIONS RESEARCH
卷 86, 期 -, 页码 124-139出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2017.05.003
关键词
Transportation; Transportation problem; Hierarchical optimization; Polynomial algorithm; Network with lower and upper arc capacities
类别
资金
- State Key Laboratory of Scientific and Engineering Computing, Chinese Academy of Sciences (CAS)
- Scientific Research Foundation for Talent Introduction in Sichuan University of Science and Engineering [2016RCL32]
- Natural Science Foundation of Jiangxi Province [20151BAB201022, 2010GZS0151]
- National Natural Science Foundation of China [71261018]
- Jiangxi Provincial Advanced Education Reform Project [JXJG-04-1-69]
- Science Foundation of Nanchang University [04Z02914]
The THTMTP (two-level hierarchical time minimization transportation problem) is an important problem arising in industries. In literature, there are only two approaches with shortcomings to solve the problem. In this paper, the THTMTP is formulated as a mathematical model applicable to the case in which the total available supply at the sources is no less than the total demand at the destinations. A feasible flow-based iterative algorithm named THTMTP-A is proposed to solve the THTMTP by constructing network with lower and upper arc capacities. It is proved that the THTMTP-A algorithm can find the optimal solution to the THTMTP in a polynomial time. The proposed THTMTP-A algorithm has good performance in terms of computer implementation, computational time and required memory for computation, and hence overcomes successfully the shortcomings of the two existing approaches. Computational experiments validate that the THTMTP-A algorithm is an efficient and robust method to solve the THTMTP, and can serve as efficient tool to solve other related optimization problems. (C) 2017 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据