Bin Packing Under Multiple Objectives - a Heuristic Approximation Approach

Details Bin Packing Under Multiple Objectives - a Heuristic Approximation Approach Bin Packing Under Multiple Objectives - a Heuristic Approximation Approach

2008-09-04

arxiv.org/abs/0809.0755v1

The Fourth International Conference on Evolutionary Multi-Criterion Optimization: Late Breaking Papers, Matsushima, Japan, Mar

Computer Science

Artificial Intelligence

Scientific paper

The 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.

Affiliated with

Also associated with

No associations

Rating

Bin Packing Under Multiple Objectives - a Heuristic Approximation Approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bin Packing Under Multiple Objectives - a Heuristic Approximation Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bin Packing Under Multiple Objectives - a Heuristic Approximation Approach will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-141547