There are several algorithms which calculates shortest path, but most of them are not enough fast, effective and they provide only one solution. Therefore our investigation tries to find one alternative algorithm for this problem. In this paper it is described how Ant-colony and the Genetic algorithm can be applied for multimodal transportation systems and tests have been made to find the best parameters of these methods. Parallel methods are being introduced, as these methods are more effective and more applicable to Cloud based systems. It has been simulated in a multi-threaded server but it could also be used in a distributed computing system.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Compare Ant-colony and Genetic algorithm for shortest path problem and introduce their parallel implementations


    Contributors:


    Publication date :

    2015-06-01


    Size :

    289544 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



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

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



    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



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

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