Fast local search for single row facility layout

DOI10.1016/J.EJOR.2015.05.055zbMATH Open1346.90515OpenAlexW2200226441MaRDI QIDQ319872FDOQ319872

Gintaras Palubeckis

Publication date: 6 October 2016

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

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

Recommendations

• Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
• Insertion based Lin-Kernighan heuristic for single row facility layout
• The single row facility layout problem: state of the art
• Fast simulated annealing for single-row equidistant facility layout
• A computational study and survey of methods for the single-row facility layout problem

zbMATH Keywords

combinatorial optimizationlocal searchvariable neighborhood searchsingle row facility layout

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• Variable neighbourhood search: Methods and applications
• Variable neighborhood search: Principles and applications
• Variable neighbourhood search: methods and applications
• A new lower bound for the single row facility layout problem
• Experimental analysis of simulated annealing based algorithms for the layout problem
• Fast simulated annealing for single-row equidistant facility layout
• An ant algorithm for the single row layout problem in flexible manufacturing systems
• The single row facility layout problem: state of the art
• Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
• An efficient tabu algorithm for the single row facility layout problem
• An efficient genetic algorithm for single row facility layout
• On the exact solution of a facility layout problem
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions
• Global Approaches for Facility Layout and VLSI Floorplanning
• Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
• Single row layout models
• An Exact Approach to the One-Dimensional Facility Layout Problem
• Insertion based Lin-Kernighan heuristic for single row facility layout
• Provably near-optimal solutions for very large single-row facility layout problems
• A computational study and survey of methods for the single-row facility layout problem
• A polyhedral approach to the single row facility layout problem
• On the One-Dimensional Space Allocation Problem
• Tabu Search Applied to the Quadratic Assignment Problem
• A branch-and-bound algorithm for the single-row equidistant facility layout problem
• Single row facility layout problem using a permutation-based genetic algorithm
• One-Dimensional Space Allocation: An Ordering Algorithm
• Efficient models for the facility layout problem
• Methods for the one-dimensional space allocation problem

Cited In (10)

• Exact approaches for the combined cell layout problem
• A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
• A GRASP algorithm for solving large-scale single row facility layout problems
• Decorous combinatorial lower bounds for row layout problems
• New exact approaches to row layout problems
• Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
• Construction heuristics for the single row layout problem with machine-spanning clearances
• A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
• Fast simulated annealing for single-row equidistant facility layout
• Design and evaluation of layout alternatives to enhance the performance of industry

This page was built for publication: Fast local search for single row facility layout

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