![](images/graphics/blank.gif)
Lexicographic solution
-
This paper discusses a priority based time minimizing transporation 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.
17p
danhnguyentuongvi27
19-12-2018
19
0
Download
-
This paper is aimed at studying the Time Minimizing Transportation Problem with Fractional Bottleneck Objective Function (TMTP-FBOF). TMTP-FBOF is related to a Lexicographic Fractional Time Minimizing Transportation Problem (LFTMTP), which will be solved by a lexicographic primal code. An algorithm is also developed to determine an initial efficient basic solution to this TMTP-FBOF. The developed TMTPFBOF Algorithm is supported by a real life example of Military Transportation Problem of Indian Army.
15p
vinguyentuongdanh
19-12-2018
19
0
Download
CHỦ ĐỀ BẠN MUỐN TÌM
![](images/graphics/blank.gif)