This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2025-212339
If you've NEVER registered a DOI in your Lattes, check our tutorial!This paper tackles the combinatorial optimization problem called the Bin Packing Problem with Conflicts (BPPC). The problem is variant of the classic Bin Packing Problem (BPP). In the original problem, a set of items is to be packed in the minimum number of same size containers, respecting its maximum weight capacity. The BPPC has the same objective but presents the case where items may have conflicts with each other and cannot be packed in the same bin together. A Simulated Annealing method with a random initial solution and four neighborhood moves is implemented. The proposed algorithm is tested on 2,160 instances from the literature and results show that high quality solutions were obtained. The average gap from the best known solutions was 4.81% and optimality was reached in 24.21% of cases.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper