Scholarlink

The fair layout problem is a combinatorial optimization problem inspired by a concrete real-world stand alignment situation. The main goal of the paper is to study this problem by introducing new features: (1) a 90-degree rotation of the stands, and (2) two variants of the arrangement: a layout where stands can be arranged in multiple rows, and a second version requiring the stand to have two free sides. As a solution, we propose a simple genetic algorithm with two variations: in the first variant, random initialization is used, and in the second variant, a greedy initialization strategy is used. Numerical experiments on different maps show the effectiveness of the proposed approach.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

An Evolutionary Framework for Different Variants of the Fair Layout Optimization Problem

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Szabolcs-D.’avid Kerestes,
  • No’emi Gask’o

摘要

The fair layout problem is a combinatorial optimization problem inspired by a concrete real-world stand alignment situation. The main goal of the paper is to study this problem by introducing new features: (1) a 90-degree rotation of the stands, and (2) two variants of the arrangement: a layout where stands can be arranged in multiple rows, and a second version requiring the stand to have two free sides. As a solution, we propose a simple genetic algorithm with two variations: in the first variant, random initialization is used, and in the second variant, a greedy initialization strategy is used. Numerical experiments on different maps show the effectiveness of the proposed approach.