Given a set of rectangular items such as dishes, cups, saucers, or forks and a rectangular shelf of a dish cart, the twodimensional single bin packing problem (2D-BPP) involves orthogonally packing a subset of the items within the shelf such that the sum of the values of the packed items is maximized. If the value of an item is given by its area, the objective is to maximize the covered area of the shelf. Thus, this paper aims to optimize the transport capacity of a serving robot carrying a dish cart. This experiment, the first of its type, proves the feasibility of this endeavor efficiently.
Digital Object Identifier (DOI)
Lee, Kang-Hee and Khil, A-Ra
"Optimization of a Dish Cart Storage using the Two-Dimensional Single Bin Packing Problem,"
Applied Mathematics & Information Sciences: Vol. 08
, Article 17.
Available at: https://dc.naturalspublishing.com/amis/vol08/iss5/17