PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 9

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available The airport gate assignment problem – multi-objective optimization versus evolutionary multi-objective optimization
Kaliszewski I., Miroforidis J., Stańczak J.
Computer Science
|
2017
|
Vol. 18 (1)
41--52
EN
In this paper, we approach the Airport Gate Assignment Problem by Multi-objective Optimization as well as Evolutionary Multi-objective Optimization. We solve a bi-criteria formulation of this problem by the commercial mixed-integer programming solver CPLEX and a dedicated Evolutionary Multi-objective Optimization algorithm. To deal with multiple objectives, we apply a methodology that we developed earlier to capture decision-maker preferences in multi-objective environments. We present the results of numerical tests for these two approaches.
2
Content available remote Primal–dual type evolutionary multiobjective optimization
Kaliszewski I., Miroforidis J
Foundations of Computing and Decision Sciences
|
2013
|
Vol. 38, No. 4
267--275
EN
A new, primal-dual type approach for derivation of Pareto front approximations with evolutionary computations is proposed. At present, evolutionary multiobjective optimization algorithms derive a discrete approximation of the Pareto front (the set of objective maps of efficient solutions) by selecting feasible solutions such that their objective maps are close to the Pareto front. As, except of test problems, Pareto fronts are not known, the accuracy of such approximations is known neither. Here we propose to exploit also elements outside feasible sets with the aim to derive pairs of Pareto front approximations such that for each approximation pair the corresponding Pareto front lies, in a certain sense, in-between. Accuracies of Pareto front approximations by such pairs can be measured and controlled with respect to distance between such approximations. A rudimentary algorithm to derive pairs of Pareto front approximations is pre- sented and the viability of the idea is verified on a limited number of test problems.
3
Content available Multiple criteria ranking decision support
Chmielewski M., Kaliszewski I.
Control and Cybernetics
|
2011
|
Vol. 40, no 4
1161-1187
EN
We propose a methodology to support decisions on how to construct rankings of objects which account for decision makers' preferences. As it is not always so that objects to be ranked are known upfront, the methodology is focused on constructing ranking algorithms rather than rankings themselves. The methodology builds on Multiple Criteria Decision Making paradigms. To operationalize it we provide a consistent interactive framework which allows the decision maker to express his preferences with respect to objects directly, with respect to the criteria selection process (multiple criteria model building), and with respect to attributes resulting from the selected criteria. The methodology is illustrated by a numerical example of municipality rankings.
4
Content available remote A method of approximating Pareto sets for assessments of implicit Pareto set elements
Kaliszewski I.
Control and Cybernetics
|
2007
|
Vol. 36, no 2
367-381
EN
Deriving efficient variants in complex multiple criteria decision making problems requires optimization. This hampers greatly broad use of any multiple criteria decision making method. In multiple criteria decision making Pareto sets, i.e. sets of efficient vectors of criteria values corresponding to feasible decision alternatives, are of primal interest. Recently, methods have been proposed to calculate assessments for any implicit element of a Pareto set (i.e. element which has not been derived explicitly but has been designated in a form which allows its explicit derivation, if required) when a finite representation of the Pareto set is known. In that case calculating respective bounds involves only elementary operations on numbers and does not require optimization. In this paper the problem of approximating Pareto sets by finite representations which assure required tightness of bounds is considered for bicriteria decision making problems. Properties of a procedure to derive such representations and its numerical behavior are investigated.
5
Content available remote A generalization of the Zionts-Wallenius multiple criteria decision making algorithm
Kaliszewski I., Zionts S.
Control and Cybernetics
|
2004
|
Vol. 33, no 3
477-500
EN
In multicriteria problem solving, much can be learned by observing the decision-making process. Some, if not many, of the theoretical constructs used in some academically-generated models are simply not necessary. Taking this into account, we generalize the Zionts-Wallenius Multiple Criteria Decision Making Algorithm. We generalize the approach so that it can solve general convex problems. We do this by drawing from other methods, and by incorporating what we have learned in our work. To deal with the class of convex problems we face, we broaden the concept of tradeoff, and use global tradeoffs. Theory is developed, and then a method incorporating the theory is presented. A small example is included. We discuss how our development enriches decision-making tools currently available. We discuss applications in finance and technology.
6
Content available Weight versus reference point multiple criteria decision making methods - analogies and differences
Kaliszewski I.
Journal of Telecommunications and Information Technology
|
2003
|
nr 3
9-15
EN
In this work we shall be concerned with interactive multiple criteria decision making methods. We show how on the technical level the class of reference point methods can be reduced to the class of weight methods. Though methods from these two classes represent two different interactive decision making paradigms, the equivalence observed opens a way for a joint implementation of a pair of methods each representing a different class. This would establish a firm ground for systematic comparison of both classes of methods as well as for hybrid schemes mixing decisional tools specific for each class.
7
Content available Multiple criteria decision making with deductive approximate representation of efficient outcomes
Kaliszewski I.
Control and Cybernetics
|
2002
|
Vol. 31, no 4
949-964
EN
We propose an approach, which we believe, can be pivotal for wider applications of Multiple Criteria Decision Making methods in practical problems. The idea is to represent decisions by approximate rather than by exact values of criteria. By this it is possible to eliminate the need of solving optimization problems from decision making processes. This in turn has far reaching consequences for versatility of decision making methods when modified accordingly to absorb the proposed approach.
PL
Zaproponowano podejście, o którym należy sądzić, że stanowi istotny postęp w dziedzinie szerszego zastosowania metod wielokryterialnego podejmowania decyzji do zagadnień praktycznych. Idea polega na przybliżonej raczej niż dokładnej reprezentacji decyzji przy pomocy wartości kryteriów. W ten sposób staje się możliwe wyeliminowanie potrzeby rozwiązywania zadań optymalizacyjnych z procesu podejmowania decyzji. To zaś ma daleko idące konsekwencje dla elastyczności metod podejmowania decyzji, zmodyfikowanych w celu uwzględnienia zaproponowanego podejścia.
8
Multiple criteria decision making without optimization
Kaliszewski I.
Systems Science
|
2001
|
Vol. 27, nr 2
5-13
EN
We present a development intended to make interactive decision making schemes accessible for a wider spectrum of decision makers. To this aim we propose to eliminate the need to solve optimization problems at successive iterations of interactive decision processes. We show that the need for optimization can be eliminated by the ability of establishing sufficiently tight bounds on criteria values for efficient decisions prior to explicit identification of such decisions. We present a technique, fully operational and numerically simple, for establishing such bounds. Bounds are dynamic, i.e., they become stronger with the growing number of decisions explicitly identified. They are also parametric with respect to weighting coefficients. We also point out how this technique can enhance the existing interactive decision making methods.
9
Giełda terminowa energii elektrycznej
Kaliszewski I.
Energetyka
|
1998
|
nr 10
409-412
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.