Title: Optimising uncertain bottleneck-cost integer transportation problems with beta distributed shipping times

Authors: A. Akilbasha; G. Natarajan

Addresses: School of Mathematics and Statistics, Dr. Vishwanath Karad MIT World Peace University, Pune-411 038, Maharashtra, India ' Department of Mathematics, School of Advanced Sciences, VIT, Vellore-14, Tamil Nadu, India

Abstract: A novel method namely, the reductive most-least method is developed to optimise the bottleneck integer transportation problem, which is different from the existing methods. It is a fairly simple approach method too. An uncertain BIT problem in which shipping times follow beta distribution is studied. The time for completion of the expected transportation for the uncertain BIT problem is determined, and statistical analysis on the transportation completion time of the considering problem is carried out. Further, an uncertain bottleneck-cost integer transportation problem with beta distributed shipping times is presented, and a new method namely, the cost-reductive most-least method is proposed to determine efficient solutions for the expected uncertain BCIT problem having beta distributed shipping times and the transportation completion time of the uncertain BCIT problem with statistical analysis.

Keywords: bottleneck transportation problem; reductive most least method; minimum transportation completion time; beta distributed shipping times; cost-reductive most-least method; statistical analysis.

DOI: 10.1504/IJSTL.2023.132663

International Journal of Shipping and Transport Logistics, 2023 Vol.17 No.1/2, pp.146 - 163

Received: 24 May 2021
Accepted: 09 Mar 2022

Published online: 07 Aug 2023 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article