SOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS

Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the costs of the arcs are fuzzy values. Metropolitantransportation systems are multimodal in that they usually containmultiple modes, such as bus, metro, and monorail. The proposedalgorithm is based on the path algebra and dioid of k-shortestfuzzy paths. The approach considers the number of mode changes,the correct order of the modes used, and the modeling of two-waypaths. An advantage of the method is that there is no restrictionon the number and variety of the services to be considered. Totrack the algorithm step by step, it is applied to apseudo-multimodal network.

Keywords:

Transportation , Multimodal , Shortest path , Dioid , Fuzzy cost , Graph , GIS