Limitation and modification: On a cost pipeline trade-off in a transportation problem

Authors

  • Sanchita Sharma Indira Gandhi Delhi Technical University for Women, Department of Applied Sciences and Humanities, Kashmere Gate, Delhi, India
  • Shalini Arora Indira Gandhi Delhi Technical University for Women, Department of Applied Sciences and Humanities, Kashmere Gate, Delhi, India

DOI:

https://doi.org/10.2298/YJOR160512021S

Keywords:

transportation problem, combinatorial optimization, bottleneck transportation problem, bi-criteria transportation problem, efficient points

Abstract

The present paper attempts to foreground a modified approach to the algorithm as conceived by Sharma et al. [1] in the paper entitled ’A cost and pipeline trade-off in a transportation problem’. In 2013, Sharma et al. [1] came up with an idea of pivotal time and consequentially evolved a convergent algorithm to determine cost pipeline trade off pairs corresponding to the chosen pivotal time. We have observed one limitation of the proposed algorithm which directly affects the global minimum character of the pipeline. In the present paper, we suggest a modification of the limitation found in the procedural formulation developed by Sharma et al. [1].

References

Sharma, V., Malhotra, R., and Verma, V., “A cost and pipeline trade-off in a transportation problem,” Yugoslav Journal on Operational Research, 23 (2) (2013) 197-211.

Downloads

Published

2017-11-01

Issue

Section

Research Articles