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

Soroor Malekmohammadi faradunbeh, Hongle Li, Mangkyu Kang, Choongjae Iim
9/18/2023
physics.soc-phcs.AI

No confident code implementation found for this paper.

Abstract

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).

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{faradunbeh2023optimized,
  title  = {The Optimized path for the public transportation of Incheon in South Korea},
  author = {Soroor Malekmohammadi faradunbeh and Hongle Li and Mangkyu Kang and Choongjae Iim},
  year   = {2023},
  eprint = {2309.10006},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2309.10006v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2309.10006.svg)](https://codeofpaper.com/paper/2309.10006)

Discussion