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 the problem of finding a (3,9)-cage
by: P. K. Wong
Published: (1985-01-01) -
CONDITIONS FOR GRAPHS ON n VERTICES WITH THE SUM OF DEGREES OF ANY TWO NONADJACENT VERTICES EQUAL TO n-2 TO BE A HAMILTONIAN GRAPH
by: Nhu An Do, et al.
Published: (2024-02-01) -
Hamiltonian-connected graphs and their strong closures
by: Pak-Ken Wong
Published: (1997-01-01) -
Paving a route: Transportation and Aymara politics between Bolivia and Chile
by: Alejandro Garcés, et al.
Published: (2023-10-01) -
EDWF-MTTF-based heuristic scheduling algorithm in time-sensitive networks
by: Chuanhuang LI, et al.
Published: (2024-02-01)