The Particle Swarm Optimization Algorithm for Solving Rectangular Packing Problem

Abstract:

Article Preview

Based on extensive researches on various heuristic algorithms, the particle swarm optimization algorithm was developed to solve the rectangular packing problems. The algorithm optimizes the parameter of dynamic attractive factors by updating the position and the velocity of the particles, and applies perturbation strategy to solve the matter that it is easy to stick at local optima. The experimental result shows that the algorithm can get a better packing result by less time.

Info:

Periodical:

Edited by:

Wenya Tian and Linli Xu

Pages:

479-483

DOI:

10.4028/www.scientific.net/AMR.186.479

Citation:

Y. Qi and J. M. Wang, "The Particle Swarm Optimization Algorithm for Solving Rectangular Packing Problem", Advanced Materials Research, Vol. 186, pp. 479-483, 2011

Online since:

January 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.