A Path Relinking-based approach for the Bi-Objective Double Floor Corridor Allocation Problem

dc.contributor.authorR. Uribe, Nicolás
dc.contributor.authorHerrán, Alberto
dc.contributor.authorColmenar, J. Manuel
dc.date.accessioned2025-01-21T13:04:14Z
dc.date.available2025-01-21T13:04:14Z
dc.date.issued2024-06-12
dc.description.abstractThe Bi-Objective Double Floor Corridor Allocation Problem is one of the most recent incorporation to the family of Facility Layout Problems. This problem, which has been a challenge for exact and metaheuristic approaches, involves optimizing the layout of the given facilities to minimize material handling cost and the length of the corridor considering more than one floor. This paper introduces a new approach based on the combination of two greedy methods and a path relinking implementation to tackle this problem. The experimental results show the superiority of our proposal in relation to the current state-of-the-art under different multi-objective metrics.
dc.identifier.citationR. Uribe, N., Herrán, A., Colmenar, J.M. (2024). A Path Relinking-Based Approach for the Bi-Objective Double Floor Corridor Allocation Problem. In: Alonso-Betanzos, A., et al. Advances in Artificial Intelligence. CAEPIA 2024. Lecture Notes in Computer Science(), vol 14640. Springer, Cham. https://doi.org/10.1007/978-3-031-62799-6_12
dc.identifier.doihttps://doi.org/10.1007/978-3-031-62799-6_12
dc.identifier.isbn978-3-031-62799-6
dc.identifier.urihttps://hdl.handle.net/10115/60957
dc.language.isoen
dc.publisherSpringer
dc.rights.accessRightsinfo:eu-repo/semantics/closedAccess
dc.subjectPath Relinking
dc.subjectBi-Objective optimization
dc.subjectFacility Layout Problem
dc.titleA Path Relinking-based approach for the Bi-Objective Double Floor Corridor Allocation Problem
dc.typeBook chapter

Archivos

Bloque original

Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
LNAI_BDFCAP.pdf
Tamaño:
618.71 KB
Formato:
Adobe Portable Document Format