A matheuristic for solving the single row facility layout problem

DOI10.1016/J.COR.2026.107397MaRDI QIDQ7237886zbMATH OpenFDO

Authors Thomas Pammer, Markus Sinnl

Publication date 4 May 2026

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2026.107397

zbMATH Keywords

facility layoutinteger programmingmatheuristicmulti-start simulated annealing

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A GRASP algorithm for solving large-scale single row facility layout problems
• A heuristic procedure for the single-row facility layout problem
• A new lower bound for the single row facility layout problem
• A polyhedral approach to the single row facility layout problem
• A semidefinite approach for the single row facility layout problem
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions
• An ant algorithm for the single row layout problem in flexible manufacturing systems
• Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
• Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
• Experimental analysis of simulated annealing based algorithms for the layout problem
• Fast local search for single row facility layout
• scientific article; zbMATH DE number 5117490 (Why is no real title available?)
• scientific article; zbMATH DE number 5152600 (Why is no real title available?)
• Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• Local branching
• Matheuristics. Algorithms and implementations
• Methods for the one-dimensional space allocation problem
• On Solving A One-Dimensional Space Allocation Problem With Integer Programming
• On the One-Dimensional Space Allocation Problem
• One-Dimensional Space Allocation: An Ordering Algorithm
• Optimal linear arrangements using betweenness variables
• Single row facility layout problem using a permutation-based genetic algorithm
• Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.

Cited in

(1)

• An efficient memetic algorithm for the corridor allocation problem

This page was built for publication: A matheuristic for solving the single row facility layout problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7237886)