Evaluation of Shortest Paths in Road Network

Abstract

Optimization is a key factor in almost all the topics of operations research / management science and economics.The road networks can be optimized within different constraints like time, distance, cost and traffic running onthe roads.This study is based on optimization of real road network by means of distances. Two main objectives arepursued in this research: 1) road distances among different routes are composed in detail; 2) two standardalgorithms (Dijkstra and Floyd-Warshall algoritms) are applied to optimize/minimize these distances for bothsingle-source and all-pairs shortest path problems.

Keywords

• Shortest Path
• Dijkstra Algorithm
• Floyd-Warshall Algorithm
• Road Networks