INTERNATIONAL JOURNAL OF SCIENTIFIC DEVELOPMENT AND RESEARCH International Peer Reviewed & Refereed Journals, Open Access Journal ISSN Approved Journal No: 2455-2631 | Impact factor: 8.15 | ESTD Year: 2016
open access , Peer-reviewed, and Refereed Journals, Impact factor 8.15
A Fast And Effective Technique Based On A Genetic Algorithm For Determining The K Shortest And Longest Path
Authors Name:
sharadindu Roy
Unique Id:
IJSDR2304104
Published In:
Volume 8 Issue 4, April-2023
Abstract:
This paper discusses a genetic algorithm-based method for determining the k shortest and longest paths in a graph. The k-shortest path problem is a graph theory generalisation of the shortest path problem. It has applications in network routing and multi-object tracking, among others. In contrast, the longest path problem is a generalisation of the Hamiltonian path problem. It is used, among other things, to find the critical path. This can be used in circuit design, planning, and scheduling. The proposed genetic algorithm-based method was applied to both problems, and the conditions that yielded the most paths were determined. The proposed method is effective for determining a better quality path. To assess the effectiveness of the approach, it is compared to a traditional algorithm.
"A Fast And Effective Technique Based On A Genetic Algorithm For Determining The K Shortest And Longest Path", International Journal of Science & Engineering Development Research (www.ijsdr.org), ISSN:2455-2631, Vol.8, Issue 4, page no.568 - 572, April-2023, Available :http://www.ijsdr.org/papers/IJSDR2304104.pdf
Downloads:
000337071
Publication Details:
Published Paper ID: IJSDR2304104
Registration ID:205105
Published In: Volume 8 Issue 4, April-2023
DOI (Digital Object Identifier):
Page No: 568 - 572
Publisher: IJSDR | www.ijsdr.org
ISSN Number: 2455-2631
Facebook Twitter Instagram LinkedIn