AN ALGORITHM TO DETERMINE OPTIMAL PATH FOR GIS BASED ROAD NETWORK

dc.contributor.authorSiddique, M.A.Q.
dc.contributor.authorShamsuddoha, Md.
dc.date.accessioned2015-07-13T08:08:49Z
dc.date.available2015-07-13T08:08:49Z
dc.date.issued2009-02
dc.description.abstractTraffic congestion is becoming a serious problem in modern cities across the globe. With the complex network of a modern city, finding optimal path for road user is a challenging task. Network analysis in Geographic Information Systems (GIS) provides strong decision support for users in searching shortest route, which considers only a single network weight. Unlike other shortest path algorithm, the author developed an algorithm which could be extensively used for GIS based global position of transport network to determine optimal path. A network matrix were generated using adjacent nodes (vertices) and travel cost (travel time). Another turn matrix was generated using adjacent nodes of intersection to estimate intersection delay and turn control. The algorithm was implemented in C++ environment.
dc.identifier.otherhttps://dspace.mist.ac.bd/server/api/core/items/894d8af1-fccd-4c80-9757-50425ad2f92f
dc.identifier.urihttp://hdl.handle.net/123456789/174
dc.language.isoen
dc.publisherR&D Wing, MIST
dc.sourceMIST Digital Archive
dc.subjectAlgorithm, Congestion, GIS, Optimal, Matrix
dc.titleAN ALGORITHM TO DETERMINE OPTIMAL PATH FOR GIS BASED ROAD NETWORK
dc.typeArticle

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
05.pdf
Size:
5.49 MB
Format:
Adobe Portable Document Format