hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.1000809

On the sensitivity of aggregative multiobjective optimization methods

Patrick Siarry
Yann Collette

Puni tekst: engleski, pdf (2 MB) str. 1-13 preuzimanja: 454* citiraj
APA 6th Edition
Siarry, P. i Collette, Y. (2008). On the sensitivity of aggregative multiobjective optimization methods. Journal of computing and information technology, 16 (1), 1-13. https://doi.org/10.2498/cit.1000809
MLA 8th Edition
Siarry, Patrick i Yann Collette. "On the sensitivity of aggregative multiobjective optimization methods." Journal of computing and information technology, vol. 16, br. 1, 2008, str. 1-13. https://doi.org/10.2498/cit.1000809. Citirano 25.02.2021.
Chicago 17th Edition
Siarry, Patrick i Yann Collette. "On the sensitivity of aggregative multiobjective optimization methods." Journal of computing and information technology 16, br. 1 (2008): 1-13. https://doi.org/10.2498/cit.1000809
Harvard
Siarry, P., i Collette, Y. (2008). 'On the sensitivity of aggregative multiobjective optimization methods', Journal of computing and information technology, 16(1), str. 1-13. https://doi.org/10.2498/cit.1000809
Vancouver
Siarry P, Collette Y. On the sensitivity of aggregative multiobjective optimization methods. Journal of computing and information technology [Internet]. 2008 [pristupljeno 25.02.2021.];16(1):1-13. https://doi.org/10.2498/cit.1000809
IEEE
P. Siarry i Y. Collette, "On the sensitivity of aggregative multiobjective optimization methods", Journal of computing and information technology, vol.16, br. 1, str. 1-13, 2008. [Online]. https://doi.org/10.2498/cit.1000809

Sažetak
In this paper, we present a study on the sensitivity of aggregation methods with respect to the weights associated with multiobjective functions of a multiobjective optimization problem. To do this study, we have developed some measurements, such as the speed metric or the distribution metric. We have performed this study on a set of biobjective optimization test problems : a convex, a non convex, a continuous and a combinatorial test problem.

We show that some aggregation methods are more sensitive than others.

Hrčak ID: 44601

URI
https://hrcak.srce.hr/44601

Posjeta: 633 *