LIMITATION AND MODIFICATION: ON A COST PIPELINE TRADE-OFF IN A TRANSPORTATION PROBLEM

  • Sanchita SHARMA Department of Applied Sciences and Humanities, Indira Gandhi Delhi Technical, University for Women, Kashmere Gate, Delhi, INDIA
  • Shalini ARORA Department of Applied Sciences and Humanities, Indira Gandhi Delhi Technical, University for Women, Kashmere Gate, Delhi, INDIA

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].


Keywords: Transportation problem, Combinatorial optimization, Bottleneck transportation problem, Bi-criteria transportation problem, Efficient points.

Published
Jan 23, 2017
How to Cite
SHARMA, Sanchita; ARORA, Shalini. LIMITATION AND MODIFICATION: ON A COST PIPELINE TRADE-OFF IN A TRANSPORTATION PROBLEM. Yugoslav Journal of Operations Research, [S.l.], v. 27, n. 4, p. 439–450, jan. 2017. ISSN 2334-6043. Available at: <http://yujor.fon.bg.ac.rs/index.php/yujor/article/view/118>. Date accessed: 16 dec. 2017.
Section
Articles