The transportation of containers is an important part of the modern logistics industry. As a result of unbalance freight volume between different regions, the empty container allocation has already become a very important and valuable research project. Taking into account the limitations of capacity in railway lines and multiple types of containers, this paper treats the railway empty container allocation as a multi-origin, multi-destination, and multi-commodity problem. An optimal model of this problem is formulated. In view of the interact ability in solving the model, a heuristic method is developed. A numeric example indicates that the model is correct and the method is effective.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Multi-Commodity Model and an Algorithm for the Railway Empty Container Allocation


    Contributors:

    Conference:

    International Conference of Logistics Engineering and Management (ICLEM) 2010 ; 2010 ; Chengdu, China


    Published in:

    ICLEM 2010 ; 2015-2022


    Publication date :

    2010-09-09




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Optimizing Empty Container Allocation Based on Hybrid Genetic Algorithm

    Li, Yuanhui / Cao, Jingjing / Li, Jun et al. | ASCE | 2009


    Optimization of Railway Empty Container Transportation

    Li, Yinghong / Liu, Shuangyang | ASCE | 2013


    Optimizing Empty Container Allocation Based on Hybrid Genetic Algorithm

    Li, Y. / Cao, J. / Li, J. et al. | British Library Conference Proceedings | 2009