An efficient procedure to determine the initial basic feasible solution of time minimization transportation problem

Aminur Rahman Khan, Adrian Vilcu, Md Sharif Uddin, Cristiana Istrate

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

To meet the challenge of delivering products to the customers in a minimum time, Time Minimization Transportation Problem (TMTP) provides a powerful framework to determine the better ways to deliver products to the customer. In this paper, we present a new procedure for determining an initial basic feasible solution of TMTP. Comparative study is accomplished between the presented procedure and the other existing procedures in virtue of sample examples which demonstrate that the presented procedure requires less number of iterations to reach the optimal transportation time.

Original languageEnglish
Title of host publicationExploring Services Science - 7th International Conference, IESS 2016, Proceedings
EditorsHenriqueta Nóvoa, Theodor Borangiu, Monica Drăgoicea
PublisherSpringer Verlag
Pages201-212
Number of pages12
ISBN (Print)9783319326887
DOIs
StatePublished - 2016
Externally publishedYes
Event7th International Conference on Exploring Services Science, IESS 2016 - Bucharest, Romania
Duration: 25 May 201627 May 2016

Publication series

NameLecture Notes in Business Information Processing
Volume247
ISSN (Print)1865-1348

Conference

Conference7th International Conference on Exploring Services Science, IESS 2016
Country/TerritoryRomania
CityBucharest
Period25/05/1627/05/16

Keywords

  • Feasible solution
  • Optimum solution
  • Pointer cost
  • Time minimization transportation problem

Fingerprint

Dive into the research topics of 'An efficient procedure to determine the initial basic feasible solution of time minimization transportation problem'. Together they form a unique fingerprint.

Cite this