An Evolutionary Solution for Multimodal Shortest Path Problem in Metropolises

This paper addresses the problem of time-dependent shortest multimodal path in complex and large urban areas. This problem is one of the important and practical problems in several fields such as transportation, and recently attracts the research focus due to developments in new application areas. An adapted evolutionary algorithm, in which chromosomes with variable lengths and particularly defined evolutionary stages were used, was employed to solve the problem. The proposed solution was tested over the dataset of city of Tehran. The evaluation consists of computing shortest multimodal path between 250 randomly selected pairs of origins and destination points with different distances. It was assumed that three modes of walking, bus, and subway are used to travel between points. Moreover, some tests were conducted over the dataset to illustrate the robustness of method. The experimental results and related indices such as convergence plot show that the proposed algorithm can find optimum path according to applied constraints