Hybrid Estimation of Distribution Algorithm for solving Single Row Facility Layout Problem

Ouyang, Cheng; Utamima, Amalia

doi:10.1016/j.cie.2013.05.018

Cited by 49 publications

(13 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…To deal with larger sized SRFLP instances, one common option is to use metaheuristic-based algorithms. The more recent metaheuristic approaches available in the literature are tabu search [8,9], genetic algorithms [10][11][12], a Lin-Kernighan heuristic [13], hybrid estimation of distribution algorithm [14], scatter search [15], variable neighborhood search (VNS) [16], greedy randomized adaptive search procedure (GRASP) with path relinking [17], a hybrid algorithm of VNS and ant colony optimization [18], simulated annealing [19], a crossentropy approach [20], a population-based improvement heuristic with local search [21], GRASP [22], a simplified swarm optimization algorithm [23], differential evolution [24], and algebraic differential evolution for permutations [25]. Sun et al [26] used graphics processing units to solve the SRFLP with the two-opt-based simulated annealing algorithm.…”

Section: Related Workmentioning

confidence: 99%

A Variable Neighborhood Search Approach for the Dynamic Single Row Facility Layout Problem

2022

View full text Add to dashboard Cite

The dynamic single row facility layout problem (DSRFLP) is defined as the problem of arranging facilities along a straight line during a multi-period planning horizon with the objective of minimizing the sum of the material handling and rearrangement costs. The material handling cost is the sum of the products of the flow costs and center-to-center distances between facilities. In this paper, we focus on metaheuristic algorithms for this problem. The main contributions of the paper are three-fold. First, a variable neighborhood search (VNS) algorithm for the DSRFLP is proposed. The main version of VNS uses an innovative strategy to start the search from a solution obtained by constructing an instance of the single row facility layout problem (SRFLP) from a given instance of the DSRFLP and applying a heuristic algorithm for the former problem. Second, a fast local search (LS) procedure is developed. The innovations of this procedure are two-fold: (i) the fast insertion and swap neighborhood exploration techniques are adapted for the case of the dynamic version of the SRFLP; and (ii) to reduce the computational time, the swap operation is restricted on pairs of facilities of equal lengths. Provided the number of planning periods is a constant, the neighborhood exploration procedures for n facilities have only O(n2) time complexity. The superiority of these procedures over traditional LS techniques is also shown by performing numerical tests. Third, computational experiments on DSRFLP instances with up to 200 facilities and three or five planning periods are carried out to validate the effectiveness of the VNS approach. The proposed VNS heuristic is compared with the simulated annealing (SA) method which is the state of the art algorithm for the DSRFLP. Experiments show that VNS outperforms SA by a significant margin.

show abstract

Section: Related Workmentioning

confidence: 99%

A Variable Neighborhood Search Approach for the Dynamic Single Row Facility Layout Problem

2022

View full text Add to dashboard Cite

show abstract

“…Row FLPs are one-dimensional problems in which facilities are to be arranged along a row. These FLPs are again classified into single row, double row, multi-rows and loop FLPs (Ou-Yang and Utamima, 2013; Anjos et al , 2018; Nagarajan et al , 2021).…”

Section: Overview Of Facility Layout Problemsmentioning

confidence: 99%

A survey on discrete space and continuous space facility layout problems

Hunagund¹,

Pillai

Kempaiah

2021

JFM

View full text Add to dashboard Cite

Purpose The purpose of this paper is to review, evaluate and classify the academic research that has been published in facility layout problems (FLPs) and to analyse how researches and practices on FLPs are. Design/methodology/approach The review is based on 166 papers published from 1953 to 2021 in international peer-reviewed journals. The literature review on FLPs is presented under broader headings of discrete space and continuous space FLPs. The important formulations of FLPs under static and dynamic environments represented in the discrete and continuous space are presented. The articles reported in the literature on various representations of facilities for the continuous space Unequal Area Facility Layout Problems (UA-FLPs) are summarized. Discussed and commented on adaptive and robust approaches for dynamic environment FLPs. Highlighted the application of meta-heuristic solution methods for FLPs of a larger size. Findings It is found that most of the earlier research adopted the discrete space for the formulation of FLPs. This type of space representation for FLPs mostly assumes an equal area for all facilities. UA-FLPs represented in discrete space yield irregular shape facilities. It is also observed that the recent works consider the UA-FLPs in continuous space. The solution of continuous space UA-FLPs is more accurate and realistic. Some of the recent works on UA-FLPs consider the flexible bay structure (FBS) due to its advantages over the other representations. FBS helps the proper design of aisle structure in the detailed layout plan. Further, the recent articles reported in the literature consider the dynamic environment for both equal and unequal area FLPs to cope with the changing market environment. It is also found that FLPs are Non-deterministic Polynomial-complete problems, and hence, they set the challenges to researchers to develop efficient meta-heuristic methods to solve the bigger size FLPs in a reasonable time. Research limitations/implications Due to the extremely large number of papers on FLPs, a few papers may have inadvertently been missed. The facility layout design research domain is extremely vast which covers other areas such as cellular layouts, pick and drop points and aisle structure design. This research review on FLPs did not consider the papers published on cellular layouts, pick and drop points and aisle structure design. Despite the possibility of not being all-inclusive, the authors firmly believe that most of the papers published on FLPs are covered and the general picture presented on various approaches and parameters of FLPs in this paper are precise and trustworthy. Originality/value To the best of the authors’ knowledge, this paper reviews and classifies the literature on FLPs for the first time under the broader headings of discrete space and continuous space representations. Many important formulations of FLPs under static and dynamic environments represented in the discrete and continuous space are presented. This paper also provides the observations from the literature review and identifies the prospective future directions.

show abstract

“…HOT (Mir & Imam, 2001) Allahyari & Azab, 2018Derakhshan & Wong,2017. LW5 Rubio-Sanchez et al, 2016;Datta et al, 2011;Heragu & Kusiak, 1991;Heragu &Alfa, 1992;Kumar et al, 1995;Amaral, 2006;Amaral, 2008;Teo, & Ponnambalam, 2008;Ou-Yang & Utamima, 2013 LW11 Rubio-Sanchez et al, 2016;Datta et al, 2011;Heragu & Kusiak, 1991;Heragu &Alfa, 1992;Kumar et al, 1995;Amaral, 2006;Amaral, 2008;Teo, & Ponnambalam, 2008;Ou-Yang & Utamima, 2013 M11, M15, M25 department problem (Meller, 1992Wong & Komarudin, 2010;Klausnitzer & Lasch, 2019.…”

Section: General Overview Of the Benchmarking Proceduresmentioning

confidence: 99%

Facility layout problem: Bibliometric and benchmarking analysis

Scalia¹,

Micale²,

Enea³

2019

10.5267/j.ijiec

View full text Add to dashboard Cite

Facility layout problem is related to the location of departments in a facility area, with the aim of determining the most effective configuration. Researches based on different approaches have been published in the last six decades and, to prove the effectiveness of the results obtained, several instances have been developed. This paper presents a general overview on the extant literature on facility layout problems in order to identify the main research trends and propose future research questions. Firstly, in order to give the reader an overview of the literature, a bibliometric analysis is presented. Then, a clusterization of the papers referred to the main instances reported in literature was carried out in order to create a database that can be a useful tool in the benchmarking procedure for researchers that would approach this kind of problems.

show abstract

Hybrid Estimation of Distribution Algorithm for solving Single Row Facility Layout Problem

Cited by 49 publications

References 21 publications

A Variable Neighborhood Search Approach for the Dynamic Single Row Facility Layout Problem

A Variable Neighborhood Search Approach for the Dynamic Single Row Facility Layout Problem

A survey on discrete space and continuous space facility layout problems

Facility layout problem: Bibliometric and benchmarking analysis

Contact Info

Product

Resources

About