Two new heuristics for the equal piles problem

Abstract

Given n objects of various heights, the equal piles problem seeks an arrangement of these objects into k piles such that the heights of the resulting piles are as nearly equal as possible. In this paper we propose two new heuristics for this problem. One is a hybrid steady-state grouping genetic algorithm while the other is a perturbation based local search. Computational results demonstrate the effectiveness of our heuristics. Copyright © IICAI 2005.