Quantity distribution and network matching flow are two core problems of the empty wagon distribution. Based on abstracting these problems, EWDCO model and corresponding algorithm are devised. It is found that identical path constraint doesn't correspond with EWDCO model and convection constraint won't affect the optimal solution. Thus, EWDCO model can be described as linear integer programming model, and ACO is superior to other algorithms.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Model and Ant Colony Optimization Algorithms for Railway Empty Wagons Distribution


    Beteiligte:
    Zhu, Jianmei (Autor:in) / Tan, Yunjiang (Autor:in) / Yan, Haifeng (Autor:in)

    Kongress:

    First International Conference on Transportation Engineering ; 2007 ; Southwest Jiaotong University, Chengdu, China



    Erscheinungsdatum :

    09.07.2007




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Model and Ant Colony Optimization Algorithms for Railway Empty Wagons Distribution

    Zhu, J. / Tan, Y. / Yan, H. et al. | British Library Conference Proceedings | 2007


    Standard railway wagons

    Engineering Index Backfile | 1921


    Large railway wagons

    Engineering Index Backfile | 1901


    Repairing of railway wagons

    Williams, T.L. | Engineering Index Backfile | 1944


    Large railway wagons

    Engineering Index Backfile | 1908