首页> 外文期刊>IEEE transactions on automation science and engineering: a publication of the IEEE Robotics and Automation Society >Double Auction-Based Manufacturing Cloud Service Allocation in an Industrial Park
【24h】

Double Auction-Based Manufacturing Cloud Service Allocation in an Industrial Park

机译:工业园区基于双拍卖的制造云服务分配

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Industrial parks are regarded as a possible fashion to reduce the manufacturing costs and increase the efficiency by sharing cost-effective infrastructure and communal services. However, the waste of manufacturing resources could impede the development of manufacturing enterprises that locate in an industrial park when market demands fluctuate dynamically. This article aims to use the cloud manufacturing (CMfg) to relieve the temporary shortage of manufacturing resources and capabilities by sharing them among these enterprises in an industrial park. This article focuses on manufacturing cloud service allocation (MCSA), which is one of the critical processes to implement CMfg. Two multiunit double auction mechanisms are proposed to allocate the manufacturing cloud services (MCSs) with reasonable trade price in bilateral markets, and their properties and bidding strategies are proved. Numerical studies are conducted, and the results show the effectiveness and efficiency of two mechanisms for dealing with MCSA and verify the theoretical proofs. Note to Practitioners-MCSA in CMfg is a complicated and challenging task. The current industrial applications rely on optimization methods, such as all-in-one methods (e.g., genetic algorithm) and multidiscipline design optimization methods (e.g., analytical target cascading), to allocate MCSs. While these methods can help cloud operators obtain feasible allocation solutions rapidly, there exist several disadvantages: 1) they can only solve problems in one-sided settings (one customer with many providers); 2) there is an assumption that the customer's demand can be provided by any providers, which means providers' capacities are infinite; and 3) the problem is optimized based on the fixed prices provided by providers, without considering supply and demand. This article presents two multiunit double auction mechanisms that allow multiple customers to trade with multiple providers. Allocation rules can break the assumption and providers' capacities are limited. MCSs are also priced dynamically based on supply and demand. We show how cloud operators apply two mechanisms first and demonstrate their properties and bidding strategies of customers and providers when the mechanism is not incentive compatible. Finally, our experiments and analysis fully validate the applicability and efficiency of two mechanisms and illustrate how cloud operators can maximize their utilities.
机译:工业园区被认为是通过共享具有成本效益的基础设施和公共服务来降低制造成本和提高效率的一种可能方式。然而,当市场需求动态波动时,制造资源的浪费可能会阻碍位于工业园区的制造企业的发展。本文旨在利用云制造(CMfg)在工业园区的这些企业之间共享制造资源和能力,以缓解制造资源和能力的暂时短缺。本文重点介绍制造云服务分配 (MCSA),这是实现 CMfg 的关键过程之一。针对双边市场中交易价格合理的制造云服务(MCS)进行配置,提出了两种多单元双拍卖机制,并验证了其属性和竞价策略。通过数值研究,验证了两种处理MCSA机制的有效性和有效性,验证了理论证明。从业者须知 - CMfg 中的 MCSA 是一项复杂且具有挑战性的任务。目前的工业应用依赖于优化方法,如一体化方法(如遗传算法)和多学科设计优化方法(如分析目标级联)来分配MCS。虽然这些方法可以帮助云运营商快速获得可行的分配方案,但存在以下几个缺点:1)它们只能在单方面设置下解决问题(一个客户有多个提供商);2)假设客户的需求可以由任何供应商提供,这意味着供应商的能力是无限的;3)根据供应商提供的固定价格对问题进行优化,不考虑供需关系。本文介绍了两种多单位双重拍卖机制,允许多个客户与多个提供商进行交易。分配规则可能会打破假设,提供商的能力是有限的。MCS 还根据供求关系动态定价。我们首先展示了云运营商如何应用两种机制,并演示了当机制与激励不兼容时,客户和提供商的属性和竞价策略。最后,我们的实验和分析充分验证了两种机制的适用性和有效性,并说明了云运营商如何最大限度地发挥其效用。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号