Ordered visibility graph weighted averaging aggregation operator: A methodology based on network analysis

Hongping Wang

doi:10.1016/j.cie.2015.06.021

Return

Ordered visibility graph weighted averaging aggregation operator: A methodology based on network analysis

2015-10-01

PRE

DOI：10.1016/j.cie.2015.06.021

Original

Original request for help

Save

Abstract

En 中文

The ordered weighted averaging (OWA) operators are widely used in many applications. Determining the OWA operator weights is still an open issue. In this paper, an ordered visibility graph weighted averaging (OVGWA) aggregation operator is proposed based on complex network methodology. After the argument values are ordered in descending order, a network is constructed using ordered visible graph (OVG) method. The arriving probabilities of random walker in the network are utilized as the weights of the corresponding data. Compared with the classical OWA, the proposed OVGWA not only takes the information of orders but also the argument values themselves into consideration to determine the weights. An application of produced water management is used to illustrate the application of the proposed OVGWA aggregation operator. In addition, the aggregated results are compared with those obtained by maximal entropy method. The results show that the proposed method is effective. To study the impacts of the influencing factors, a sensitivity analysis has been carried out. It is utility to understand the role of different indicators on aggregated value. (C) 2015 Elsevier Ltd. All rights reserved.

Keywords:

OWA operator

Visibility graph

Networks

OVGWA operator

Random walks

Produced water management

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.