{"title":"Multi-Index Bi-Criterion Transportation Problem: A Fuzzy Approach","authors":"S. Senapati","doi":"10.22161/IJAEMS.4.7.8","DOIUrl":null,"url":null,"abstract":"This paper represents a non linear bi-criterion generalized multi-index transportation problem (BGMTP) is considered. The generalized transportation problem (GTP) arises in many real-life applications. It has the form of a classical transportation problem, with the additional assumption that the quantities of goods change during the transportation process. Here the fuzzy constraints are used in the demand and in the budget. An efficient new solution procedure is developed keeping the budget as the first priority. All efficient time-cost trade-off pairs are obtained. D1-distance is calculated to each trade-off pair from the ideal solution. Finally optimum solution is reached by using D1-distance.","PeriodicalId":424230,"journal":{"name":"International Journal of Advanced engineering, Management and Science","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Advanced engineering, Management and Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22161/IJAEMS.4.7.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
This paper represents a non linear bi-criterion generalized multi-index transportation problem (BGMTP) is considered. The generalized transportation problem (GTP) arises in many real-life applications. It has the form of a classical transportation problem, with the additional assumption that the quantities of goods change during the transportation process. Here the fuzzy constraints are used in the demand and in the budget. An efficient new solution procedure is developed keeping the budget as the first priority. All efficient time-cost trade-off pairs are obtained. D1-distance is calculated to each trade-off pair from the ideal solution. Finally optimum solution is reached by using D1-distance.