Optimizing empty container allocation is becoming a hot issue in shipping transportation. According to the characteristics of shipping container transport, aiming at solving effectively shipping empty container allocation optimization, this paper proposed a novel hybrid genetic algorithm. At first the shipping container allocation model is established, seeking the minimization of the total cost for empty containers in a certain time. Then, an integer code hybrid genetic algorithm combining with the Steepest Descent Method is proposed to solve the optimal problem. Finally, the simulation results show that the improved hybrid genetic algorithm more effectively finds the global optimal solution than the conventional genetic algorithm. The method is capable of resolving the problem and has good performance to find the best container allocation strategy.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimizing Empty Container Allocation Based on Hybrid Genetic Algorithm


    Contributors:
    Li, Yuanhui (author) / Cao, Jingjing (author) / Li, Jun (author) / Sun, Jian (author)

    Conference:

    Second International Conference on Transportation Engineering ; 2009 ; Southwest Jiaotong University, Chengdu, China



    Publication date :

    2009-07-29




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Optimizing Empty Container Allocation Based on Hybrid Genetic Algorithm

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



    Network algorithm for empty freight car allocation

    White, W.W. / Bomberault, A.M. | Engineering Index Backfile | 1969


    Cost Optimization of Empty Shipping Container Allocation Based on Integer Programming

    Zheng, Mingming / Cai, Guoqiang | British Library Conference Proceedings | 2016


    EMPTY CONTAINER DETECTION

    ODHNER LAEL / KECK MARK / FRIEDMAN YULI et al. | European Patent Office | 2021

    Free access