首页> 外文会议>Modeling and simulation in engineering, economics, and management >OWA Operators in the Assignment Process: The Case of the Hungarian Algorithm
【24h】

OWA Operators in the Assignment Process: The Case of the Hungarian Algorithm

机译:分配过程中的OWA运算符:匈牙利算法的情况

获取原文
获取原文并翻译 | 示例

摘要

We develop a new assignment algorithm by using a wide range of aggregation operators in the Hungarian algorithm. We introduce a new process based on the use of the ordered weighted averaging distance (OWAD) operator in the Hungarian algorithm. We refer to it as the Hungarian algorithm with the OWAD operator (HAOWAD). The main advantage of this approach is that we can provide a parameterized family of aggregation operators between the minimum and the maximum. Thus, we can represent the information in a more complete way. Furthermore, we also present a general framework by using generalized and quasi-arithmetic means. We end the paper with a practical application of the new approach in a financial decision making problem regarding the assignment of investments.
机译:我们通过在匈牙利算法中使用各种聚合运算符来开发一种新的分配算法。我们在匈牙利算法中引入了基于有序加权平均距离(OWAD)运算符的新过程。我们将其称为OWAD运算符(HAOWAD)的匈牙利算法。这种方法的主要优点是,我们可以在最小值和最大值之间提供参数化的聚合运算符族。因此,我们可以更完整地表示信息。此外,我们还通过使用广义算术和准算术手段提供了一个通用框架。本文以新方法在涉及投资分配的财务决策问题中的实际应用结束。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号