Insertion based Lin-Kernighan heuristic for single row facility layout

DOI10.1016/J.COR.2012.05.017MaRDI QIDQ339556zbMATH OpenOpenAlexFDO

Authors Ravi Kothari, Diptesh Ghosh

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

zbMATH Keywords

local searchfacilities planning and designsingle row facility layoutinsertion neighborhoodLin-Kernighan neighborhood

Mathematics Subject Classification ID

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

Recommendations

• Fast local search for single row facility layout
• Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
• The single row facility layout problem: state of the art
• A polyhedral approach to the single row facility layout problem
• A computational study and survey of methods for the single-row facility layout problem

Cites work

• A computational study and survey of methods for the single-row facility layout problem
• A heuristic procedure for the single-row facility layout problem
• A new lower bound for the single row facility layout problem
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An Exact Approach to the One-Dimensional Facility Layout Problem
• An ant algorithm for the single row layout problem in flexible manufacturing systems
• An efficient tabu algorithm for the single row facility layout problem
• Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
• Deux problèmes d'affectation non linéaires
• Efficient models for the facility layout problem
• Experimental analysis of simulated annealing based algorithms for the layout problem
• 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
• On the exact solution of a facility layout problem
• One-Dimensional Space Allocation: An Ordering Algorithm
• Provably near-optimal solutions for very large single-row facility layout problems
• 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.
• The single row facility layout problem: state of the art

Cited in

(7)

• Simulated annealing and tabu search approaches for the Corridor Allocation Problem
• New exact approaches to row layout problems
• Fast local search for single row facility layout
• Single row layout models
• Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
• Social structure optimization in team formation
• Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods

This page was built for publication: Insertion based Lin-Kernighan heuristic for single row facility layout

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