Tabu Search for the Single Row Facility Layout Problem Using Exhaustive 2-Opt and Insertion Neighborhoods

Ravi Kothari and Diptesh Ghosh (diptesh@iima.ac.in)

No WP2012-01-03, IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

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 signifi cantly speed up the search of the two neighborhoods. Our computational experiments show that the speed up techniques are eff ective, and our tabu search implementations are competitive. Our tabu search implementations improved several previously known best solutions for large sized benchmark SRFLP instances.

Date: 2012-01-11
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://www.iima.ac.in/sites/default/files/rnpfiles/7520037992012-01-03.pdf English Version (application/pdf)

Related works:
Journal Article: Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods (2013)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:iim:iimawp:11427

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department Contact information at EDIRC.
Bibliographic data for series maintained by (respub@iima.ac.in).