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.
Container Loading Problem Based on Improved Genetic Algorithm
First International Conference on Transportation Engineering ; 2007 ; Southwest Jiaotong University, Chengdu, China
09.07.2007
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Container Loading Problem Based on Improved Genetic Algorithm
British Library Conference Proceedings | 2007
|Scatter Search Algorithm to Multiple Container Loading Problem
British Library Conference Proceedings | 2007
|Research on Container Loading Problem Based on the Packing Tree Algorithm
British Library Online Contents | 2007
|British Library Online Contents | 2013
|Optimization of Container Truck Scheduling Problem Based on Genetic Algorithm
British Library Conference Proceedings | 2009
|