A Cost and Pipeline Trade-Off in a Transportation Problem
Yugoslav journal of operations research, Tome 23 (2013) no. 2, p. 197
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
The present paper deals with a trade off between cost and pipeline at
a given time in a transportation problem. The time lag between commissioning a
project and the time when the last consignment of goods reaches the project site
is an important factor. This motivates the study of a bi-criteria transportation
problem at a pivotal time T . An exhaustive set E of all independent cost-pipeline
pairs (called efficient pairs) at time T is constructed in such a way that each pair
corresponds to a basic feasible solution and in turn, gives an optimal transportation
schedule. A convergent algorithm has been proposed to determine non-dominated
cost pipeline pairs in a criteria space instead of scanning the decision space, where
the number of such pairs is large as compared to those found in the criteria space.
Classification :
90B06, 90C05, 90C08
Keywords: Transportation problem, Combinatorial optimization, Bottleneck Transportation problem, Bi-criteria transportation problem, Efficient points
Keywords: Transportation problem, Combinatorial optimization, Bottleneck Transportation problem, Bi-criteria transportation problem, Efficient points
@article{YJOR_2013_23_2_a4,
author = {Vikas Sharma and Rita Malhotra and Vanita Verma},
title = {A {Cost} and {Pipeline} {Trade-Off} in a {Transportation} {Problem}},
journal = {Yugoslav journal of operations research},
pages = {197 },
year = {2013},
volume = {23},
number = {2},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2013_23_2_a4/}
}
Vikas Sharma; Rita Malhotra; Vanita Verma. A Cost and Pipeline Trade-Off in a Transportation Problem. Yugoslav journal of operations research, Tome 23 (2013) no. 2, p. 197 . http://geodesic.mathdoc.fr/item/YJOR_2013_23_2_a4/