Description: Consider only the bus line, given a choice between any two lines for the bus station issue general mathematical model and algorithms. And in accordance with Appendix data, use your model and algorithm obtains the following six pairs starting station → best route between the final station. The use of optimization theory, establish a dynamic programming model, and use breadth-first algorithm, based on models and algorithms, iterative thinking, implemented by K-1 based on the selected sub-route transfer method to get the transfer K times route
To Search:
File list (Check if you may need any files):
说明.txt
Download