Insertion based Lin-Kernighan heuristic for single row facility layout

Authors:
Ravi Kothari;Diptesh Ghosh
Affiliations:
P&QM Area, IIM Ahmedabad, Vastrapur, Ahmedabad 380015, Gujarat, India;P&QM Area, IIM Ahmedabad, Vastrapur, Ahmedabad 380015, Gujarat, India
Venue:
Computers and Operations Research
Year:
2013

Citing 8
Cited 1

Machine layout problem in flexible manufacturing systems

Operations Research
Methods for the one-dimensional space allocation problem

Computers and Operations Research
An ant algorithm for the single row layout problem in flexible manufacturing systems

Computers and Operations Research
A new lower bound for the single row facility layout problem

Discrete Applied Mathematics
An Exact Approach to the One-Dimensional Facility Layout Problem

Operations Research
Provably near-optimal solutions for very large single-row facility layout problems

Optimization Methods & Software - GLOBAL OPTIMIZATION
A particle swarm optimization for the single row facility layout problem

Computers and Industrial Engineering
A semidefinite optimization approach for the single-row layout problem with unequal dimensions

Discrete Optimization

A scatter search algorithm for the single row facility layout problem

Journal of Heuristics

Quantified Score

Hi-index	0.01

Visualization

Abstract

The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is known to be NP-hard. In this paper, we present a neighborhood search heuristic called LK-INSERT which uses a Lin-Kernighan neighborhood structure built on insertion neighborhoods. To the best of our knowledge this is the first such heuristic for the SRFLP. Our computational experiments show that LK-INSERT is competitive for most instances, and it improves the best known solutions for several large sized benchmark SRFLP instances.