Algorithms for Finding Shortest Paths in Networks with Vertex Transfer Penalties
In this paper we review many of the well-known algorithms for solving the shortest path problem in edge-weighted graphs. We then focus on a variant of this problem in which additional penalties are incurred at the vertices. These penalties can be used to model things like waiting times at road junct...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
MDPI AG
2020-10-01
|
| Colección: | Algorithms |
| Materias: | |
| Acceso en línea: | https://www.mdpi.com/1999-4893/13/11/269 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|