An Efficient Approach for Solving Time-Dependent Shortest Path Problem under Fermatean Neutrosophic Environment
Efficiently determining optimal paths and calculating the least travel time within complex networks is of utmost importance in addressing transportation challenges. Several techniques have been developed to identify the most effective routes within graphs, with the Reversal Dijkstra algorithm servin...
Gardado en:
| Principais autores: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
University of New Mexico
2024-01-01
|
| Series: | Neutrosophic Sets and Systems |
| Assuntos: | |
| Acceso en liña: | https://fs.unm.edu/NSS/FermateanNeutrosophic6.pdf |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|