Investigation on the rectangular packing problem based on the ant colony algorithm
by Yi Guo; Hui Li
International Journal of Materials and Structural Integrity (IJMSI), Vol. 9, No. 1/2/3, 2015

Abstract: The large-scale rectangular packing problem is a typical combinatorial optimisation problem, which belongs to the most complicated NP-complete problem. Now, it is very difficult to obtain the best solution within a certain time by the commonly used theories and methods of calculation. The ant colony algorithm, developed in recent years, is very effective in solving combinatorial optimisation and NP-problems. Based on the analysis of ant colony algorithm and the rectangular packing problem, this paper combine the ant colony algorithm and rectangular packing problem, the best-worst ant model is built and then simulated, finally, an example is used to prove the effectiveness of the proposed algorithm.

Online publication date: Wed, 12-Aug-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 Materials and Structural Integrity (IJMSI):
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