A New Algorithm for Bottleneck Transportation Problem
Bhabani Mallia1, Manjula Das2, Chakradhar Das3

1Bhabani Mallia, M. Phil., Utkal University, Bhubaneswar (Odisha), India.

2Manjula Das, Professor, Centre for Applied Mathematics & Computing, SOA deemed to be University, Bhubaneswar (Odisha), India.

3Chakradhar Das, Professor, National Institute of Information Technology, Rourkela,  India.

Manuscript received on 20 June 2019 | Revised Manuscript received on 27 June 2019 | Manuscript Published on 22 June 2019 | PP: 419-423 | Volume-8 Issue-8S2 June 2019 | Retrieval Number: H10760688S219/19©BEIESP

Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: We have considered Bottleneck Transportation problem. These problem has significant importance in military operation and catastrophe situation, in both cases time factor very important for supplying amenities/ essential commodities to the destination point. Bottleneck Transportation Problem mathematically formulated with usual type of transportation constraints. We have designed an algorithm to find the optimal solution, numerical examples are illustrated and comparative study has been given. The paper has significant implication in other verity of Linear Programming Problem, for example minimax and maximin assigned problems. It has also significant implication in present day e-commerce, cargo loading and delivery in air transport.

Keywords: Bottleneck Problems, Bottleneck Transportation Problem, Initial Solution, Maxmin , Minimax, Pseudo Cost, Worse Case Analysis.
Scope of the Article: Parallel and Distributed Algorithms