• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International journal of fuzzy system applications >Fuzzy Transportation Problem by Using Triangular, Pentagonal and Heptagonal Fuzzy Numbers With Lagrange's Polynomial to Approximate Fuzzy Cost for Nonagon and Hendecagon
【24h】

Fuzzy Transportation Problem by Using Triangular, Pentagonal and Heptagonal Fuzzy Numbers With Lagrange's Polynomial to Approximate Fuzzy Cost for Nonagon and Hendecagon

机译：利用拉格朗日多项式的三角形，五角形和臀翼模糊数与拉格朗兰多项式以近似模糊成本的模糊运输问题

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The transportation problem is a main branch of operational research and its main objective is to transport a single uniform good which are initially stored at several origins to different destinations in such a way that the total transportation cost is minimum. In real life applications, available supply and forecast demand, are often fuzzy because some information is incomplete or unavailable. In this article, the authors have converted the crisp transportation problem into the fuzzy transportation problem by using various types of fuzzy numbers such as triangular, pentagonal, and heptagonal fuzzy numbers. This article compares the minimum fuzzy transportation cost obtained from the different method and in the last section, the authors introduce the Lagrange's polynomial to determine the approximate fuzzy transportation cost for the nanogon (n = 9) and hendecagon (n = 11) fuzzy numbers.
机译：运输问题是运营研究的主要分支，其主要目标是运输单一的均匀良好，最初以几个起源存放到不同目的地，使总运输成本最低。 在现实生活中，可用的供应和预测需求通常是模糊的，因为某些信息是不完整或不可用的。 在本文中，作者通过使用三角形，五角形和臀翼模糊数等各种模糊数字将清脆的运输问题转换为模糊运输问题。 本文比较了从不同方法中获得的最小模糊运输成本，并在最后一节中介绍了拉格朗日的多项式，以确定纳米尾（n = 9）和Hendecagon（n = 11）模糊数的近似模糊运输成本。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号