An efficient variable neighborhood search for the space-free multi-row facility layout problem

DOI10.1016/j.ejor.2021.03.027zbMath1490.90186OpenAlexW3143561285MaRDI QIDQ2242375

Alberto Herrán, Abraham Duarte, J. Manuel Colmenar

Publication date: 9 November 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.03.027

zbMATH Keywords

metaheuristicsvariable neighborhood searchfacility layout problemspace-free multi-row facility layout problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Uses Software

• RowLayout

Cites Work

• The corridor allocation problem
• A survey for the quadratic assignment problem
• Variable neighborhood search
• Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
• Greedy randomized adaptive search procedures
• A variable neighborhood search approach for the vertex bisection problem
• Simulated annealing and tabu search approaches for the Corridor Allocation Problem
• New exact approaches to row layout problems
• Combining simulation and optimization for extended double row facility layout problems in factory planning
• Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• Machine layout problem in modern manufacturing facilities
• A parallel variable neighborhood search approach for the obnoxious p‐median problem

This page was built for publication: An efficient variable neighborhood search for the space-free multi-row facility layout problem