The optimal route search in Bengaluru city transport using Hamilton circuit algorithm
Traffic congestion is a common transportation issue all over the globe, especially in India's large cities. One of the primary causes of traffic congestion is the sheer volume of private vehicles that travel on city streets and the extensive use of public transportation. The lack of additional...
Saved in:
| Main Authors: | Parkavi S, Parthiban A |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2025-02-01
|
| Series: | Heliyon |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2405844025008990 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A note on hamiltonicity conditions of the coprime and non-coprime graphs of a finite group
by: Muhammad Nurul Huda
Published: (2024-07-01) -
On coefficients of circuit polynomials and characteristic polynomials
by: E. J. Farrell
Published: (1985-01-01) -
Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
by: Alexander V. Korostil, et al.
Published: (2021-03-01) -
Image segmentation with a multilevel threshold using backtracking search optimization algorithm
by: Hather Ibraheem Abed
Published: (2020-03-01) -
Optimal Routing in Urban Road Networks: A Graph-Based Approach Using Dijkstra’s Algorithm
by: Zarko Grujic, et al.
Published: (2025-04-01)