Search for: [Abstract = "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."]