2-Dimensional packing algorithms on a variable-size rectangular interface - Archive ouverte HAL Access content directly
Conference Papers Year :

2-Dimensional packing algorithms on a variable-size rectangular interface

(1) , (1) , (1) , (1)
1

Abstract

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.
Not file

Dates and versions

hal-02976949 , version 1 (23-10-2020)

Identifiers

Cite

Benoît Martin, Ilyes Kadri, Imed Kacem, Isabelle Pecci. 2-Dimensional packing algorithms on a variable-size rectangular interface. 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT), Apr 2019, Paris, France. pp.2022-2026, ⟨10.1109/CoDIT.2019.8820506⟩. ⟨hal-02976949⟩
35 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More