Please use this identifier to cite or link to this item:
https://hdl.handle.net/2445/181706
Title: | Fuzzy Branch-and-Bound Algorithm with OWA Operators in the Case of Consumer Decision Making |
Author: | Vizuete Luciano, Emilio Bòria Reverter, Sefa Merigó Lindahl, José M. Gil Lafuente, Anna Maria Solé Moro, María Luisa |
Keywords: | Algorismes Presa de decisions (Estadística) Teoria d'operadors Algorithms Statistical decision Operator theory |
Issue Date: | 26-Nov-2021 |
Publisher: | MDPI |
Abstract: | The ordered weighted averaging (OWA) operator is one of the most used techniques in the operator's aggregation procedure. This paper proposes a new assignment algorithm by using the OWA operator and different extensions of it in the Branch-and-bound algorithm. The process is based on the use of the ordered weighted average distance operator (OWAD) and the induced OWAD operator (IOWAD). We present it as the Branch-and-bound algorithm with the OWAD operator (BBAOWAD) and the Branch-and-bound algorithm with the IOWAD operator (BBAIOWAD). The main advantage of this approach is that we can obtain more detailed information by obtaining a parameterized family of aggregation operators. The application of the new algorithm is developed in a consumer decision-making model in the city of Barcelona regarding the selection of groceries by districts that best suit their needs. We rely on the opinion of local commerce experts in the city. The key advantage of this approach is that we can consider different sources of information independent of each other. |
Note: | Reproducció del document publicat a: https://doi.org/10.3390/math9233045 |
It is part of: | Mathematics, 2021, vol. 9(23), num. 3045, p. 1-16 |
URI: | https://hdl.handle.net/2445/181706 |
Related resource: | https://doi.org/10.3390/math9233045 |
ISSN: | 2227-7390 |
Appears in Collections: | Articles publicats en revistes (Empresa) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
716158.pdf | 496.21 kB | Adobe PDF | View/Open |
This item is licensed under a
Creative Commons License