Optimizing Road Networks: A Graph-Based Analysis with Path-finding and Learning Algorithms

被引:0
|
作者
Muthuvel, P. [1 ]
Pandiyan, G. [2 ]
Manickam, S. [3 ]
Rajesh, C. [4 ]
机构
[1] Saveetha Engn Coll, Dept ECE, Chennai 602105, Tamilnadu, India
[2] Saveetha Engn Coll, Dept AI&DS, Saveetha Nagar, Chennai 602105, Tamilnadu, India
[3] Saveetha Engn Coll, Dept AIML, Saveetha Nagar, Chennai 602105, Tamilnadu, India
[4] Saveetha Engn Coll, Dept CSE, Saveetha Nagar, Chennai 602105, Tamilnadu, India
关键词
Classical algorithm; AI search and learning algorithm; Road networks; NEURAL-NETWORKS; OPTIMIZATION;
D O I
10.1007/s13177-024-00453-w
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
This paper describes a graph-based methodology for analysing and optimising road networks that combines traditional algorithms, AI search, and a learning algorithm. The primary goal is to find the shortest and most efficient paths between vertices in a road network while accounting for variables such as road conditions, length-to-width ratio, and traffic conditions.The study emphasizes the importance of including real-world variables such as road length, width, traffic, and overall road conditions in road network analysis in order to optimize travel time between two points. Taking these factors into account, the paper hopes to identify more accurate and efficient routes, thereby improving traffic flow and transportation planning and management.Dijkstra's algorithm is used to determine the shortest paths through a road network. Furthermore, the A* algorithm and Q-learning, a reinforcement learning technique, are used to optimize routing decisions by considering dynamic factors such as traffic and road conditions. The study's findings demonstrate the effectiveness of the proposed approach. By incorporating Q-learning, the algorithm can adjust its routing decisions over time-based on experience, increasing efficiency and responsiveness to changing traffic conditions. The findings indicate that this approach has the potential to significantly improve transportation system performance while also facilitating better route planning and traffic management decisions. The optimized path in scenario emphasizes the importance of variables like traffic, road conditions, and the length/width ratio. The findings demonstrate that although the A* algorithm finds a route that is comparable to scenario one, the cost rises significantly from 0.452 to 1.5314 as a result of altered traffic and road dynamics. These results show that by combining Dijkstra, A*, and Q-learning algorithms, the hybrid approach can manage complex scenarios and guarantee optimal performance even in a range of conditions.
引用
收藏
页码:315 / 329
页数:15
相关论文
共 50 条
  • [1] SYSTOLIC ALGORITHMS FOR PATH-FINDING PROBLEMS
    ROBERT, Y
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 316 : 68 - 81
  • [2] Adversarial Cooperative Path-finding: Complexity and Algorithms
    Ivanova, Marika
    Surynek, Pavel
    2014 IEEE 26TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI), 2014, : 75 - 82
  • [3] On fast path-finding algorithms in AND-OR graphs
    Adelson-Velsky, GM
    Gelbukh, A
    Levner, E
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2002, 8 (4-5) : 283 - 293
  • [4] ELECTRICAL NETWORKS AND A CONNECTIONIST APPROACH TO PATH-FINDING
    PRASSLER, E
    CONNECTIONISM IN PERSPECTIVE, 1989, : 421 - 428
  • [5] Better path-finding algorithms in LPS Ramanujan graphs
    Pinto, Eduardo Carvalho
    Petit, Christophe
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2018, 12 (04) : 191 - 202
  • [6] Using Path-Finding Algorithms of Graph Theory for Route-Searching in Geographical Information Systems
    Sobota, B.
    Szabo, Cs.
    Perhac, J.
    2008 6TH INTERNATIONAL SYMPOSIUM ON INTELLIGENT SYSTEMS AND INFORMATICS, 2008, : 258 - 263
  • [8] Graph-Based Multi-Robot Path Finding and Planning
    Hang Ma
    Current Robotics Reports, 2022, 3 (3): : 77 - 84
  • [9] Optimizing transistor networks using a graph-based technique
    Vinicius N. Possani
    Renato S. de Souza
    Julio S. Domingues
    Luciano V. Agostini
    Felipe S. Marques
    Leomar S. da Rosa
    Analog Integrated Circuits and Signal Processing, 2012, 73 : 841 - 850
  • [10] Optimizing transistor networks using a graph-based technique
    Possani, Vinicius N.
    de Souza, Renato S.
    Domingues, Julio S., Jr.
    Agostini, Luciano V.
    Marques, Felipe S.
    da Rosa, Leomar S., Jr.
    ANALOG INTEGRATED CIRCUITS AND SIGNAL PROCESSING, 2012, 73 (03) : 841 - 850