A slicing tree representation and QCP-model-based heuristic algorithm for the unequal-area block facility layout problem
type: Item
instance of: scholarly article
title: A slicing tree representation and QCP-model-based heuristic algorithm for the unequal-area block facility layout problem
zbMATH Open document ID: 1299.90389
DOI: 10.1155/2013/853586
author: Mei-Shiang Chang
author: Ting-Chen Ku
published in: Mathematical Problems in Engineering
publication date: 2014-11-24T00:00:00Z
review text: Summary: The facility layout problem is a typical combinational optimization problem. In this research, a slicing tree representation and a quadratically constrained program model are combined with harmony search to develop a heuristic method for solving the unequal-area block layout problem. Because of characteristics of slicing tree structure, we propose a regional structure of harmony memory to memorize facility layout solutions and two kinds of harmony improvisation to enhance global search ability of the proposed heuristic method. The proposed harmony search based heuristic is tested on 10 well-known unequal-area facility layout problems from the literature. The results are compared with the previously best-known solutions obtained by genetic algorithm, tabu search, and ant system as well as exact methods. For problems O7, O9, vC10Ra, M11*, and Nug12, new best solutions are found. For other problems, the proposed approach can find solutions that are very similar to previous best-known solutions.
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6373185
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2013/853586
OpenAlex ID: W2024666644
Wikidata QID: Q59030689
cites work: An iterative facility layout algorithm
cites work: Novel derivative of harmony search algorithm for discrete design variables
cites work: A self-adaptive global best harmony search algorithm for continuous optimization problems
cites work: Stats: A slicing tree and tabu search based heuristic for the unequal area facility layout problem
cites work: Genetic algorithms, function optimization, and facility layout design
cites work: A simulated annealing algorithm for allocating space to manufacturing cells
cites work: Solving facility layout problems with geometric constraints using parallel genetic algorithms: Experimentation and findings
cites work: Q4855565
cites work: Optimal facility layout design
cites work: On solving facility layout problems using genetic algorithms
cites work: Integrated design of the block layout and aisle structure by simulated annealing
cites work: Applying ant system for solving unequal area facility layout problems
cites work: An improved harmony search algorithm for solving optimization problems
cites work: Global-best harmony search
cites work: A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice
cites work: Recent advances in harmony search algorithm
cites work: Enhanced Model Formulations for Optimal Facility Layout
cites work: Q3646697
cites work: A new mixed integer programming formulation for facility layout design using flexible bays
description: scientific article; zbMATH DE number 6373185