Loading...
Please wait, while we are loading the content...
Similar Documents
Hungarian Method to Solve Travelling Salesman Problem with Fuzzy Cost
| Content Provider | Semantic Scholar |
|---|---|
| Author | Nayak, J. Nanda, Sudarsan |
| Copyright Year | 2017 |
| Abstract | The Travelling Salesman problem is one of the most common problem in O.R. But in real life situation the problem is often not useful due to its crisp nature. Use of fuzzy can make the problem more useful in day to day life. We consider a Travelling Salesman Problem with costs of travelling as trapezoidal fuzzy numbers. Fuzzy ranking function is used to handel trapezoidal fuzzy numbers. Hungering Algorithm is used to solve the problem. An example illustrates the use of the proposed method. |
| Starting Page | 281 |
| Ending Page | 284 |
| Page Count | 4 |
| File Format | PDF HTM / HTML |
| DOI | 10.14445/22315373/IJMTT-V49P544 |
| Volume Number | 49 |
| Alternate Webpage(s) | http://www.ijmttjournal.org/2017/Volume-49/number-5/IJMTT-V49P544.pdf |
| Alternate Webpage(s) | https://doi.org/10.14445/22315373%2FIJMTT-V49P544 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |