Solving an Optimization Problem of Image View Layout with Priority using Heuristic Approach

The image view layout with priority (IVLP) problem focuses on efficiently arranging picture cards of uniform height but varying widths into the minimum number of 2D frames or display sets and prioritizing images with higher priority to be placed at the earlier displays. We mathematically modeled IVLP using integer linear programming. To approximate IVLP solutions, we introduce a greedy-based heuristic, Best-Fit-IVLP (BFI), and a swarm optimization algorithm, Ant Colony Optimization (ACO). BFI allocates picture cards in descending order of priority and width for each display line, seeking another card that can optimally fill the remaining space on each line. In contrast, ACO randomly arranges cards from high to low priority within every line. Experimental results using different numbers of SVG images indicate that BFI and ACO generate solutions close to optimal. BFI demonstrates superior practicality, executing significantly faster than ACO; for 160 images, BFI runs in 0.00044 seconds compared to ACO's 117.93 seconds. Both BFI and ACO achieve space utility rates ranging from 0.578 to 0.8. While BFI consistently produces the same card arrangement, ACO offers diverse arrangements for identical optimal display set counts and space utilization.