Optimising uncertain bottleneck-cost integer transportation problems with beta distributed shipping times Online publication date: Mon, 07-Aug-2023
by A. Akilbasha; G. Natarajan
International Journal of Shipping and Transport Logistics (IJSTL), Vol. 17, No. 1/2, 2023
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Shipping and Transport Logistics (IJSTL):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com