UGC Approved Journal no 63975(19)

ISSN: 2349-5162 | ESTD Year : 2014
Call for Paper
Volume 11 | Issue 5 | May 2024

JETIREXPLORE- Search Thousands of research papers



WhatsApp Contact
Click Here

Published in:

Volume 11 Issue 2
February-2024
eISSN: 2349-5162

UGC and ISSN approved 7.95 impact factor UGC Approved Journal no 63975

7.95 impact factor calculated by Google scholar

Unique Identifier

Published Paper ID:
JETIR2402431


Registration ID:
533164

Page Number

e235-e241

Share This Article


Jetir RMS

Title

“A Study of Shortest Route Planning In A Road Network”

Abstract

This research delves into the intricate domain of shortest route planning within road networks. Navigating through the historical foundations and contemporary challenges, the study explores classic algorithms such as Dijkstra's and Bellman-Ford, highlighting their contributions and limitations. Optimization techniques, including metaheuristic algorithms like Genetic Algorithms and Simulated Annealing, are scrutinized for their efficacy in addressing scalability issues. The evolution towards real-time route planning, fueled by GPS and live traffic data, is investigated, emphasizing adaptability to dynamic urban conditions. Machine learning's integration into route planning systems is examined, focusing on predictive modeling and reinforcement learning to enhance adaptability and self-learning capabilities. Multi-objective optimization techniques are explored as a means to balance conflicting criteria, addressing the diverse needs of users and decision-makers. The study also sheds light on emerging concerns surrounding privacy and security in route planning systems, emphasizing encryption, anonymization, and privacy-preserving algorithms. Optimizing route planning has become an indispensable component of various applications, ranging from transportation and logistics to urban planning. This article dives into the intricate world of shortest route algorithms, aiming to provide a comprehensive understanding of their foundations, applications, and the evolution of techniques employed to find the most efficient paths in road networks. With a focus on classic algorithms like Dijkstra's and Bellman-Ford, as well as modern approaches such as A* and bidirectional search, this exploration sheds light on their strengths, limitations, and the ongoing advancements that continue to shape the field.

Key Words

Route Planning, Road Networks, Optimization, Real-Time Traffic, Machine Learning, Privacy, Multi-Objective Optimization

Cite This Article

"“A Study of Shortest Route Planning In A Road Network”", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.11, Issue 2, page no.e235-e241, February-2024, Available :http://www.jetir.org/papers/JETIR2402431.pdf

ISSN


2349-5162 | Impact Factor 7.95 Calculate by Google Scholar

An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 7.95 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator

Cite This Article

"“A Study of Shortest Route Planning In A Road Network”", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.11, Issue 2, page no. ppe235-e241, February-2024, Available at : http://www.jetir.org/papers/JETIR2402431.pdf

Publication Details

Published Paper ID: JETIR2402431
Registration ID: 533164
Published In: Volume 11 | Issue 2 | Year February-2024
DOI (Digital Object Identifier):
Page No: e235-e241
Country: meerut, UP, India .
Area: Science & Technology
ISSN Number: 2349-5162
Publisher: IJ Publication


Preview This Article


Downlaod

Click here for Article Preview

Download PDF

Downloads

00025

Print This Page

Current Call For Paper

Jetir RMS