Insertion based Lin-Kernighan heuristic for single row facility layout
From MaRDI portal
Publication:339556
DOI10.1016/j.cor.2012.05.017zbMath1349.90566OpenAlexW2055640993MaRDI QIDQ339556
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.05.017
local searchfacilities planning and designsingle row facility layoutinsertion neighborhoodLin-Kernighan neighborhood
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (6)
Single row layout models ⋮ Fast local search for single row facility layout ⋮ Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem ⋮ Social structure optimization in team formation ⋮ Simulated annealing and tabu search approaches for the Corridor Allocation Problem ⋮ New exact approaches to row layout problems
Cites Work
- A computational study and survey of methods for the single-row facility layout problem
- Single row facility layout problem using a permutation-based genetic algorithm
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- Efficient models for the facility layout problem
- Methods for the one-dimensional space allocation problem
- A new lower bound for the single row facility layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- A heuristic procedure for the single-row facility layout problem
- 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
- On the exact solution of a facility layout problem
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
- An Exact Approach to the One-Dimensional Facility Layout Problem
- Provably near-optimal solutions for very large single-row facility layout problems
- On the One-Dimensional Space Allocation Problem
- Deux problèmes d'affectation non linéaires
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- One-Dimensional Space Allocation: An Ordering Algorithm
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: Insertion based Lin-Kernighan heuristic for single row facility layout