Parallel Multi Objective Shortest Path Update Algorithm in Large Dynamic Networks

The multi objective shortest path (MOSP) problem, crucial in various practical domains, seeks paths that optimize multiple objectives. Due to its high computational complexity, numerous parallel heuristics have been developed for static networks. However, real-world networks are often dynamic where...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on parallel and distributed systems Jg. 36; H. 5; S. 932 - 944
Hauptverfasser:	Shovan, S. M., Khanda, Arindam, Das, Sajal K.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	IEEE 01.05.2025
Schlagworte:	Aerodynamics dynamic graph GPU Graphics processing units Heuristic algorithms Linear programming Multi-objective shortest path Optimization Parallel algorithms Pareto optimization Scalability Search problems shared-memory SYCL programming model Wireless sensor networks
ISSN:	1045-9219, 1558-2183
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!