Simulated Annealing (SA) is an efficient approach to solve the problems of premature convergence that exist in genetic algorithm, which can reduce the scope of the search area and improve the convergence speed of the algorithm. It combines with genetic algorithm (GA) to form a new global optimal algorithm in the paper. The crossover operator of the genetic operation plays an important role in this algorithm. The results of concrete example of the container assembly show that this algorithm has many advanced properties compared with traditional general genetic algorithm.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Container Loading Problem Based on Improved Genetic Algorithm


    Contributors:
    Lv, G. M. (author) / Shen, G. (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




    Container Loading Problem Based on Improved Genetic Algorithm

    Lv, G.M. / Shen, G. / China Communications and Transportation Association; Transportation & Development Institute (American Society of Civil Engineers) | British Library Conference Proceedings | 2007


    Scatter Search Algorithm to Multiple Container Loading Problem

    Xue, J. / Li, Q. / China Communications and Transportation Association; Transportation & Development Institute (American Society of Civil Engineers) | British Library Conference Proceedings | 2007




    Optimization of Container Truck Scheduling Problem Based on Genetic Algorithm

    Liu, H. / Zhou, J. / China Communications and Transportation Association; Transportation & Development Institute (American Society of Civil Engineers) | British Library Conference Proceedings | 2009