Two Approaches for the Cubic Facility Layout Problem
Overview & Synopsis
This paper addresses a combinatorial optimization problem common in automated workshops, where facilities must be arranged to minimize the total travel distance of products between them {required to accomplish a scheduled plan of production}. This problem generalizes the \textbf{Quadratic Assignment Problem (QAP)}, introduced by Koopmans and Beckmann in 1957.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Two Approaches for the Cubic Facility Layout Problem |
|---|---|
| Author / Organization | An Tran, Mourad Baiou, Rafael Colares-Borges, Hector Gatt, Thomas Guy |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2025 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-195256 |
| Original Source Link | Visit Source Page on hal.science » |