The Optimized path for the public transportation of Incheon in South Korea

Path-finding is one of the most popular subjects in the field of computer science. Pathfinding strategies determine a path from a given coordinate to another. The focus of this paper is on finding the optimal path for the bus transportation system based on passenger demand. This study is based on bus stations in Incheon, South Korea, and we show that our modified A* algorithm performs better than other basic pathfinding algorithms such as the Genetic and Dijkstra. Our proposed approach can find the shortest path in real-time even for large amounts of data(points).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/14/2017

Cellular Automata Applications in Shortest Path Problem

Cellular Automata (CAs) are computational models that can capture the es...
research
08/26/2020

Two-stage optimization of urban rail transit formation and real-time station control at comprehensive transportation hub

This paper tries to discuss two strategies of dealing with this complex ...
research
04/09/2015

An Optimized Hybrid Approach for Path Finding

Path finding algorithm addresses problem of finding shortest path from s...
research
05/11/2019

A New Shortest Path Algorithm Generalized on Dynamic Graph for Commercial Intelligent Navigation for Transportation Management

Dynamic graph research is an essential subject in Computer Science. The ...
research
05/30/2014

The Shortlist Method for Fast Computation of the Earth Mover's Distance and Finding Optimal Solutions to Transportation Problems

Finding solutions to the classical transportation problem is of great im...
research
01/09/2020

Assignment-based Path Choice Estimation for Metro Systems Using Smart Card Data

Urban rail services are the principal means of public transportation in ...
research
01/10/2022

Finding Shortest Path on a Terrain Surface by Using Finite Element Method

The solution of the shortest path problem on a surface is not only a the...

Please sign up or login with your details

Forgot password? Click here to reset