SciELO - Scientific Electronic Library Online

 
vol.38 número1La gestión de capital humano en empresas del sector biotecnológico cubanoProcedimiento para modelar recursos restrictivos en el sistema logístico de empresas comercializadoras índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Revista

Articulo

Indicadores

  • No hay articulos citadosCitado por SciELO

Links relacionados

  • No hay articulos similaresSimilares en SciELO

Compartir


Ingeniería Industrial

versión On-line ISSN 1815-5936

Resumen

RODRIGUEZ-PUENTE, Rafael  y  LAZO-CORTES, Manuel. Shortest path search using reduced graphs. Ing. Ind. [online]. 2017, vol.38, n.1, pp.32-42. ISSN 1815-5936.

One of the widely studied ptimization problems consistsin finding shortest paths from a source to a destination. Classical algorithmsfor solving this problemare not scalable. Several approaches have been proposed, using heuristics, to reduce the run time. These approaches introduce anerrorand, consequently, they do not guaranteean optimum value inall cases. In this paper we propose agraph reductionalgorithm without loss of information, which helps to reduce the run time of algorithms. In addition, we propose a modification to the Dijkstraalgorithmto be used on reduced graphs, guaranteeing an optimalresult in all cases. Besides, a comparison between the run time of the proposed algorithms and Dijkstraand A* algorithms is presented. This comparison shows that it ispossible to obtain an optimal pathin a similar time, and even in less time, than those obtained by heuristic algorithms.

Palabras clave : Dijkstra algorithm; shortest path search; graph reduction.

        · resumen en Español     · texto en Español     · Español ( pdf )

 

Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons