Transportation Time Minimization: An Algorithmic Approach

Please use this identifier to cite or link to this item: http://inet.vidyasagar.ac.in:8080/jspui/handle/123456789/871

Full metadata record

DC Field	Value	Language
dc.contributor.author	Sharif Uddin, M
dc.date.accessioned	2016-12-22T17:26:46Z	-
dc.date.available	2016-12-22T17:26:46Z	-
dc.date.issued	2012
dc.identifier.issn	0972-8791 (Print)
dc.identifier.uri	http://inet.vidyasagar.ac.in:8080/jspui/handle/123456789/871	-
dc.description	59-64	en_US
dc.description.abstract	In this paper, a transportation algorithm is applied to determine the minimum transportation time. The algorithm determines the Initial Basic Feasible Solution (IBFS) of Transportation Problem (TP) to minimize time. Herein, the Distribution Indicators (DI) is calculated by the difference of the greatest time unit and the nearest-to-the-greatest time unit. Then the least entry of the Transportation Table (TT) along the highest DI is taken as the basic cell. The result with an elaborate illustration demonstrates that the method presented here is effective in minimizing the transportation time.	en_US
dc.language.iso	en_US	en_US
dc.publisher	Vidyasagar University , Midnapore , West-Bengal , India	en_US
dc.relation.ispartofseries	Journal of Physical Science;Vol 16 [2012]
dc.subject	Transportation problem	en_US
dc.subject	optimization	en_US
dc.title	Transportation Time Minimization: An Algorithmic Approach	en_US
dc.type	Article	en_US
Appears in Collections:	Journal of Physical Sciences Vol.16 [2012]

Files in This Item:

File	Description	Size	Format
JPS-V16-6.pdf		107.1 kB	Adobe PDF	View/Open

DSpace JSPUI