中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
An upper bound on the minimal total cost of the transportation problem with varying demands and supplies

文献类型:期刊论文

作者Xie, Fanrong1,2; Butt, Muhammad Munir3; Li, Zuoan1; Zhu, Linzhi2
刊名OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
出版日期2017-04-01
卷号68页码:105-118
关键词Genetic algorithms Transportation problem Transportation problem with varying demands and supplies Bounds on the minimal total cost Upper bound on the minimal total cost
ISSN号0305-0483
DOI10.1016/j.omega.2016.06.007
英文摘要In general cases, to find the exact upper bound on the minimal total cost of the transportation problem with varying demands and supplies is an NP-hard problem. In literature, there are only two approaches with several shortcomings to solve the problem. In this paper, the problem is formulated as a bi-level programming model, and proven to be solvable in a polynomial time if the sum of the lower bounds for all the supplies is no less than the sum of the upper bounds for all the demands; and a heuristic algorithm named TPVDS-A based on genetic algorithm is developed as an efficient and robust solution method of the model. Computational experiments on benchmark and new randomly generated instances show that the TPVDS-A algorithm outperforms the two existing approaches. (C) 2016 Elsevier Ltd. All rights reserved.
资助项目State Key Laboratory of Scientific and Engineering Computing, Chinese Academy of Sciences (CAS) ; 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 under Grant GanJiaoGaoZi[[2004] 100Hao] ; Science Foundation of Nanchang University[04Z02914]
WOS研究方向Business & Economics ; Operations Research & Management Science
语种英语
WOS记录号WOS:000392565500009
出版者PERGAMON-ELSEVIER SCIENCE LTD
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/24603]  
专题中国科学院数学与系统科学研究院
通讯作者Xie, Fanrong
作者单位1.Sichuan Univ Sci & Engn, Sch Sci, Zigong 643000, Peoples R China
2.Nanchang Univ, Dept Math, Nanchang 330031, Jiangxi, Peoples R China
3.Chinese Acad Sci, Inst Computat Math & Sci Engn Comp, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Xie, Fanrong,Butt, Muhammad Munir,Li, Zuoan,et al. An upper bound on the minimal total cost of the transportation problem with varying demands and supplies[J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE,2017,68:105-118.
APA Xie, Fanrong,Butt, Muhammad Munir,Li, Zuoan,&Zhu, Linzhi.(2017).An upper bound on the minimal total cost of the transportation problem with varying demands and supplies.OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE,68,105-118.
MLA Xie, Fanrong,et al."An upper bound on the minimal total cost of the transportation problem with varying demands and supplies".OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 68(2017):105-118.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。