Application of the Improved Dijkstra's Matrix Algorithm in Choosing Best-routing for Pubilc Transportation System
Huang Jian-xiong · Journal of Shanghai University of Electric Power · 2009
Based on the improved Dijkstra's matrix algorithm,the paper efficiently and more exactly solves the problem B of CUMCM 2007:Public Transportation Route Selection Problem,which obtains the best routes by respectively considering the shortest time,the least expense,the shortest public traffic transfer between any two given bus stops.