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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Model and Ant Colony Optimization Algorithms for Railway Empty Wagons Distribution


    Contributors:
    Zhu, Jianmei (author) / Tan, Yunjiang (author) / Yan, Haifeng (author)

    Conference:

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



    Publication date :

    2007-07-09




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    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