Articolul precedent |
Articolul urmator |
402 4 |
Ultima descărcare din IBN: 2024-05-13 23:56 |
SM ISO690:2012 TKACENKO, Alexandra. The adapted algorithm of Jose A. Diaz for multi-criteria fractional transportation problem with "bottleneck" criterion. In: Conference on Applied and Industrial Mathematics: CAIM 2018, 20-22 septembrie 2018, Iași, România. Chișinău, Republica Moldova: Casa Editorial-Poligrafică „Bons Offices”, 2018, Ediţia a 26-a, pp. 67-68. ISBN 978-9975-76-247-2. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Conference on Applied and Industrial Mathematics Ediţia a 26-a, 2018 |
||||||
Conferința "Conference on Applied and Industrial Mathematics" Iași, România, Romania, 20-22 septembrie 2018 | ||||||
|
||||||
Pag. 67-68 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
The paper proposes an adapted version of Jose A. Diaz algorithm for solving the multi-criteria fractional transportation problem with the same bottleneck denominators, additionally with the same time "bottleneck" criterion separately. It generates for each (feasible) time value the best compromise multi criteria solution. So, nally, we will obtain one nite set of ecient solutions for solving the multi-criteria fractional transportation problem with the same bottleneck denominators, separately including the time "bottleneck" criterion. The mathematical model of the proposed problem is the follows. |
||||||
|
Cerif XML Export
<?xml version='1.0' encoding='utf-8'?> <CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'> <cfResPubl> <cfResPublId>ibn-ResPubl-157755</cfResPublId> <cfResPublDate>2018</cfResPublDate> <cfVol>Ediţia a 26-a</cfVol> <cfStartPage>67</cfStartPage> <cfISBN> 978-9975-76-247-2</cfISBN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/157755</cfURI> <cfTitle cfLangCode='EN' cfTrans='o'>The adapted algorithm of Jose A. Diaz for multi-criteria fractional transportation problem with "bottleneck" criterion</cfTitle> <cfAbstr cfLangCode='EN' cfTrans='o'><p>The paper proposes an adapted version of Jose A. Diaz algorithm for solving the multi-criteria fractional transportation problem with the same bottleneck denominators, additionally with the same time "bottleneck" criterion separately. It generates for each (feasible) time value the best compromise multi criteria solution. So, nally, we will obtain one nite set of ecient solutions for solving the multi-criteria fractional transportation problem with the same bottleneck denominators, separately including the time "bottleneck" criterion. The mathematical model of the proposed problem is the follows.</p></cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId> <cfStartDate>2018T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId> <cfStartDate>2018T24:00:00</cfStartDate> </cfResPubl_Class> <cfPers_ResPubl> <cfPersId>ibn-person-25749</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2018T24:00:00</cfStartDate> </cfPers_ResPubl> </cfResPubl> <cfPers> <cfPersId>ibn-Pers-25749</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-25749-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2018T24:00:00</cfStartDate> <cfFamilyNames>Tkacenko</cfFamilyNames> <cfFirstNames>Alexandra</cfFirstNames> </cfPersName_Pers> </cfPers> </CERIF>