| dc.description.abstract | In this thesis, we discuss a method of line planning of a public transportation system on a city road network. The desired solution is the cheapest and fastest line network, which is a complex combination to attack at the same time. We want to address the fact that the optimisation problem is a hard problem since the feasible solutions are not clearly defined.
The method we use to approximate the solution is based on a heuristic method, the Local Search, and then we combine it with the Minimum Mean-weight Cycle on a graph.
The local search method comes first to minimise the operational cost and then followed by the minimum mean-weight cycle algorithm to find some express lines to decrease the average value of travel time. We optimise the solution by performing both steps alternately.
At the end, we discuss the result from numerical experiments of the method with two small-scale city road networks, one with 10 stations and another one with 20 stations. | |
