Martín-Santamaría, RaúlColmenar Verdugo, Jose ManuelDuarte Muñoz, Abraham2024-12-182024-12-182023-02-23978-3-031-26503-7978-3-031-26504-4https://hdl.handle.net/10115/42777In this work, we present a new approach for the Parallel Row Ordering Problem (PROP), based on the Scatter Search metaheuristic. The PROP focuses on minimizing the total weighted sum of all distances between each pair of facility centers in a linear layout. The proposed method is able to obtain all known optimal values in a fraction of the time required by the previous exact methods for the set of smaller instances, and it outperforms the current state of the art metaheuristic for the set of larger instances, spending a comparable computing time.In this work, we present a new approach for the Parallel Row Ordering Problem (PROP), based on the Scatter Search metaheuristic. The PROP focuses on minimizing the total weighted sum of all distances between each pair of facility centers in a linear layout. The proposed method is able to obtain all known optimal values in a fraction of the time required by the previous exact methods for the set of smaller instances, and it outperforms the current state of the art metaheuristic for the set of larger instances, spending a comparable computing time.en-USAttribution-NonCommercial-ShareAlike 4.0 Internationalhttp://creativecommons.org/licenses/by-nc-sa/4.0/Preprint10.1007/978-3-031-26504-4_40info:eu-repo/semantics/openAccess