AN ALGORITHM TO DETERMINE OPTIMAL PATH FOR GIS BASED ROAD NETWORK
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.
Downloads
References
CDA International Ltd. (2006). “ Manifold® System Release 7.x”. http://exchange.manifold.net/manifold/manuals/manifold/manifold.htm#networks/graph_theory/graph_theory_glossary.htm
Chung, E., Young, W., and Akcelik, R. (1992). "Comparisonof Roundabout Capacity and Delay Estimates From Analytical and Simulation Models". 16th conference Proceedings -Part5, Australian Road Research Board (ARRB) Limited
Cormen, T.H., Leiserson, C.E, Rivest, R.L, and Stein, C. (2002). “Introduction to Algorithms”. The MITPress, Cambridge, Massachusetts, London, England
DCC (2003). “Road maintenance plan of DCC road network for 2002-2003”. Dhaka City Corporation, Dhaka
DCC (2005). “Base Map of Dhaka City Corporation”.DhakaCity Corporation, Dhaka
DUTP (1998). “Dhaka Urban Transport Project, Phase II(1998), Draft Final Report”. PPK, Mot DocDonald andDevelopmentDesign Consultant (DCC), Dhaka
ESRI (2004). "ESRI GIS Partner Solutions and Services for the Transport Industry". www.esri.com/Transportation/ library/brochure/pdfs/transportation_bps.pdf
HCM (2000). “Highway Capacity Manual”. Transportation Research Board, National Research Council, Washington, DC, USA
Inro Consultants Inc. (2003). "EMME/2 User's Manual Software Release 9". Inro Consultants Inc., Montreal (Quebec), Canada.
Kumar, P., Reddy, D., Singh, B. (2003). "IntelligentTransport System Using GIS".Map India Conference 2003, © GIS Development.net
Liao,T. (2004). "Tabu Search Algorithm for Dynamic Vehicle Routing ProblemsUnderReal-Time Information". Transportation Research Record: Journal of the Transportation Research Board, No. 1882, Washington, D.C., pp. 140-149.
Rao, V., Trinadha, Bhardwaj, Alok, and R,Ch.V.S.(2003). “Intelligent Transport Systems (ITS): A Technology Solution For 21st Century Public Transport System Management”. www.tcs/0_practices/transportation/download/intelligenttransportation_system.pdf
Shekhar, S. Fetterer, A. (1996). “Path Computation in Advanced Traveler Information Systems”. Computer Science Department, EE/CS 4-92 UniversityofMinnesota, Minneapolis, MN, 55455
www.cs.umn.edu/research/shashi- group
The Louis Berger Group, Inc. and Bangladesh Consultants Ltd (2005). "Strategic Transport Plan (revised final draft)". Ministry of Communications, Government of the People's Republic of Bangladesh.
Thirumalaivasan, D., and Guruswamy,V. (2006). "Optimal Route Analysis Using GIS". AnnaUniversity, India www.gisdevelopment.net/application/utility/transport/index.htm
TRB (1985). “HighwayCapacity Manual. Spacial Report 209". Transportation Research Board, National Research Council, Washington, D.C
Wu, Yi-Hwa, Miller, H.J., and Hung, M.C. (2005). “ A GISbased Decision System For Analysis of Route Choice in Congested Urban Road Networks”. Digitally Integrated Information Laboratory &
Department of Geography, University of Utah, 260 S. Central Campus Dr. Room 270, Salt Lake City, UT 84112-9155. E-mail:{wu.yi-hwa, Harvey.miller, mhung}@geog.utah.edu
Zografos, K.G and Androutsopoulos, K. N.(2006)."Algorithmsfor Determining Optimum Itineraries inaMultimodalUrban Transportation Network". TRB 2006 Annual Meeting CD-ROM, USA.
Though MIJST follows the open access policy, the journal holds the copyright of each published items.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
