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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

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


    Beteiligte:
    Hu, Yaomin (Autor:in) / Liu, Yuyin (Autor:in) / Liu, Weiming (Autor:in)

    Kongress:

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



    Erscheinungsdatum :

    26.07.2010




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    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