A constrained single-row facility layout problem

Kalita, Zahnupriya; Datta, Dilip

doi:10.1007/s00170-018-2370-6

Cited by 20 publications

(6 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Out of 93 instances the algorithm provided 29 instances were with improved results. Kalita and Datta (2018) studied the SRFLP in which some placement or/and a determined ordering constraint were imposed on some facilities. Gai and Ji (2019) regarding the FLP for healthcare services, proposed an integrated approach to solve the problem with two quantitative and qualitative objectives.…”

Section: Literature Reviewmentioning

confidence: 99%

A novel memory-based simulated annealing algorithm to solve multi-line facility layout problem

Zolfi¹,

Jouzdani²,

Shirouyehzad³

2023

10.5267/j.dsl

View full text Add to dashboard Cite

In this paper, a memory-based simulated annealing algorithm called the Dual Memory Simulated Annealing Algorithm (DMSA) is presented to solve multi-line facility layout problems. The objective is to minimize the total material handling cost. Two memory buffers and a restart mechanism are considered. Two benchmark problems were selected from the literature review papers and solved using the standard simulated annealing (SA) algorithm and the DMSA. The obtained results show that solutions provided by the DMSA algorithm are cost-effective compared to the standard SA algorithm and the other algorithms used for solving these test cases. Moreover, to further evaluate the performance of the DMSA algorithm in large scale problems, eleven test cases were selected from the benchmark library of the quadratic assignment problem (QAP). According to the results, the performance of the algorithm in finding solutions to complex problems is exemplary.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A novel memory-based simulated annealing algorithm to solve multi-line facility layout problem

Zolfi¹,

Jouzdani²,

Shirouyehzad³

2023

10.5267/j.dsl

View full text Add to dashboard Cite

show abstract

“…One of them is the constrained SRFLP in which some facilities need to be placed in certain locations or in specified orders. A permutation-based genetic algorithm [28] and a fireworks algorithm [29] were proposed for solving this problem. Keller [30] developed three construction heuristics for the SRFLP with machine-spanning clearances.…”

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

“…Kalita and Datta presented the single-row facility layout problem, which seeks the arrangement of given facilities along a straight row in such a way that the total material handling cost among the facilities is minimized [5]. It is introduced by instructing to place some facilities in fixed positions, and/or in specified orders with or without allowing the placement of other facilities in between two ordered facilities.…”

Section: Literature Reviewmentioning

confidence: 99%

Optimising Production Systems Using Genetic Algorithms

Kremljak¹

2019

DAAAM Proceedings

View full text Add to dashboard Cite

As the most widespread type of evolution algorithms, genetic algorithms (GA) have become a very popular means of heuristically resolving optimisation-related issues. GA have proven extremely powerful particularly in cases when solutions from a wide scope of examination are required. Hitherto, GA have resolved non-deterministic problems. Solutions have not been sought in pre-determined ways and an array thereof has been handled simultaneously which has proven particularly appropriate for problems faced in complex production and business processes. Instead of certainty, order and logical deductions, we are faced with randomisation, evolution and self-organisation.In this paper, GA are applied on the case-basis of production of aluminium products (variation of production parameters or comparison of equipment layout). The main target of the presented model is to achieve an optimum production plan by taking into consideration dynamic conditions, such as: customer orders, inventories, capacity utilisation rate, quality or raw materials and products and original or cellular layout of equipment.

show abstract

A constrained single-row facility layout problem

Cited by 20 publications

References 37 publications

A novel memory-based simulated annealing algorithm to solve multi-line facility layout problem

A novel memory-based simulated annealing algorithm to solve multi-line facility layout problem

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

Optimising Production Systems Using Genetic Algorithms

Contact Info

Product

Resources

About