Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
The Application of Genetic Algorithm in Vehicle Routing Problem
ISECS '08 Proceedings of the 2008 International Symposium on Electronic Commerce and Security
A cultural algorithm for the urban public transportation
HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II
| Hi-index | 0.00 |
A public transport route planner provides for citizens and tourists information about available public transport journeys. The heart of such systems are effective methods for solving itinerary planning problem in a multi-modal urban public transportation networks. This paper describes a new evolutionary algorithm solving a certain version of this problem. The method returns the set of k-journeys that lexicographically optimize two criteria's: total travel time and number of transfers. Proposed algorithm was compared with two another solutions for itinerary planning problem. This comparison is prepared on the base of experimental results which were performed on real-life data - Warsaw city public transport network. Conducted experiments confirm high effectiveness of the proposed method in comparison with two another known solutions for considered problem.