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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Materials and Structural Integrity
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
