Efficient Heuristic Based Methods for Two-Stage Transshipment Problem
Efficient Heuristic Based Methods for Two-Stage Transshipment Problem作者机构：Industrial and Management Engineering Department IIT Kanpur Kanpur India
出 版 物：《American Journal of Operations Research》 (美国运筹学期刊（英文）)
年 卷 期：2018年第8卷第4期
页 面：281-293页
学科分类：1002[医学-临床医学] 100214[医学-肿瘤学] 10[医学]
主 题：Two Stage Transshipment Problem Min Cost Flow Transportation Problem Dual Primal
摘 要：In this article, we propose efficient methods for solving two stage transshipment problems. Transshipment problem is the special case of Minimum cost flow problem in which arc capacities are infinite. We start by proposing a novel problem formulation for a two stage transshipment problem. Later, special structure of our problem formulation is utilized to devise two dual based heuristics solutions with computational complexity of O (n2), and O (n3) respectively. These methods are motivated by the methods developed by Sharma and Saxena [1], Sinha and Sharma [2]. Our methods differ in the initialization and the subsequent variation of the dual variables associated with the transshipment nodes along the shortest path. Lastly, a method is proposed to extract a very good primal solution from the given dual solutions with a computational complexity of O (n2). Efficacy of these methods is demonstrated by our numerical analysis on 200 random problems.
维普期刊数据库