Open Loop Layout Optimization: Feasible Path Planning and Exact Door-to-Door Distance Calculation
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912332838338560 |
|---|---|
| author | Shavarani, Seyed Mahdi Vizvari, Bela Gergely, Kovacs |
| author_facet | Shavarani, Seyed Mahdi Vizvari, Bela Gergely, Kovacs |
| contents | The Open Loop Layout Problem (OLLP) seeks to position rectangular cells of varying dimensions on a plane without overlap, minimizing transportation costs computed as the flow-weighted sum of pairwise distances between cells. A key challenge in OLLP is to compute accurate inter-cell distances along feasible paths that avoid rectangle intersections. Existing approaches approximate inter-cell distances using centroids, a simplification that can ignore physical constraints, resulting in infeasible layouts or underestimated distances. This study proposes the first mathematical model that incorporates exact door-to-door distances and feasible paths under the Euclidean metric, with cell doors acting as pickup and delivery points. Feasible paths between doors must either follow rectangle edges as corridors or take direct, unobstructed routes. To address the NP-hardness of the problem, we present a metaheuristic framework with a novel encoding scheme that embeds exact path calculations. Experiments on standard benchmark instances confirm that our approach consistently outperforms existing methods, delivering superior solution quality and practical applicability. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_12792 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Open Loop Layout Optimization: Feasible Path Planning and Exact Door-to-Door Distance Calculation Shavarani, Seyed Mahdi Vizvari, Bela Gergely, Kovacs Optimization and Control The Open Loop Layout Problem (OLLP) seeks to position rectangular cells of varying dimensions on a plane without overlap, minimizing transportation costs computed as the flow-weighted sum of pairwise distances between cells. A key challenge in OLLP is to compute accurate inter-cell distances along feasible paths that avoid rectangle intersections. Existing approaches approximate inter-cell distances using centroids, a simplification that can ignore physical constraints, resulting in infeasible layouts or underestimated distances. This study proposes the first mathematical model that incorporates exact door-to-door distances and feasible paths under the Euclidean metric, with cell doors acting as pickup and delivery points. Feasible paths between doors must either follow rectangle edges as corridors or take direct, unobstructed routes. To address the NP-hardness of the problem, we present a metaheuristic framework with a novel encoding scheme that embeds exact path calculations. Experiments on standard benchmark instances confirm that our approach consistently outperforms existing methods, delivering superior solution quality and practical applicability. |
| title | Open Loop Layout Optimization: Feasible Path Planning and Exact Door-to-Door Distance Calculation |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2504.12792 |