Solving the shortest path Problem in an interval-valued Neutrosophic Pythagorean environment using an enhanced A* search algorithm
The A* search algorithm is widely utilized to evaluate the shortest path in a given network. However, in a traditional A* search algorithm, the nodes are assumed to have crisp values, i.e., a single value. This assumption may not hold in many real-world scenarios where uncertainty or ambiguity is in...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of New Mexico
2025-02-01
|
| Series: | Neutrosophic Sets and Systems |
| Subjects: | |
| Online Access: | https://fs.unm.edu/NSS/ShortestPath20.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|