Total Time Minimization of Fuzzy Transportation Problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27740%2F12%3A86084526" target="_blank" >RIV/61989100:27740/12:86084526 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.3233/IFS-2012-0498" target="_blank" >http://dx.doi.org/10.3233/IFS-2012-0498</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.3233/IFS-2012-0498" target="_blank" >10.3233/IFS-2012-0498</a>

Result language
angličtina
Original language name
Total Time Minimization of Fuzzy Transportation Problem
Original language description
This paper proposes a procedure for solving total time minimization in fuzzy transportation problem where the transportation time, source and destination parameters have been expressed as exponential fuzzy numbers by the decision maker. An algorithm is developed to obtain the optimal solution as exponential fuzzy number, which enables the decision maker to obtain more informing results and wider knowledge on the problem under consideration. A numerical example is solved to check the validity of the proposed procedure.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)