A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem

doi:10.1016/j.cor.2017.05.003

CSpace

	A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem
	Xie, Fanrong 1,2; Butt, Muhammad Munir 3,4; Li, Zuoan 1
	2017-10-01
发表期刊	COMPUTERS & OPERATIONS RESEARCH
ISSN	0305-0548
卷号	86 页码:124-139
摘要	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.
关键词	Transportation Transportation problem Hierarchical optimization Polynomial algorithm Network with lower and upper arc capacities
DOI	10.1016/j.cor.2017.05.003
语种	英语
资助项目	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] ; Natural Science Foundation of Jiangxi Province[2010GZS0151] ; National Natural Science Foundation of China[71261018] ; Jiangxi Provincial Advanced Education Reform Project[JXJG-04-1-69] ; Science Foundation of Nanchang University[04Z02914]
WOS研究方向	Computer Science ; Engineering ; Operations Research & Management Science
WOS类目	Computer Science, Interdisciplinary Applications ; Engineering, Industrial ; Operations Research & Management Science
WOS记录号	WOS:000404320000011
出版者	PERGAMON-ELSEVIER SCIENCE LTD
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/25869
专题	中国科学院数学与系统科学研究院
通讯作者	Xie, Fanrong
作者单位	1.Sichuan Univ Sci & Engn, Sch Math & Stat, Zigong 643000, Peoples R China 2.Nanchang Univ, Dept Math, Nanchang 330031, Jiangxi, Peoples R China 3.Univ Lahore, Dept Math, Lahore 54000, Pakistan 4.Chinese Acad Sci, Inst Computat Math & Sci Engn Comp, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Xie, Fanrong,Butt, Muhammad Munir,Li, Zuoan. A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem[J]. COMPUTERS & OPERATIONS RESEARCH,2017,86:124-139.
APA	Xie, Fanrong,Butt, Muhammad Munir,&Li, Zuoan.(2017).A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem.COMPUTERS & OPERATIONS RESEARCH,86,124-139.
MLA	Xie, Fanrong,et al."A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem".COMPUTERS & OPERATIONS RESEARCH 86(2017):124-139.