Signal Processing and Information Technology. First International Joint Conference, SPIT 2011 and IPC 2011, Amsterdam, The Netherlands, December 1-2, 2011, Revised Selected Papers

Research Article

A Non-greedy Local Search Heuristic for Facility Layout Problem

Download
398 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-32573-1_28,
        author={Rajesh Matai and Surya Singh and Murari Mittal},
        title={A Non-greedy Local Search Heuristic for Facility Layout Problem},
        proceedings={Signal Processing and Information Technology. First International Joint Conference, SPIT 2011 and IPC 2011, Amsterdam, The Netherlands, December 1-2, 2011, Revised Selected Papers},
        proceedings_a={SPIT \& IPC},
        year={2012},
        month={10},
        keywords={Local search Facility Layout Problem Quadratic Assignment Problem},
        doi={10.1007/978-3-642-32573-1_28}
    }
    
  • Rajesh Matai
    Surya Singh
    Murari Mittal
    Year: 2012
    A Non-greedy Local Search Heuristic for Facility Layout Problem
    SPIT & IPC
    Springer
    DOI: 10.1007/978-3-642-32573-1_28
Rajesh Matai1,*, Surya Singh2,*, Murari Mittal3,*
  • 1: BITS Pilani
  • 2: IIT Delhi
  • 3: MNIT Jaipur
*Contact email: rajeshmatai73@gmail.com, surya.singh@gmail.com, mlmittal.mnit@gmail.com

Abstract

This paper proposes a non-greedy local search heuristic for solving facility layout problem. The proposed heuristic works on non-greedy systematic pair wise exchange of two facilities, that is 2-exchange local search based on non-greedy strategy. Pair wise exchanges are accepted if the objective function value after the exchange is lowered or smaller than the average objective function increment divided by an intensity factor. Proposed heuristic is tested on commonly used Nugxx series problems and computational results show efficiency and effectiveness of proposed heuristic.