Fuzzy Dynamic Programming to Determine the Shortest Route Problem
Main Article Content
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.
Downloads
Metrics
Article Details
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
