• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Workshop on Agent-Based Approaches in Economic and Social Complex Systems 2004(AESCS'04); 20040527-29; Kyoto University(JP) >A Study on Pareto Optimality of Walrasian Virtual Market
【24h】

A Study on Pareto Optimality of Walrasian Virtual Market

机译：瓦尔拉斯虚拟市场的帕累托最优性研究

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

摘要

Conventional supply chain management (SCM) is not always concerned with optimal solutions in terms of product allocation. Virtual market based supply chain operation solves the product allocation problem by distributing the scheduled resources according to the market prices, which define common scale of value across the various products. We formulate supply chain model as a discrete resource allocation problem, and demonstrate the applicability of the Walrasian virtual market concept with multi-agent paradigm to this framework. In this paper we demonstrate the proposed algorithm successfully calculates Pareto optimal solutions in the supply chain product allocation problem by comparing our method with conventional analytic approaches, such as e constraint method and fixed point algorithm.
机译：传统的供应链管理（SCM）并不总是与产品分配方面的最佳解决方案有关。基于虚拟市场的供应链运作通过根据市场价格分配计划的资源来解决产品分配问题，市场价格定义了各种产品的共同价值规模。我们将供应链模型表述为一个离散的资源分配问题，并证明了具有多智能体范式的Walrasian虚拟市场概念在该框架中的适用性。在本文中，我们通过将我们的方法与传统的分析方法（例如e约束方法和定点算法）进行比较，证明了该算法成功地计算了供应链产品分配问题中的Pareto最优解。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号