A multi-criteria route planning model based on fuzzy preference degrees of stops

Display Omitted Definitions of a fuzzy neighborhood both stops and lines set are introduced.Definition of a fuzzy preference degree of a stop is introduced.Definition of a fuzzy connectivity degree of a route is introduced.A fuzzy route planning model for public transportation network is introduced.A heuristic algorithm for finding -optimal solutions of the problem is proposed. Integrated utilization of new technologies such as smart phones, tablet devices, and satellite maps has entered our daily lives recently. Nevertheless, many new applications are being developed mostly based on these technologies. The optimal route planning, which makes use of the public transport network structure between any selected origin and destination points, is one of the interesting applications among them. Route planning applications used today mostly focus on the aspects such that passengers use nearest stops around origin and destination geographical points, or use set of stops around these points within some walking radius. In these applications, which work on the classical (crisp) logic base, all stops on the walking distance have the same preference degree. However, in this study a novel fuzzy model is proposed which also takes into account preferences such as the stops activity, and count of transit lines passing through the stop besides the walking distance. Using all these three preferences, aggregated fuzzy preference degrees of stops are calculated. The optimum routes between any origin and destination pair are constructed using feasible transfer points, which are chosen among the alternatives having the highest preference degrees overall. Fuzzy neighborhood relations such as stop-stop, stop-line, and line-line are introduced in order to employ in preference degree evaluations.Apart from the aggregated degree of the preferences mentioned above, we also consider to minimize the total number of transit stops travelled on any route for establishing optimal routes. This additional preference can be described the time duration spent on transport vehicles, such as buses, trains, subways or ferries. Therefore, we propose a two-criteria route-planning problem in this study, where we try to maximize the aggregated preference degree of a route and to minimize the number of stops used on a route. Fuzzy optimal solutions for this problem are constructed via -level solutions of the fuzzy problem and a heuristic algorithm providing these solutions is proposed. This model and its algorithm can be considered as an optimal route search engine for mobile applications that could be used by urban public transport passengers.

[1]  C. von Ferber,et al.  Modeling Metropolis Public Transport , 2007, 0709.3203.

[2]  Peter Sanders,et al.  Engineering Route Planning Algorithms , 2009, Algorithmics of Large and Complex Networks.

[3]  Mikkel Thorup Compact oracles for reachability and approximate distances in planar digraphs , 2004, JACM.

[4]  Efendi N. Nasibov,et al.  Robustness of density-based clustering methods with various neighborhood relations , 2009, Fuzzy Sets Syst..

[5]  Ronald J. Gutman,et al.  Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks , 2004, ALENEX/ANALC.

[6]  Mohammad Reza Malek,et al.  SOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS , 2010 .

[7]  Giovanni Storchi,et al.  Shortest viable path algorithm in multimodal networks , 2001 .

[8]  Chao-Lin Liu,et al.  Path-planning algorithms for public transportation systems , 2001, ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585).

[9]  Erik Carlsson,et al.  Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns , 2010, ESA.

[10]  Mehdi Ghatee,et al.  Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms , 2012 .

[11]  Chao-Lin Liu Best-path planning for public transportation systems , 2002, Proceedings. The IEEE 5th International Conference on Intelligent Transportation Systems.

[12]  Sohail S. Chaudhry,et al.  Finding the K shortest paths in a schedule-based transit network , 2012, Comput. Oper. Res..

[13]  Dorothea Wagner,et al.  Engineering multilevel overlay graphs for shortest-path queries , 2009, JEAL.

[14]  Juliana Verga,et al.  Using the fuzzy sets theory in the multimodal transport network problem , 2013, 2013 Joint IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS).

[15]  R. Sinnott Virtues of the Haversine , 1984 .

[16]  Efendi N. Nasibov,et al.  Linear aggregation with weighted ranking , 2010, Automatic Control and Computer Sciences.

[17]  Christos D. Zaroliagis,et al.  Efficient models for timetable information in public transportation systems , 2008, JEAL.

[18]  Haim Kaplan,et al.  Reach for A*: Efficient Point-to-Point Shortest Path Algorithms , 2006, ALENEX.

[19]  E. Nasiboglu,et al.  Origin-destination matrix generation using smart card data: Case study for Izmir , 2012, 2012 IV International Conference "Problems of Cybernetics and Informatics" (PCI).

[20]  Frank Schulz,et al.  High-Performance Multi-Level Graphs ∗ , 2006 .

[21]  S. Travis Waller,et al.  Parametric search and problem decomposition for approximating Pareto-optimal paths , 2012 .

[22]  Esmaile Khorram,et al.  Preemptive priority-based algorithms for fuzzy minimal cost flow problem: An application in hazardous materials transportation , 2009, Comput. Ind. Eng..

[23]  Hong Sun,et al.  The K Shortest Transit Paths Choosing Algorithm in Stochastic Transit Network , 2008, RSKT.

[24]  V. Palchykov,et al.  Public transport networks: empirical analysis and modeling , 2008, 0803.3514.

[25]  E. Molin,et al.  Use and Effects of Advanced Traveller Information Services (ATIS): A Review of the Literature , 2006 .

[26]  Efendi N. Nasibov,et al.  A new unsupervised approach for fuzzy clustering , 2007, Fuzzy Sets Syst..

[27]  Piet Rietveld,et al.  The Desired Quality of Integrated Multimodal Travel Information in Public Transport: Customer Needs for Time and Effort Savings , 2007 .

[28]  Sybil Derrible,et al.  Applications of Graph Theory and Network Science to Transit Network Design , 2011 .

[29]  Dorothea Wagner,et al.  Accelerating Multi-modal Route Planning by Access-Nodes , 2009, ESA.

[30]  Daniel Delling,et al.  Round-Based Public Transit Routing , 2015 .

[31]  Jolanta Koszelew,et al.  An Evolutionary Algorithm for the Urban Public Transportation , 2011, ICCCI.

[32]  Sumit Ghosh,et al.  Intelligent Transportation Systems: Smart and Green Infrastructure Design , 2010 .

[33]  Joseph M. Sussman,et al.  Perspectives on Intelligent Transportation Systems (ITS) , 2005 .

[34]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[35]  Anna Kramers,et al.  Designing next generation multimodal traveler information systems to support sustainability-oriented decisions , 2014, Environ. Model. Softw..

[36]  E. N. Nasibov A robust algorithm for solution of the fuzzy clustering problem on the basis of the fuzzy joint points method , 2008 .