| Article ID: | iaor2010227 |
| Volume: | 3 |
| Issue: | 1 |
| Start Page Number: | 67 |
| End Page Number: | 79 |
| Publication Date: | Jul 2009 |
| Journal: | Pakistan Journal of Commerce and Social Sciences |
| Authors: | Shehzad Farrukh, Shah Muhammed Akbar Ali |
| Keywords: | networks: path |
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 on the roads. This study is based on optimization of real road network by means of distances. Two main objectives are pursued in this research: 1) road distances among different routes are composed in detail; 2) two standard algorithms (Dijkstra and Floyd-Warshall algoritms) are applied to optimize/minimize these distances for both single-source and all-pairs shortest path problems.