Research on PSO algorithms for the rectangular packing problem
by Jinmin Wang; Yang Qi; Jing Zhang
International Journal of Computer Applications in Technology (IJCAT), Vol. 51, No. 1, 2015

Abstract: For packing problems that are complex optimisation problems, the solutions must rely on heuristics. Particle swarm optimisation (PSO) is an emerging technique that utilises heuristics. Because of its simplicity, PSO has been widely applied to a variety of fields, including applications to the packing problem. This paper researches the search efficiency of the PSO algorithm. Through fitting the data to the length of the solution interval and the number of iterations, a strong search capability for the PSO is proved. Then, the results of experiments with comparisons of many disturbance strategies show that a stochastic strategy is beneficial for raising the search capability of the algorithm.

Online publication date: Wed, 01-Apr-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com