Optimal sorting of product into fixed weight packaging

Marsh, Clive and Kilby, Philip (2004) Optimal sorting of product into fixed weight packaging. Australian and New Zealand Mathematics in Industry Study Group > 21st MISG [Auckland 26/1/2004 - 30/1/2004].

Full text available as:

	PDF (Problem report) - Requires Adobe Acrobat Reader or other PDF viewer.
	PDF (Equation free summary) - Requires Adobe Acrobat Reader or other PDF viewer.

Abstract/Summary

Compac Sorting Equipment make very nifty machines for sorting fruit by weight, diameter, colour, density, blemish or even shape. Compac sought solutions to two closely related problems: the boxing problem and the bagging problem.

The boxing problem requires graded fruit to be assigned to outlets where boxes are filled with a specified number of fruit to a minimum weight (and a specified tolerance for underweights). The aim is to maximise the number of boxes packed. The decision must be made after all information is known, but before the fruit passes the first outlet - a few seconds total. Further, information about fruit already packed in a given box is incomplete (we don’t know exactly which fruit ended up in a box).

The bagging problem requires bags to be filled to a minimum weight - no tolerance for underweights, and no constraints on the number of fruit per bag. In this case complete information is available on fruit already assigned to a bag. Again the aim is to maximise the number of bags packed.

Archive Staff Only: edit this record