Efficient routing to guide the vehicles to reach their destinations is a challenging problem in vehicular networks. Many solutions have been proposed in the literature to address the routing problem in vehicular networks. However, most of these solutions are graph-based and do not properly address the dynamic characteristics of vehicular networks. This paper proposes two novel heuristic routing algorithms based on Tabu search and Neural Networks. The proposed algorithms are evaluated and their findings are presented using the UK RTA based roadside dataset. Experimental results along with the comparative analysis made with other related studies are provided to prove the efficiency of the proposed algorithms. The findings highlight the superior performance achieved by the suggested routing algorithms.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Heuristic Based Routing Algorithms for Vehicular Network Using Tabu Search and ANN


    Contributors:


    Publication date :

    2020-12-12


    Size :

    615878 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem

    Xu, J. / Kelly, J. P. | British Library Online Contents | 1996



    A tabu search heuristic for the vehicle routing problem

    Gendreau, Michel / Hertz, Alain / Laporte, Gilbert | TIBKAT | 1992


    A tabu search heuristic for the multi-depot vehicle routing problem

    Renaud, Jacques / Laporte, Gilbert / Boctor, Fayez F. | TIBKAT | 1994


    A tabu search-based heuristic for a new capacitated cyclic inventory routing problem

    Seifbarghy, Mehdi / Samadi, Zahra | BASE | 2014

    Free access