The paper presents selected multicriteria (multiobjective) approaches to shortest path problems. A classification of multiobjective shortest path (MOSP) problems is given. Different models of MOSP problems are discussed in detail. Methods of solving the formulated optimization problems are presented. ; An analysis of the complexity of the presented methods and ways of adapting of classical algorithms for solving multiobjective shortest path problems are described. A comparison of the effectiveness of solving selected MOSP problems defined as mathematical programming problems (using the CPLEX 7.0 solver) and multi-weighted graph problems (using modified Dijkstra`s algorithm) is given. Experimental results of using the presented methods for multicriteria path selection in a terrain-based grid network are given.
Zielona Góra: Uniwersytet Zielonogórski
AMCS, volume 17, number 2 (2007) ; click here to follow the link
Biblioteka Uniwersytetu Zielonogórskiego
Apr 2, 2024
Apr 2, 2024
28
https://zbc.uz.zgora.pl/repozytorium/publication/88407
Edition name | Date |
---|---|
Selected multicriteria shortest path problems: An analysis of complexity, models and adaptation of standard algorithms | Apr 2, 2024 |
Gawron, Piotr Klamka, Jerzy (1944- ) Winiarczyk, Ryszard Korbicz, Józef - red. Uciński, Dariusz - red.
Assaf, Ramiz Saleh, Yahya Kuczyński, Tadeusz - red.