The minimum raster set problem and its application to the d-dimensional orthogonal packing problem

Авторы: Kartak Vadim M., Ripatti Artem V.
Журнал: European Journal of Operational Research
Том: 271
Номер: 1
Год издания: 2018
Издательство: Elsevier BV
Местоположение издательства: Netherlands
Первая страница: 33
Последняя страница: 39
DOI: 10.1016/j.ejor.2018.04.046
Аннотация: We consider the well-known d-dimensional Orthogonal Packing Problem (OPP-d). Using the toolset of conservative scales introduced by Fekete and Schepers we are able to change items’ sizes of the initial instance to obtain an equivalent instance with the same solution. In this paper, we present efficient algorithm for building equivalent instances with certain properties. We also consider the so-called raster model for OPP-d introduced by Belov, Kartak, Rohling and Scheithauer. It is a 0/1 ILP model in which the number of variables and constraints depends on the total number of raster points over all dimensions. Using our algorithm, we construct equivalent instances with a reduced number of raster points. We also present an algorithm to find a lower bound on the minimum possible number of raster points over all equivalent instances. Numerical results are presented.
Добавил в систему: Картак Вадим Михайлович

	ИСТИНА	Войти в систему Регистрация
	ИСТИНА ИНХС РАН
	Главная Поиск Статистика О проекте Помощь

ИСТИНА