Optimization of the Multi-Threaded Interval Algorithm for the Pareto-Set Computation

Previous investigations of the authors surveyed the possibility of applying interval methods to seek the Paretofront of a multicriterial nonlinear problem. An efficient algorithm has been proposed and its implementation in a multicore environment has been done and tested. This paper has two goals. F...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of Telecommunications and Information Technology H. 1; S. 70 - 75
Hauptverfasser: Kubica, Bartłomiej J., Woźniak, Adam
Format: Journal Article
Sprache:Englisch
Veröffentlicht: National Institute of Telecommunications 01.06.2023
Schlagworte:
interval computations
multicriterial analysis
multithreaded programming
Pareto set
POSIX threads
sharedmemory parallelization
ISSN:1509-4553, 1899-8852
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Previous investigations of the authors surveyed the possibility of applying interval methods to seek the Paretofront of a multicriterial nonlinear problem. An efficient algorithm has been proposed and its implementation in a multicore environment has been done and tested. This paper has two goals. First one is to tune the developed algorithm to increase the speedup of the multi-threaded variant. The second one is to extend the algorithm to compute not only the Paretofront (in the criteria space), but also the Pareto-set (in the decision space). Numerical results for suitable test problems are presented.
ISSN:1509-4553
1899-8852
DOI:10.26636/jtit.2010.1.1066