time minimizing transportation problem with fractional bottleneck objective function
Clicks: 29
ID: 255270
2012
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
8.4
/100
29 views
14 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #15 of 16 articles by views in chemnanomat
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
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 TMTP-FBOF Algorithm is supported by a real life example of Military Transportation Problem of Indian Army.
| Reference Key |
madhuri2012yugoslavtime
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Jain Madhuri;Saksena P.K. |
| Journal | chemnanomat |
| Year | 2012 |
| DOI |
10.2298/YJOR100818004J
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.