Abstract
In the present research, we are going to obtain the solution of the fuzzy shortest path (FSP) problem. According to our search in the scientific reported papers, this is the first scientific attempt for resolving of FSP by artificial neural network model which has the global exponential stability property. Here, by reformulating the original problem to an interval program and then weighting problem, the Karush–Kuhn–Tucker (KKT) optimality conditions are suggested as a new strategy for the problem. Moreover, we apply the KKT conditions to proposed an artificial neural network model as a high-performance tool to provide the solution of the problem. In continuous, the global convergence and the global exponential stability of the model were approved in this research. In the final step, several numerical examples are presented to depict the performance of the method. Reported results were compared with some other published papers.
Similar content being viewed by others
References
Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs
Antonio JK, Huang GM, Tsai WK (1992) A fast distributed shortest path algorithm for a class of hierarchically clustered data networks. IEEE Trans Comput 41(6):710–724
Bazaraa MS, Shetty C, Sherali HD (1990) Linear programming and network flows. John Wiley and Sons, New York
Bodin L, Golden BL, Assad A, Ball M (1983) Routing and scheduling of vehicles and crews: the state of the art. Comput Oper Res 10(2):63–211
Deng Y, Chen Y, Zhang Y, Mahadevan S (2012) Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment. Appl Soft Comput 12:1231–1237
Doua Y, Zhu L, Wang HS (2012) Solving the fuzzy shortest path problem using multi-criteria decision method based on vague similarity measure. Appl Soft Comput 12:1621–1631
Dubois D, Prade H (1980) Fuzzy sets and systems: theory and applications. Academic Press, New York
Effati S, Mansoori A, Eshaghnezhad M (2015) An efficient projection neural network for solving bilinear programming problems. Neurocomputing 168:1188–1197
Effati S, Ranjbar M (2011) A novel recurrent nonlinear neural network for solving quadratic programming problems. Appl Math Model 35(4):1688–1695
Ephremides A, Verdu S (1989) Control and optimization methods in communication network problems. IEEE Trans Autom Control 34(9):930–942
Eshaghnezhad M, Effati S, Mansoori A (2017) A neurodynamic model to solve nonlinear Pseudo-Monotone projection equation and its applications. IEEE Trans Cybern 47(10):3050–3062
Fischer F, Helmberg C (2014) Dynamic graph generation for the shortest path problem in time expanded networks. Math Program 143(1):257–297
Friedman M, Ma M, Kandel A (1999) Numerical solution of fuzzy differential and integral equations. Fuzzy Set Syst 106:35–48
García MS, Lamata MT (2005) The fuzzy sets in maintenance process. In: Proceedings of the European society for fuzzy logic and technology
Golovin D, Goyal V, Polishchuk V, Ravi R, Sysikaski M (2015) Improved approximations for two-stage min-cut and shortest path problems under uncertainty. Math Program 149(1):167–194
Hernandes F, Lamata MT, Verdegay JL, Yamakami A (2007) The shortest path problem on networks with fuzzy parameters. Fuzzy Sets Syst 158:1561–1570
Ji X, Iwamura K, Shao Z (2007) New models for shortest path problem with fuzzy arc lengths. Appl Math Model 31:259–269
Jun S, Shin KG (1991) Shortest path planning in distributed workspace using dominance relation. IEEE Trans Robot Autom 7(3):342–350
Khalil HK (1996) Nonlinear systems. Prentice-Hall, Michigan
Klein CM (1991) Fuzzy shortest paths. Fuzzy Sets Syst 39:27–41
Lawler EL (1976) Combinatorial optimization: networks and matroids. Holt, Rinehart and Winston, New York
Lin K, Chen M (1994) The fuzzy shortest path problem and its most vital arcs. Fuzzy Sets Syst 58:343–353
Lin PL, Chang S (1993) A shortest path algorithm for a nonrotating object among obstacles of arbitrary shapes. IEEE Trans Syst Man Cybern 23(3):825–833
Liu ST, Kao C (2004) Network flow problems with fuzzy arc lengths. IEEE Trans Syst Man Cybern Part B Cybern 34:765–769
Liou T-S, Wang M-J (1992) Ranking fuzzy numbers with integral interval. Fuzzy Sets Syst 50:247–255
Miettinen KM (1999) Non-linear multiobjective optimization. Kluwer Academic, Dordrecht
Mahdavi I, Nourifar R, Heidarzade A, Amiri NM (2009) A dynamic programming approach for finding shortest chains in a fuzzy network. Appl Soft Comput 9:503–511
Mansoori A, Effati S, Eshaghnezhad M (2017) An efficient recurrent neural network model for solving fuzzy non-linear programming problems. Appl Intell 46:308–327
Mansoori A, Effati S, Eshaghnezhad M (2018) A neural network to solve quadratic programming problems with fuzzy parameters. Fuzzy Optim Decis Mak 17(1):75–101
Mansoori A, Erfanian M (2018) A dynamic model to solve the absolute value equations. J Comput Appl Math 333:28–35
Mansoori A, Eshaghnezhad M, Effati S (2018) An efficient neural network model for solving the absolute value equations. IEEE Trans Circuits Syst II Express Br 65(3):391–395
Nazemi A (2018) A capable neural network framework for solving degenerate quadratic optimization problems with an application in image fusion. Neural Process Lett 47(1):167–192
Noga A, Yuval E, Michal F, Moshe T (2014) Economical graph discovery. Oper Res 62(6):1236–1246
Okada S, Soper T (2000) A shortest path problem on a network with fuzzy arc lengths. Fuzzy Sets Syst 109:129–140
Pang JS (1987) A posteriori error bounds for the linearly-constrained variational inequality problem. Math Oper Res 12:474–484
Smith OJ, Boland N, Waterer H (2012) Solving shortest path problems with a weight constraint and replenishment arcs. Comput Oper Res 39:964–984
Stefanini L, Sorini L, Guerra ML (2006) Parametric representation of fuzzy numbers and application to fuzzy calculus. Fuzzy Sets Syst 157:2423–2455
Soueres P, Laumond J-P (1996) Shortest paths synthesis for a car-like robot. IEEE Trans Autom Control 41(5):672–688
Wu H-C (2004) Evaluate fuzzy optimization problems based on biobjective programming problems. Comput Math Appl 47:893–902
Xia Y, Wang J (2015) A bi-projection neural network for solving constrained quadratic optimization problems. IEEE Trans Neural Netw Learn Syst 27(2):214–224
Xia Y, Wang J (1998) A general methodology for designing globally convergent optimization neural networks. IEEE Trans Neural Netw 9:1331–1343
Yager RR (1981) A procedure for ordering fuzzy subsets of the unit interval. Inf Sci 24:143–161
Yu H, Bertsekas DP (2013) On boundedness of q-learning iterates for stochastic shortest path problems. Math Oper Res 38(2):209–227
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Eshaghnezhad, M., Rahbarnia, F., Effati, S. et al. An Artificial Neural Network Model to Solve the Fuzzy Shortest Path Problem. Neural Process Lett 50, 1527–1548 (2019). https://doi.org/10.1007/s11063-018-9945-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11063-018-9945-y