|
چکیده
|
Routing in a multimodal urban public transportation network, according to the user's preferences, can be considered as a multi-objective optimisation problem. Solving this problem is a complicated task due to the different and incompatible objective functions, various modes in the network, and the large size of the network. In this research, two optimisation algorithms are considered for solving this problem. The multi-colony and multi-pheromone Ant Colony Optimisation (ACO) algorithms are two different modes of the Multi-Objective ACO (MOACO) algorithm. Moreover, according to the acquired information, the algorithms implemented in the public transportation network of Tehran consist of four modes. In addition, three objective functions have been simultaneously considered as the problem's objectives. The algorithms are run with different initial parameters and afterwards, the results are compared and evaluated based on the different obtained routes and with the aid of the convergence and repeatability tests, diversity and convergence metrics.
|