Share This Article:

Hybrid Genetic Algorithm and Variable Neighborhood Search for Dynamic Facility Layout Problem

HTML XML Download Download as PDF (Size:383KB) PP. 156-167
DOI: 10.4236/ojop.2015.44015    3,482 Downloads   4,377 Views Citations
Author(s)

ABSTRACT

This paper presents a novel hybrid metaheuristic GA-VNS matching genetic algorithm (GA) and variable neighborhood search (VNS) to the dynamic facility layout problem (DFLP). The DFLP is a well-known NP hard problem which aims at assigning a set of facilities to a set of locations over a time planning horizon so that the total cost including material handling cost and re-arrangement cost is minimized. The proposed hybrid approach in this paper elegantly integrates the exploitation ability of VNS and exploration ability of GA. To examine the performance of the proposed hybrid approach, a set of instance problems have been used from the literature. As demonstrated in the results, the GA-VNS is mighty of attaining high quality solution. Compared with some state-of-the-art algorithms, our proposed hybrid approach is competitive.

Cite this paper

Uddin, M. (2015) Hybrid Genetic Algorithm and Variable Neighborhood Search for Dynamic Facility Layout Problem. Open Journal of Optimization, 4, 156-167. doi: 10.4236/ojop.2015.44015.

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.