On MILP Models for the OWA Optimization

• Autorzy: Ogryczak W. , Olender P.
• Języki publikacji: EN

Abstrakty

EN

The problem of aggregating multiple outcomes to form overall objective functions is of considerable importance in many applications. The ordered weighted averaging (OWA) aggregation uses the weights assigned to the ordered values (i.e., to the largest value, the second largest and so on) rather than to the specific coordinates. It allows to evaluate solutions impartially, when distribution of outcomes is more important than assignments these outcomes to the specific criteria. This applies to systems with multiple independent users or agents, whose objectives correspond to the criteria. The ordering operator causes that the OWA optimization problem is nonlinear. Several MILP models have been developed for the OWA optimization. They are built with different numbers of binary variables and auxiliary constraints. In this paper we analyze and compare computational performances of the different MILP model formulations.

Słowa kluczowe

EN

location problem; mixed integer linear programming; multiple criteria; ordered weighted averaging (OWA)

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2012
• Tom: nr 2
• Strony: 5--12
• Opis fizyczny: Bibliogr. 10 poz., rys., tab.

Twórcy

autor

Ogryczak W.

autor

Olender P.

• Institute of Control and Computation Engineering, Warsaw University of Technology, Nowowiejska st 15/19, 00-665 Warsaw, Poland,

Bibliografia

• [1] R. R. Yager, “On ordered weighted averaging aggregation operators in multicriteria decision making”, IEEE Trans. Sys., Man and Cyber., vol. 18, pp. 183–190, 1988.
• [2] R. R. Yager, J. Kacprzyk, and G. Beliakov (Eds.), Recent Develop- ments in the Ordered Weighted Averaging Operators: Theory and Practice. Springer, 2011.
• [3] W. Ogryczak, T. Śliwiński, and A. Wierzbicki, “Fair resource allocation schemes and network dimensioning problems”, J. Telecom. Inform. Technol., no. 3, pp. 34–42, 2003.
• [4] M. K¨oppen, K. Yoshida, and M. Tsuru, Y. Oie, “Annealing heuristic for fair wireless channel allocation by exponential ordered-ordered weighted averaging operator maximization”, in Proc. IEEE/IPSJ Int. Symp. Appl. Internet, Munich, Germany, 2011, pp. 538–543.
• [5] S. Nickel and J. Puerto, Location Theory: A Unified Approach. Berlin, Springer, 2005.
• [6] R. R. Yager, “Constrained OWA aggregation”, Fuzzy Sets and Systems, vol. 81, pp. 89–101, 1996.
• [7] W. Ogryczak and T. Śliwiński, “On solving linear programs with the ordered weighted averaging objective”, Eur. J. Oper. Res., vol. 148, pp. 80–91, 2003.
• [8] N. Boland, P. Dominguez-Marin, S. Nickel, and J. Puerto, “Exact procedures for solving the discrete ordered median problem”, Com- put. Oper. Res., vol. 33, pp. 3270–3300, 2006.
• [9] W. Ogryczak and A. Tamir, “Minimizing the sum of the k largest functions in linear time”, Inform. Process. Letters, vol. 85, pp. 117–122, 2003.
• [10] P. Dominguez-Marin, The Discrete Ordered Median Problem: Mod- els and Solution Methods. Springer, 2003.