dor_id: 45789

506.#.#.a: Público

590.#.#.d: Los artículos enviados a la revista "Journal of Applied Research and Technology", se juzgan por medio de un proceso de revisión por pares

510.0.#.a: Scopus, Directory of Open Access Journals (DOAJ); Sistema Regional de Información en Línea para Revistas Científicas de América Latina, el Caribe, España y Portugal (Latindex); Indice de Revistas Latinoamericanas en Ciencias (Periódica); La Red de Revistas Científicas de América Latina y el Caribe, España y Portugal (Redalyc); Consejo Nacional de Ciencia y Tecnología (CONACyT); Google Scholar Citation

561.#.#.u: https://www.icat.unam.mx/

650.#.4.x: Ingenierías

336.#.#.b: article

336.#.#.3: Artículo de Investigación

336.#.#.a: Artículo

351.#.#.6: https://jart.icat.unam.mx/index.php/jart

351.#.#.b: Journal of Applied Research and Technology

351.#.#.a: Artículos

harvesting_group: RevistasUNAM

270.1.#.p: Revistas UNAM. Dirección General de Publicaciones y Fomento Editorial, UNAM en revistas@unam.mx

590.#.#.c: Open Journal Systems (OJS)

270.#.#.d: MX

270.1.#.d: México

590.#.#.b: Concentrador

883.#.#.u: https://revistas.unam.mx/catalogo/

883.#.#.a: Revistas UNAM

590.#.#.a: Coordinación de Difusión Cultural

883.#.#.1: https://www.publicaciones.unam.mx/

883.#.#.q: Dirección General de Publicaciones y Fomento Editorial

850.#.#.a: Universidad Nacional Autónoma de México

856.4.0.u: https://jart.icat.unam.mx/index.php/jart/article/view/142/139

100.1.#.a: Szücs, G.

524.#.#.a: Szücs, G. (2015). Decision Support for Route Search and Optimum Finding in Transport Networks under Uncertainty. Journal of Applied Research and Technology; Vol. 13 Núm. 1. Recuperado de https://repositorio.unam.mx/contenidos/45789

245.1.0.a: Decision Support for Route Search and Optimum Finding in Transport Networks under Uncertainty

502.#.#.c: Universidad Nacional Autónoma de México

561.1.#.a: Instituto de Ciencias Aplicadas y Tecnología, UNAM

264.#.0.c: 2015

264.#.1.c: 2015-02-01

653.#.#.a: Dijkstra"s algorithm; Dempster-Shafer theory; transportation planning; routing; uncertainty; Wardrop equilibrium; decision support system; rule base

506.1.#.a: La titularidad de los derechos patrimoniales de esta obra pertenece a las instituciones editoras. Su uso se rige por una licencia Creative Commons BY-NC-SA 4.0 Internacional, https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode.es, para un uso diferente consultar al responsable jurídico del repositorio por medio del correo electrónico gabriel.ascanio@icat.unam.mx

884.#.#.k: https://jart.icat.unam.mx/index.php/jart/article/view/142

001.#.#.#: 074.oai:ojs2.localhost:article/142

041.#.7.h: eng

520.3.#.a: The aim of this paper is to find solution for route planning in road network for a user, and to find the equilibrium in the path optimization problem, where the roads have uncertain attributes. The concept is based on the Dempster-Shafer theory and Dijkstra"s algorithm, which help to model the uncertainty and to find the best route, respectively. Based on uncertain influencing factors an interval of travel time (so called cost interval) of each road can be calculated. An algorithm has been outlined for determining the best route comparing the intervals and using decision rules depending on the user’s attitude. Priorities can be defined among the rules, and the constructed rule based mechanism for users’ demands is great contribution of this paper. The first task is discussed in more general in this paper, i.e. instead of travel time a general cost is investigated for any kind of network. At the solution of the second task, where the goal is to find equilibrium in transport network at case of uncertain situation, the result of the first task is used. Simulation tool has been used to find the equilibrium, which gives only approximate solution, but this is sufficient and appropriate solution for large networks. Furthermore this is built in a decision support system, which is another contribution of this work. At the end of the paper the implementation of the theoretical concept is presented with a test bed of a town presenting effects of different uncertain influencing factors for the roads.

773.1.#.t: Journal of Applied Research and Technology; Vol. 13 Núm. 1

773.1.#.o: https://jart.icat.unam.mx/index.php/jart

022.#.#.a: ISSN electrónico: 2448-6736; ISSN: 1665-6423

310.#.#.a: Bimestral

264.#.1.b: Instituto de Ciencias Aplicadas y Tecnología, UNAM

doi: https://doi.org/10.1016/S1665-6423(15)30011-0

harvesting_date: 2023-11-08 13:10:00.0

856.#.0.q: application/pdf

last_modified: 2024-03-19 14:00:00

license_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode.es

license_type: by-nc-sa

_deleted_conflicts: 2-12f53c364890e043bc79df11264bd0df

No entro en nada

No entro en nada 2

Artículo

Decision Support for Route Search and Optimum Finding in Transport Networks under Uncertainty

Szücs, G.

Instituto de Ciencias Aplicadas y Tecnología, UNAM, publicado en Journal of Applied Research and Technology, y cosechado de Revistas UNAM

Licencia de uso

Procedencia del contenido

Cita

Szücs, G. (2015). Decision Support for Route Search and Optimum Finding in Transport Networks under Uncertainty. Journal of Applied Research and Technology; Vol. 13 Núm. 1. Recuperado de https://repositorio.unam.mx/contenidos/45789

Descripción del recurso

Autor(es)
Szücs, G.
Tipo
Artículo de Investigación
Área del conocimiento
Ingenierías
Título
Decision Support for Route Search and Optimum Finding in Transport Networks under Uncertainty
Fecha
2015-02-01
Resumen
The aim of this paper is to find solution for route planning in road network for a user, and to find the equilibrium in the path optimization problem, where the roads have uncertain attributes. The concept is based on the Dempster-Shafer theory and Dijkstra"s algorithm, which help to model the uncertainty and to find the best route, respectively. Based on uncertain influencing factors an interval of travel time (so called cost interval) of each road can be calculated. An algorithm has been outlined for determining the best route comparing the intervals and using decision rules depending on the user’s attitude. Priorities can be defined among the rules, and the constructed rule based mechanism for users’ demands is great contribution of this paper. The first task is discussed in more general in this paper, i.e. instead of travel time a general cost is investigated for any kind of network. At the solution of the second task, where the goal is to find equilibrium in transport network at case of uncertain situation, the result of the first task is used. Simulation tool has been used to find the equilibrium, which gives only approximate solution, but this is sufficient and appropriate solution for large networks. Furthermore this is built in a decision support system, which is another contribution of this work. At the end of the paper the implementation of the theoretical concept is presented with a test bed of a town presenting effects of different uncertain influencing factors for the roads.
Tema
Dijkstra"s algorithm; Dempster-Shafer theory; transportation planning; routing; uncertainty; Wardrop equilibrium; decision support system; rule base
Idioma
eng
ISSN
ISSN electrónico: 2448-6736; ISSN: 1665-6423

Enlaces