2-Dimensional packing algorithms on a variable-size rectangular interface
2019 6TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT 2019)(2019)
摘要
The purpose of this work is to propose effective approximate algorithms capable to generate, in a very short time, feasible 2-dimensional configurations (interfaces) containing a set of given menus adapted to a certain user context (physical activity for example). As in some previous works, the proposed approach gives good solutions that minimize the used surface to pack all the tiles into a variable-size bin. Such a size should respect a fixed ratio for the screen between its width and its height. Moreover, the proposed approaches (based on shelf strategy), genetic algorithm are compared to an exact model. The exact resolution of this mathematical model gives an optimal solution only for small instances. For the other instances, it is difficult to reach the optimal value in a short running time, which shows the practical interest of the proposed approaches.
更多查看译文
关键词
variable-size bin,genetic algorithm,mathematical model,variable-size rectangular interface,approximate algorithms,2-dimensional packing algorithms,computational hardness
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络