S. Krishna Prabha
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
S. Krishna Prabha has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
G. Nagarajan
1 shared publication- M. Clement Joe Anand
Mount Carmel College (Autonomous)
1 shared publication - M. Santoshi Kumari1 shared publication
- Mohit Tiwari
Bharati Vidyapeeth’s College of Engineering
1 shared publication - Nivetha Martin
Arul Anandar College (Autonomous)
1 shared publication S. Vimala
Mother Teresa Women’s Universiy
1 shared publication
Latest Publications
- 1 January 2024
- Published by American Scientific Publishing Group (ASPG) LLC
- Vol. 23 (2) , 91-103
Sorting Out Interval Valued Neutrosophic Fuzzy Shortest Cycle Route Problem by Reduced Matrix Method
The assertiveness theory next addresses the difficulties of the travelling salesman after discussing the problem with transportation and assignment. The Shortest Cycling Route Problem (SCRP) finds the shortest route that stops in each city exactly once using a preset set of cities and their bilateral distances. The arc lengths in TSO are typically seen as representing travel time or travel expenses rather than actual distance. The precise arc length cannot be predicted because cargo, climate, road conditions, and other factors also can affect the journey time or cost. For handling the unpredictability in SCRP, fuzzy set theory provides a new tool. The shortest cyclic route problem with interval-valued neutrosophic fuzzy numbers as cost coefficients is solved using the simplified matrix techniques in this study. Reduced Matrix Method is used to solve a numerical problem and its efficacy is demonstrated.
- 1 January 2024
- Published by American Scientific Publishing Group (ASPG) LLC
- Vol. 23 (2) , 91-103
Sorting Out Interval Valued Neutrosophic Fuzzy Shortest Cycle Route Problem by Reduced Matrix Method
The assertiveness theory next addresses the difficulties of the travelling salesman after discussing the problem with transportation and assignment. The Shortest Cycling Route Problem (SCRP) finds the shortest route that stops in each city exactly once using a preset set of cities and their bilateral distances. The arc lengths in TSO are typically seen as representing travel time or travel expenses rather than actual distance. The precise arc length cannot be predicted because cargo, climate, road conditions, and other factors also can affect the journey time or cost. For handling the unpredictability in SCRP, fuzzy set theory provides a new tool. The shortest cyclic route problem with interval-valued neutrosophic fuzzy numbers as cost coefficients is solved using the simplified matrix techniques in this study. Reduced Matrix Method is used to solve a numerical problem and its efficacy is demonstrated.
- Open Access
- 1 January 2018
- Published by Springer Nature
- p. 323-330
Neutrosophic Assignment Problem via BnB Algorithm
- 1 January 2018
- Published by Springer Nature
- p. 323-330
Open AccessNeutrosophic Assignment Problem via BnB Algorithm