A computer simulation of optimal travel time of a transport network | [Quaid-e-Awam University Research Journal of Engineering, Science and Technology • 2011]

Author(s):

1. Hyder Bux Jatoi: Department of Basic Sciences and Related Studies, Quaid-e-Awam University of Engg: Science and Technology, Nawabshah, Pakistan

2. Iqbal Ahmed Ansari: Department of Basic Sciences and Related Studies, Quaid-e-Awam University of Engg: Science and Technology, Nawabshah, Pakistan

3. Chajro Khan Muhammad: Department of Basic Sciences and Related Studies, MUET, Jamshoro, Pakistan

Abstract:

When the optimal routes between all nodes are sought and when all nodes are directly connected with all other nodes the matrix approaches are generally ore efficient then the tree building approaches. However, the existing matrix algorithms don’t generate a hierarchy of optimal travel time paths. A Point Location technique presented below has the following interesting features: i) It generates a hierarchy of optimal travel time routes emanating between all nodes of a transport network; ii) It considerably reduces the computer storages as compared to the one required by other matrix algorithms; iii) It can easily be coded into a computer program and its efficiency in computing time is exactly determinable and independent of the structure of the network. Result of three different sample networks are obtained through the use of Point Location technique. Computer code is developed in Turbo C++ language on IBM PC.

Page(s): 26-30

DOI: DOI not available

Published: Journal: Quaid-e-Awam University Research Journal of Engineering, Science and Technology, Volume: 10, Issue: 1, Year: 2011

Keywords:

Keywords are not available for this article.

References:

References are not available for this document.

Citations

Citations are not available for this document.

Citations

Downloads

Views