R. Uribe, NicolásHerrán, AlbertoColmenar, J. Manuel2025-01-212025-01-212023-05-29R. Uribe, N., Herrán, A., Colmenar, J.M. (2023). A Basic Variable Neighborhood Search Approach for the Bi-objective Multi-row Equal Facility Layout Problem. In: Sleptchenko, A., Sifaleras, A., Hansen, P. (eds) Variable Neighborhood Search. ICVNS 2022. Lecture Notes in Computer Science, vol 13863. Springer, Cham. https://doi.org/10.1007/978-3-031-34500-5_11978-3-031-34500-5https://hdl.handle.net/10115/60918The Bi-Objective Multi-Row Facility Layout Problem is a problem belonging to the family of Facility Layout Problems. This problem is challenging for exact and metaheuristics approaches. We use the Pareto front approach instead of the weight approach by means of a non-dominated solution set which we update in order to keep only the non-dominated solutions. To tackle this problem, we propose a Basic VNS algorithm based on a constructive method that generates random solutions, a mono-objective local search that relies on an interchange move, and a shake method that applies insert moves. In this regard, we also explain how to adapt the mono-objective schema of the BVNS for a multi-objective one. Then, we compare our results with the state of the art and propose future work.enBasic VNSBi-Objective optimizationFacility LocationBook chapterhttps://doi.org/10.1007/978-3-031-34500-5_11info:eu-repo/semantics/closedAccess