Abstract
In practical world applications, the time minimizing transportation problem provides a powerful framework for determining better ways for timely delivery of goods to consumers. In this article, we propose a shootout method to determine the optimum time of transportation for the time minimizing transportation problem with mixed constraints. The proposed problem is a variant of the time minimizing transportation problem in which constraints are of mixed nature. The cells of the transportation table with decreasing order of time are avoided for allocation one by one until feasibility is maintained. The method is structured in the form of an algorithm and computationally tested on MATLAB through problems of various sizes. It solves the time minimizing transportation problem with equality constraints also.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: American Journal of Mathematical and Management Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
