Description: takes the least number of passenger trips is considered the primary factor. Description of the traditional Dijkstra algorithm. and analysis of the Dijkstra algorithm is not suitable for transit network optimal path of choice. Finally, according to transit passengers will be able to walk away from a transfer above the actual situation, A proposed change to the least number of public transport operators to improve the shortest path
- [numberofplans.Rar] - algorithm analysis of the forward algori
- [migong-c] - maze algorithm! Through recursive algori
- [wuhanbus-e] - Wuhan Bus Inquiry System-e-source langua
- [1] - Bus lines to choose the smallest transfe
- [huolangdan] - Traveling salesman problem of the VC met
- [gdf] - Urban traffic network in accordance with
- [gysj] - SUMMARY transit system design book quite
- [Traffic] - Transport Advisory and achieve the optim
- [ACOforSHORTPATHwithMatlab] - ant colony algorithm matalab solution pr
File list (Check if you may need any files):
Download