Article
Fuzzy Dynamic Programming to Determine the Shortest Route Problem
Authors
and
Abstract
The purpose of this paper is to develop a new paradigm for a fuzzy dynamic programming for solving the shortest route problem. Dynamic programming is a mathematical technique used for obtaining the solution for a sequence of interrelated decisions. In real life, situations are not crisp enough moreover, they are fuzzy in nature. Therefore, in order to deal with the real situations a new method is being proposed here to find the more realistic answers to the dynamic problems. For this purpose the MATLAB software is used where the decision parameters are trapezoidal fuzzy numbers.
Keywords
Dynamic programming, fuzzy dynamic programming, shortest path problem
Citation
Masani, D. & Verma, S. (2023). Fuzzy dynamic programming to determine the shortest route problem. Turkish Journal of Computer and Mathematics Education, 14(2), 23–28.
D. Masani and S. Verma, “Fuzzy dynamic programming to determine the shortest route problem,” Turkish Journal of Computer and Mathematics Education, vol. 14, no. 2, pp. 23–28, 2023.
Masani D, Verma S. Fuzzy dynamic programming to determine the shortest route problem. Turkish Journal of Computer and Mathematics Education. 2023;14(2):23–28.
Masani, D. and Verma, S. (2023), ‘Fuzzy dynamic programming to determine the shortest route problem’, Turkish Journal of Computer and Mathematics Education, 14(2), pp. 23–28.
Masani, Druti, and Smita Verma. “Fuzzy Dynamic Programming to Determine the Shortest Route Problem.” Turkish Journal of Computer and Mathematics Education, vol. 14, no. 2, 2023, pp. 23–28.
Masani, Druti, and Smita Verma. “Fuzzy Dynamic Programming to Determine the Shortest Route Problem.” Turkish Journal of Computer and Mathematics Education 14, no. 2 (2023): 23–28.
Export citation
Published by: Engineering Journals


