Optimization Online


Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods

Ravi Kothari(ravikothari***at***iimahd.ernet.in)
Diptesh Ghosh(diptesh***at***iimahd.ernet.in)

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 NP-hard. In this paper, we present two tabu search implementations, one involving an exhaustive search of the 2-opt neighborhood and the other involving an exhaustive search of the insertion neighborhood. We also present techniques to significantly speed up the search of the two neighborhoods. Our computational experiments show that the speed up techniques are effective, and our tabu search implementations are competitive. Our tabu search implementations improved previously known best solutions for 24 out of the 40 large sized benchmark SRFLP instances.

Keywords: Facilities planning and design; Single Row Facility Layout; Tabu Search

Category 1: Applications -- Science and Engineering (Facility Planning and Design )

Category 2: Combinatorial Optimization

Citation: WP2012-01-03, Indian Institute of Management Ahmedabad, January 2012

Download: [PDF]

Entry Submitted: 01/13/2012
Entry Accepted: 01/13/2012
Entry Last Modified: 01/13/2012

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society