Displaying 61 – 80 of 97

Showing per page

Lexicographic combinations of preference relations in the context of Possibilistic Decision Theory.

Lluís Godo, Adriana Zapico (2006)

Mathware and Soft Computing

In Possibilistic Decision Theory (PDT), decisions are ranked by a pressimistic or by an optimistic qualitative criteria. The preference relations induced by these criteria have been axiomatized by corresponding sets of rationality postulates, both à la von Neumann and Morgenstern and à la Savage. In this paper we first address a particular issue regarding the axiomatic systems of PDT à la von Neumann and Morgenstern. Namely, we show how to adapt the axiomatic systems for the pessimistic and optimistic...

Majority multiplicative ordered weighting geometric operators and their use in the aggregation of multiplicative preference relations.

José Ignacio Peláez, Jesús María Doña, Alejandro Mesas (2005)

Mathware and Soft Computing

In this paper, we introduced the majority multiplicative ordered weighted geometric (MM-OWG) operator and its properties. This is a general type of the aggregate dependent weights which we have applied in geometric environment. The MM-OWG operator is based on the OWG operators and on the majority operators. We provide the MM-OWG operators to aggregate in a multiplicative environment, i.e. when it's necessary to aggregate information given on a ratio scale. Therefore, it allows us to incorporate...

Measuring criteria weights by means of Dimension Theory.

Daniel Gómez, Javier Montero de Juan, Javier Yáñez Gestoso (2006)

Mathware and Soft Computing

Measuring criteria weights in multicriteria decision making is a key issue in order to amalgamate information when reality is being described from several different points of view. In this paper we propose a method for evaluating those weights taking advantage of Dimension Theory, which allows the representation of the set of alternatives within a real space, provided that decision maker preferences satisfy certain consistency conditions. Such a representation allows a first information about possible...

Meta-optimization of bio-inspired algorithms for antenna array design

Virgilio Zúñiga-Grajeda, Alberto Coronado-Mendoza, Kelly Joel Gurubel-Tun (2018)

Kybernetika

In this article, a technique called Meta-Optimization is used to enhance the effectiveness of bio-inspired algorithms that solve antenna array synthesis problems. This technique consists on a second optimization layer that finds the best behavioral parameters for a given algorithm, which allows to achieve better results. Bio-inspired computational methods are useful to solve complex multidimensional problems such as the design of antenna arrays. However, their performance depends heavily on the...

Mixed Theories

Radev, Slavian (2007)

Serdica Journal of Computing

In the present paper we investigate the life cycles of formalized theories that appear in decision making instruments and science. In few words mixed theories are build in the following steps: Initially a small collection of facts is the kernel of the theory. To express these facts we make a special formalized language. When the collection grows we add some inference rules and thus some axioms to compress the knowledge. The next step is to generalize these rules to all expressions in the formalized language....

Optimal Allocation of Renewable Energy Parks: A Two–stage Optimization Model

Carmen Gervet, Mohammad Atef (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Applied research into Renewable Energies raises complex challenges of a technological, economical or political nature. In this paper, we address the techno−economical optimization problem of selecting locations of wind and solar Parks to be built in Egypt, such that the electricity demand is satisfied at minimal costs. Ultimately, our goal is to build a decision support tool that will provide private and governmental investors into renewable energy systems, valuable insights to make informed short...

Currently displaying 61 – 80 of 97