EconPapers    
Economics at your fingertips  
 

A methodology for solving facility layout problem considering barriers: genetic algorithm coupled with A* search

Mariem Besbes (), Marc Zolghadri (), Roberta Costa Affonso (), Faouzi Masmoudi () and Mohamed Haddar ()
Additional contact information
Mariem Besbes: Quartz-Supmeca
Marc Zolghadri: Quartz-Supmeca
Roberta Costa Affonso: Quartz-Supmeca
Faouzi Masmoudi: University of Sfax
Mohamed Haddar: University of Sfax

Journal of Intelligent Manufacturing, 2020, vol. 31, issue 3, No 6, 615-640

Abstract: Abstract This work proposes a new methodology and mathematical formulation to address the facility layout problem. The goal is to minimise the total material handling cost subjected to production-derived constraints. This cost is a function of the distance that the products should cover within the facility. The first idea is to use the $$ {\text{A}}^{ *} $$A∗ algorithm to identify the distances between workstations in a more realistic way. $$ {\text{A}}^{ *} $$A∗ determines the shortest path within the facility that contains obstacles and transportation routes. The second idea is to combine a genetic algorithm and the $$ {\text{A}}^{ *} $$A∗ algorithm with a homogenous methodology to improve the quality of the facility layouts. In an iterative way, the layout solution space is explored using the genetic algorithm. We study the impacts of the appropriate crossover and mutation operators and the values of the parameters used in this algorithm on the cost of the proposed arrangements. These operators and parameter values are fine-tuned using Monte Carlo simulations. The facility arrangements are all compared and discussed based on their material handling cost associated with the Euclidean distance, rectilinear distance, and $$ {\text{A}}^{ *} $$A∗ algorithm. Finally, we present a set of conclusions regarding the suggested methodology and discuss our future research goals.

Keywords: Manufacturing systems design; Facility layout problem; Genetic algorithm; $$ {\text{A}}^{ * } $$ A ∗ search algorithm; Monte Carlo simulation (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10845-019-01468-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
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:spr:joinma:v:31:y:2020:i:3:d:10.1007_s10845-019-01468-x

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10845

DOI: 10.1007/s10845-019-01468-x

Access Statistics for this article

Journal of Intelligent Manufacturing is currently edited by Andrew Kusiak

More articles in Journal of Intelligent Manufacturing from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:joinma:v:31:y:2020:i:3:d:10.1007_s10845-019-01468-x