Marko Grgurovič

University of Primorska | UP · Department of Information Sciences and Technologies

We study practical algorithms for solving the all-pairs shortest path problem. The Floyd-Warshall algorithm is frequently used to solve the aforementioned problem, and we show how it can be augmented to drastically reduce the number of path combinations examined. Very favorable results are shown via empirical tests that compare the new algorithm wi...

Given an arbitrary, non-negatively weighted, directed graph G = (V,E) we present an algorithm that computes all pairs shortest paths in time \(\mathcal{O}(m^* n + m \lg n + nT_\psi(m^*, n))\), where m * is the number of different edges contained in shortest paths and T ψ (m *, n) is a running time of an algorithm to solve a single-source shortest p...

Performance analysis of the partial use of a local optimization operator on the genetic algorithm for the Travelling Salesman Problem Background: The Travelling Salesman Problem is an NP-hard problem in combinatorial optimization with a number of practical implications. There are many heuristic algorithms and exact methods for solving the problem....

We consider the problem when visitor wants to visit all interesting sites in a city exactly once and to come back to the hotel. Since, the visitors use streets, walking trails and pedestrian zones, the goal is to minimize the visitor’s traveling. A new problem the Traveling Visitor Problem (TVP) is similar to the Traveling Salesman Problem (TSP) wi...