Bin Packing Under Multiple Objectives - a Heuristic Approximation Approach

Simple item page
dc.creatorGeiger, Martin Josef
dc.date2008-09-04
dc.date.accessioned2026-07-07T10:00:39Z
dc.date.available2026-07-07T10:00:39Z
dc.descriptionThe article proposes a heuristic approximation approach to the bin packing problem under multiple objectives. In addition to the traditional objective of minimizing the number of bins, the heterogeneousness of the elements in each bin is minimized, leading to a biobjective formulation of the problem with a tradeoff between the number of bins and their heterogeneousness. An extension of the Best-Fit approximation algorithm is presented to solve the problem. Experimental investigations have been carried out on benchmark instances of different size, ranging from 100 to 1000 items. Encouraging results have been obtained, showing the applicability of the heuristic approach to the described problem.
dc.identifierhttps://arxiv.org/abs/0809.0755
dc.identifierhttp://arxiv.org/abs/0809.0755
dc.identifierThe Fourth International Conference on Evolutionary Multi-Criterion Optimization: Late Breaking Papers, Matsushima, Japan, March 2007, pp. 53-56
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/168380
dc.subjectArtificial Intelligence
dc.titleBin Packing Under Multiple Objectives - a Heuristic Approximation Approach
dc.typetext

Files

Collections

arXiv