<?xml version="1.0" encoding="UTF-8"?> <article key="pdf/9103" mdate="2009-01-27 00:00:00"> <author>Ben Mohamed Ahemed Mohamed and Yassine Adnan</author> <title>Optimization by Ant Colony Hybryde for the BinPacking Problem</title> <pages>12 - 15</pages> <year>2009</year> <volume>3</volume> <number>1</number> <journal>International Journal of Mathematical and Computational Sciences</journal> <ee>https://publications.waset.org/pdf/9103</ee> <url>https://publications.waset.org/vol/25</url> <publisher>World Academy of Science, Engineering and Technology</publisher> <abstract>The problem of binpacking in two dimensions (2BP) consists in placing a given set of rectangular items in a minimum number of rectangular and identical containers, called bins. This article treats the case of objects with a free orientation of 90&amp;amp;Ocirc;&amp;amp;ugrave;&amp;amp;ordf;. We propose an approach of resolution combining optimization by colony of ants (ACO) and the heuristic method IMA to resolve this NPHard problem. </abstract> <index>Open Science Index 25, 2009</index> </article>