Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/187996 
Year of Publication: 
2009
Citation: 
[Journal:] Pakistan Journal of Commerce and Social Sciences (PJCSS) [ISSN:] 2309-8619 [Volume:] 3 [Publisher:] Johar Education Society, Pakistan (JESPK) [Place:] Lahore [Year:] 2009 [Pages:] 67-79
Publisher: 
Johar Education Society, Pakistan (JESPK), Lahore
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 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.
Subjects: 
Shortest Path
Dijkstra Algorithm
Floyd-Warshall Algorithm
Road Networks
Creative Commons License: 
cc-by-nc Logo
Document Type: 
Article

Files in This Item:
File
Size
379.37 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.