Geodesic
A Priority Based Time Minimization Transportation Problem
Yugoslav journal of operations research, Tome 28 (2018) no. 2, p. 219 .

Voir la notice de l'article dans eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

This paper discusses a priority based time minimizing transportation problem in which destinations are prioritized so that the material is supplied, based upon the priorities of the destinations. All the destinations, which are at priority, are served first in Stage-I while the demands of the secondary destinations are met in Stage-II. It is assumed that secondary transportation can not take place until the primary transportation is done. The purpose is to transport in such a manner that the sum of the transportation time of primary and secondary destinations is minimum. To achieve this, two approaches are proposed. In the first approach, primary destinations are served optimally by giving weights while in the second approach, lexicographic optimization is used. From the generated pairs, the minimum sum of times corresponding to Stage-I and Stage-II times is picked up as the optimal solution. It is also shown, through Computational Details, that the lexicographic optimization converges to the optimal solution faster than the first approach as reported in Table 4.
Classification : 90B85, 90C26
Mots-clés : Time Minimizing Transportation Problem (TMTP), Non Linear Programming(NLP) , Lexicographic Solution 
@article{YJOR_2018_28_2_a4,
     author = {Bindu Kaushal and Shalini Arora},
     title = {A {Priority} {Based} {Time} {Minimization} {Transportation} {Problem}},
     journal = {Yugoslav journal of operations research},
     pages = {219 },
     publisher = {mathdoc},
     volume = {28},
     number = {2},
     year = {2018},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/item/YJOR_2018_28_2_a4/}
}
TY  - JOUR
AU  - Bindu Kaushal
AU  - Shalini Arora
TI  - A Priority Based Time Minimization Transportation Problem
JO  - Yugoslav journal of operations research
PY  - 2018
SP  - 219 
VL  - 28
IS  - 2
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/YJOR_2018_28_2_a4/
LA  - en
ID  - YJOR_2018_28_2_a4
ER  - 
%0 Journal Article
%A Bindu Kaushal
%A Shalini Arora
%T A Priority Based Time Minimization Transportation Problem
%J Yugoslav journal of operations research
%D 2018
%P 219 
%V 28
%N 2
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/YJOR_2018_28_2_a4/
%G en
%F YJOR_2018_28_2_a4
Bindu Kaushal; Shalini Arora. A Priority Based Time Minimization Transportation Problem. Yugoslav journal of operations research, Tome 28 (2018) no. 2, p. 219 . https://geodesic-test.mathdoc.fr/item/YJOR_2018_28_2_a4/