Greedy Heuristic Performance for Combinatorial Mixture Packaging of Two Types of Foods with Bounded Weights

抄録

In this paper, a combinatorial optimization model of mixture packaging of two types of items is considered, which arises in actual packaging systems for foods, so-called multi-head weighers. The primary objective is to make the total weight of chosen items for a package as close to a prescribed target weight as possible, and the second objective is to maximize the total priority of them in order to reduce the durations in weighing hoppers of items. The target weight constraint for a package and indispensable weight constraint for each type of items must be satisfied in a feasible solution. In this paper, a greedy heuristic algorithm is treated, and a constant factor and a parametrized factor are shown for the heuristic total weight and the heuristic total priority, respectively. An easy modification of the greedy heuristic is also considered. The empirical performance is examined by numerical experiments, and the results are reported.