In view of the current traffic network of deficiencies in the path selection research, i.e. only consider static traffic network path selection problem. This paper proposed shortest path algorithm under congestion traffic network which is based on ant colony algorithm and builds the traffic network model based on Petri nets, and use ant colony optimization to find the shortest path for the static traffic network. Then add the weather, road capacity to the model, made it become dynamic traffic network. Using AHP combined with Petri network traffic on the topology map to find the shortest path and make a comparative analysis. The results show that when the road is congestion, path algorithm for dynamic traffic network can be more convenient for travelers to find the route.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Congested traffic based on ant colony algorithm for shortest path algorithm


    Contributors:
    Yang Haoxiong (author) / Hu Yang (author)


    Publication date :

    2015-07-01


    Size :

    303978 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A Path Planning Algorithm Based on Mutual Assistance Trip in Traffic Congested Network

    Yang, Guojun / Wang, Jiangfeng / Zeng, Zhaohui et al. | TIBKAT | 2022


    A Path Planning Algorithm Based on Mutual Assistance Trip in Traffic Congested Network

    Yang, Guojun / Wang, Jiangfeng / Zeng, Zhaohui et al. | British Library Conference Proceedings | 2022


    A Path Planning Algorithm Based on Mutual Assistance Trip in Traffic Congested Network

    Yang, Guojun / Wang, Jiangfeng / Zeng, Zhaohui et al. | Springer Verlag | 2022



    Multi-Constrained Shortest Path Model and Solution with Improved Ant Colony Algorithm

    Hu, Y. / Liu, Y. / Liu, W. | British Library Conference Proceedings | 2010