The challenge of determining the shortest path within a multimodal transportation network involves identifying the most efficient travel route while considering various interconnected modes of transportation, such as roads, railways, and public transit. This problem becomes increasingly complex when numerous criteria and modes are involved, complicating the decision-making process. This study proposes a novel approach to computing the shortest path in multimodal networks, focusing on four modes of transportation: metro, trams, buses, and taxis. The optimization criteria include distance, travel time, and monetary cost. The proposed method utilizes a new metaheuristic called Optimization by Morphological Filters (OMF), inspired by image processing techniques. This approach was compared with the Genetic Algorithms (GA) and the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). Experiments were carried out using graph models of multimodal transport networks that closely resemble real-world scenarios varying in size. Furthermore, the proposed method was evaluated using a real network from the city of Lyon, France. The results demonstrate that the OMF approach performs well in terms of convergence to optimal solutions and computation time.
Read full abstract