How to provide a route to meet the driver's multiple psychological expectations is the key problem of a navigation system. Essentially, this problem is a resource constrained shortest path problem (RCSP), which belongs to NP hard problems and can not be solved with the traditional shortest path algorithm. A multi-constrained shortest path mathematical model is presented in this paper and solved with an improved ant colony algorithm. The pheromone update rule and heuristic factor are redesigned in the algorithm. Results show that the improved optimization algorithm has a good ability to accurately determine the multi-constrained shortest path in the road network.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:
    Hu, Yaomin (author) / Liu, Yuyin (author) / Liu, Weiming (author)

    Conference:

    Seventh International Conference on Traffic and Transportation Studies (ICTTS) 2010 ; 2010 ; Kunming, China



    Publication date :

    2010-07-26




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




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

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



    Improved ant colony algorithm for shortest path problem in time-dependent networks

    Yongqiang, L. / Qing, C. / Huagang, X. | British Library Online Contents | 2009


    Routing Military Aircraft with a Constrained Shortest-Path Algorithm

    W. M. Carlyle / J. O. Royset / R. K. Wood | NTIS | 2007


    An Improved Ant Colony Algorithm for the Shortest Path Problem in Time-Dependent Networks

    Gao, H. / Liu, Y. / Chang, Q. et al. | British Library Conference Proceedings | 2009