A User Preferable K-Shortest Path Algorithm for Intermodal Network (original) (raw)
Related papers
Procedia - Social and Behavioral Sciences, 2014
In this paper we deal with shortest paths in the context of urban passenger mobility. In particular, we present a novel shortest path algorithm on multimodal networks, where the objective function may consist of different components, such as monetary cost, time and discomfort paid by users when changing modality. The key feature of the proposed algorithm is that it focuses on the modal change nodes and forces as much as possible routings through those nodes that could be profitably selected as commuting points. Since modal change nodes play a relevant role in the choice of the route, we evaluate the performance of such nodes with the aim of increasing their attractiveness, thus minimizing the generalized cost of the multimodal routes. The underlying model fits in the class of multi-weighted graph approach, where here weights are associated with both arcs and nodes of the multimodal digraph. Results of a computational experimentation aimed at validating the proposed algorithm with different sized multimodal networks are reported, together with a case study related to the city of Genoa, Italy. Finally, a sensitivity analysis on the arc weight is performed, and related preliminary computational results are given.
Identification of Optimum Shortest Path using Multipath Dijkstra’s Algorithm Approach
International Journal of Advanced Remote Sensing and GIS, 2017
Many route mappings were done with the help of API of Google maps but do not provide geospatial Routing functionality like overlay, interpolation etc. This project aims to find the shortest path between two or more points by using multipath Dijkstra's algorithm via PgRouting. Dijkstra's algorithm provides advantages on time required for selecting the network and building graph over the algorithm speed. In that case, A-star is always preferred over Dijkstra's algorithm. Dijkstra's algorithm has a computational complexity of O (n2) with a network consisting of n nodes. This Project explains the steps to prepare the data by converting shape files into SQL files and import it into PostgreSQL/PostGIS, make routing topology, indexes, and queries, dynamically assign costs by PgRouting, and write a custom function 'plpgsql' using PL/pgSQL (Procedural programming structured query language) supported by PostgreSQL. This report provides all geospatial functions with dynamic support via PgRouting which allows many clients, like Quantum GIS and Udig, represents client visualization for modification of data and attributes for instantly reflecting changes via PgRouting. PgRouting Provides a framework by which cost parameters are calculated dynamically. This paper specifies the routing of Varanasi city roads using Dijkstra's algorithm and PgRouting. This article focuses on dynamic routing on the complex network like Varanasi City over the web mapping application so that Client can easily find their shortest route along with Cost parameters.
Establishment Of The Shortest Route – A Prototype For Facilitation In Road Network
International Journal of Scientific & Technology Research, 2016
Calculating the shortest path between two locations in a road network is a significant problem in network analysis. Roads play a pivotal role in day to day activities of masses live in places and areas. They travel for various purposes that are, to study, to work, to shop and to supply their goods and the like, from one place to another place. Even in this modern era, roads remain one of the mediums used most frequently for travel and transportation. Being ignorant of the shortest routes people sometimes have to travel long distances, consume extra precious time, money and bare undesirable mental stress. Karachi is the second most populated and the seventh biggest city of the world. It is the central place of Pakistan, which is famous for industry, banking, trade and economic activity, and there are places which frequently visit by the inhabitants for their miscellaneous requirements. Federal Board of Revenue (FBR) is one of the departments that deal with taxation and revenue genera...
Analysis and Design of Public Transport Route Planner: Dijkstras Algorithm
International Journal for Research in Applied Science & Engineering Technology (IJRASET), 2022
Nowadays, vehicle tracking is extremely useful for many things: personal vehicle security, public transportation management, fleet management, and mass transit management, among others. It is common for passengers to use public transport applications that propose the best route for them. Users may prefer a different route for public transportation depending on their preferences. Most users find the shortest route based on this criteria when choosing an ideal route. The shortest path is frequently determined using Dijkstra's Algorithm, according to our research. For this project, we designed a GIS application to improve public transportation using Geographic Information Systems (GIS). Based on the system's real-time location tracking, Dijkstra's algorithm provides taxis with the appropriate category for passengers. With this system, taxi drivers will not have to drive across town to pick up passengers, as confirmations will be sent directly to their phones. If you frequently have to wait for a taxi that has been booked, this will be helpful, especially if you are frequently left waiting.
Background:Road transportation is central to everyday life, but is often hampered by traffic congestion in developing countries. This paper proposes a routing system that promises to reduce traffic congestion on the road by constantly suggesting the optimal alternate routes to motorists while considering the condition of the road segments. Materials and Methods:The optimal alternate route is computed by the system based on the digitized map and the geographic information system of the city that are stored in the database. Secondary data for the research was obtained from Lagos state ministry of transportation. Results:The experimental results show that out of every 10 samples, the proposed approach differs only in two cases. On inspecting each case, it was observed that the approach reported in this work differs from the existing approach whenever there is a bad road segment. The consideration of the bad segment by the reported approach accounts for the optimal routing. It was also observed that the computational time for determining the shortest route was much lower using the proposed approach. Conclusion: The results show that computation based on shortest distance alone does not guarantee fastest arrivals. Parameters such as state of the road and road congestion contribute immensely.
Optimizing Intermodal Trip Planning Decisions in Interurban Networks
Transportation Research Record, 2003
Travel and tourism activities and trip planning decisions involving the interoperability complexities and interdependencies introduced by intermodal / interurban transportation networks constitute an ample opportunity area for deploying the state-of-the-art mobile Internet technologies. As a matter of fact, it is becoming increasingly needed to provide travelers with real time information to assist them pre-plan or re-plan their transport / travel activities or particular trip elements during their trip (while being on the move). Trip planning decisions, either before or during the trip realization, although constituting a derived demand ("pushed" by demand for tourism activities), they represent the most critical "chain" of the decision making process on the grounds that they eventually determine the feasibility and the realization of the whole travel activity. From a different perspective, terminal operators, regional authorities and other transport / tourism organizations exhibit a vast interest and actively pursue alternative ways of dealing with the requirements of the demand for travel and tourism services. In this context, an integrated system providing value added logistical services related to travel and tourism, the "World in your H@nds on the Move -WH@M" system, has been implemented to support and optimize the trip planning process.
Multimodal transportation networks: Object modeling and K-multimodal shortest path
The objective of this paper is to develop, implement and test a solution to the problem of long-run planning of transit on multimodal network. It presents the general results found, and algorithm used along this work. The aim is to provide a tool to detect facilities of using different modes of transport through multimodal network. Routings may include distinct combination of rail, and route. Geographic Information Systems (GIS) was invaluable in the costeffective construction and maintenance of this work and subsequent validation of mode sequences and paths selections. Attention is paid to multimodal path operator as well as to the use of GIS-transit planning.
Intermodal transportation network analysis-a GIS application
2000 10th Mediterranean Electrotechnical Conference. Information Technology and Electrotechnology for the Mediterranean Countries. Proceedings. MeleCon 2000 (Cat. No.00CH37099), 2000
A framework is presented which may be used to analyze and evaluate intermodal networks. An intermodal network can be defined as an integrated transportation system consisting of two or more modes. Modes on intermodal networks are connected through facilities which allow travelers and/or freight to transfer from one mode to another during a trip from an origin to a destination. The model may be used in the transportation planning field to make predictions regarding future network activity in terms of traffic volumes and travel costs, to evaluate alternative policies for mitigating congestion and reducing energy consumption and air pollution, and to aid the decision making process in terms of future transportation plans. To expedite and facilitate the effort of detailed intermodal network representation and analysis, the network model is interfaced with a Geographic Information System (GIS). This interface allows the user to take advantage of available sources of information on the physical components of the network, store the results of the proposed models in a GIS environment and display them in a spatial data format, and display several layers of information and create thematic maps to support planning and policy initiatives. The importance of the proposed interface as a delivery tool lies in the power of visual images to communicate technical information to non-technical people and simplify concepts. It may be employed to educate diverse audiences on issues such as how out travel habits affect the effectiveness of transportation systems, and the role of policy and decision-making in transportation.
2014
This paper has illustrated how Geographic Information Systems (GIS), Network and multi criteria Analysis (MCA) can be utilized for determining suitable location of routes for Khartoum city, that involved managing a variety of data sets from different sources and at different scales such as: educational, financial, hospitals, business and governmental institutions as well as places of entertainment, it identified as being extremely significance destination points of service for the path and thus established as parameters. Numerous destination points of service were highlighted and categorized under one of the main groups, each main group given a value and weighted against other groups to establish an order of superiority and inferiority. A path between two points was obtained. The start and destination point were selected randomly without any preknowledge of the area. Keywords– GIS, MCA, Analysis and Information Systems Network
Journal of Physics: Conference Series, 2019
City transportation is a motorized vehicle with a fixed line that connects one area to another in one city. Information about the city transportation route in Semarang has been provided by the Department of Transportation of Semarang city which contains the code and route. The development of science regarding the route search algorithm method or the shortest path can be used to support the path search based on the city transportation route. A geographical information system is a system designed to work using data that has spatial reference spatial information. At this time the technology has not been applied optimally to support the search for the shortest route of urban transport based on the city transportation route. This study aims to develop the application of the shortest pathway determination based on the city transportation route in Semarang using the Floyd Warshall algorithm based on Geographic Information System. City transportation route data can be implemented in graph f...