AN ALGORITHM TO DETERMINE OPTIMAL PATH FOR GIS BASED ROAD NETWORK

MIST Central Library Repository

Show simple item record

dc.contributor.author Siddique, M.A.Q.
dc.contributor.author Shamsuddoha, Md.
dc.date.accessioned 2015-07-13T08:08:49Z
dc.date.available 2015-07-13T08:08:49Z
dc.date.issued 2009-02
dc.identifier.issn 1999-2009
dc.identifier.uri http://hdl.handle.net/123456789/174
dc.description.abstract Traffic 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. en_US
dc.description.sponsorship Research and Development Wing, MIST en_US
dc.language.iso en en_US
dc.publisher R&D Wing, MIST en_US
dc.relation.ispartofseries Volume 1, Number 1, February 2009;
dc.subject Algorithm, Congestion, GIS, Optimal, Matrix en_US
dc.title AN ALGORITHM TO DETERMINE OPTIMAL PATH FOR GIS BASED ROAD NETWORK en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account