Title :
Improved particle swarm optimization algorithm for Rectangular Cutting-Stock Problem
Author :
Qi Ji ; Huang Lan ; Tan Ying
Author_Institution :
Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun, China
Abstract :
For the combination optimization problem, it is difficult to describe the updating of the particles by using standard particle swarm optimization algorithm. On account of this problem, an improved particle swarm optimization algorithm is proposed in this paper which combined with genetic algorithm and adopts information-sharing strategy, in addition to this, the lowest horizontal search algorithm is also be utilized for Rectangular Cutting-Stock Problem. Through comparison of experimental results with the reference [7], the proposed algorithm is effective and robust.
Keywords :
bin packing; combinatorial mathematics; genetic algorithms; particle swarm optimisation; search problems; combination optimization; genetic algorithm; horizontal search algorithm; information-sharing strategy; particle swarm optimization; rectangular cutting-stock problem; Optimization; genetic algorithm; particle swarm optimization; rectangular cutting-stock;
Conference_Titel :
Digital Content, Multimedia Technology and its Applications (IDC), 2010 6th International Conference on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-7607-7
Electronic_ISBN :
978-8-9886-7827-5