شماره ركورد كنفرانس :
4781
عنوان مقاله :
Solving shortest path problem with neural network
پديدآورندگان :
Eshaghnezhad Mohammad Department of Applied Mathematics, Ferdowsi University of Mashhad , Rahbarnia Freydoon Department of Applied Mathematics, Ferdowsi University of Mashhad , Effati Sohrab Department of Applied Mathematics, Ferdowsi University of Mashhad , Mansoori Amin Department of Applied Mathematics, Ferdowsi University of Mashhad
كليدواژه :
Shortest path problem , linear optimization problem , recurrent neural network , globally exponentially stable.
عنوان كنفرانس :
يازدهمين كنفرانس بين المللي انجمن ايراني تحقيق در عمليات
چكيده فارسي :
In this paper, we propose a recurrent neural network model for solving the shortest path (SP) problem. Our focus on the paper is to give a novel one-layer structure recurrent neural network model to solve the SP. Moreover, the proposed model is proved to be globally stable. Finally, several numerical simulations are given to show the performance of the proposed approach.
