Bibliometric-based visual knowledge graph analysis of facility layout problems

Facility Layout Problem (FLP) can be considered as a classical problem in quantitative studies. However, the literature in FLP are largely neglected the thermal comfort as part of the objective function. Today, energy savings for buildings are a major concern in the world as they cover a big portion of energy use. The public room consumes high energy use because of its ability to occupy many people at one time. Issues arise when each person has a dissimilar thermal satisfaction rate, while each area in a room provides a different temperature. There are many factors that influence the people dispersion in the room including the facility layout. However, it is really testing to handle an air-conditioning control () system by considering the mention factors to ensure the thermal satisfaction is increased and energy is reduced. Since lack of report on thermal factors in Facility Layout Problem (FLP) area, this work aims to optimize the temperature setting of an system at the best point and achieving the finest plan for the facility layout in a room. Further, our ultimate goals to maximize the thermal comfort level and reduce energy consumption are able to accomplish. A non-linear mathematical model is utilized to optimize the thermal satisfaction rate () and room layout. At the end of the article, we proposed an Evolutionary Algorithm (EA) to find a quality solution or near optimal since it is hard to solve this problem in a reasonable time.

The Single-Row Facility Layout Problem (SRFLP) is one of the most studied facility layout problems in the literature. It asks for an optimal arrangement of departments with given lengths on a row such that the weighted sum of all centre-to-centre distances between department pairs is minimised. Real-world facility layouts may require taking different restrictions on the placement of departments into account, such as arrangement on a fixed position, pairwise placement, or precedence considerations. Therefore, we consider the constrained Single-Row Facility Layout Problem (cSRFLP) that additionally considers positioning, ordering, and relation constraints on single-row facility layouts. In this work, we suggest a new Integer Linear Programming (ILP) formulation for the cSRFLP, which outperforms the best available exact approach in literature. In an extensive computational study, we apply our ILP approach as well as an LP-based cutting plane algorithm on SRFLP and cSRFLP instances from the literature. We provide optimal cSRFLP layouts as well as strong lower bounds for instances with up to 42 departments. Further, we present new results for SRFLP instances from the literature. Additionally, we demonstrate the individual impact of the constraint sets on the run times of cSRFLP instances to emphasise further research on this rarely studied practice-oriented Facility Layout Problem.

The most desirable characteristic of a facility layout is its ability to maintain its efficiency over time while coping with the uncertainty in product demand. In the traditional facility layout design method, the facility layout is governed by the flow intensity between departments, which is the product flow quantity between departments. Hence, an error in the product demand assessment can render the layout inefficient with respect to material handling costs. Most of the research integrates uncertainty in the form of probability of occurrence of different from-to charts. In an environment where the variability of each product demand is independent, the derivation of ‘probabilistic from-to chart’ based scenario cannot be used to address uncertainty of individual demands. This paper presents an FLP (facility layout problem) approach to deal with the uncertainty of each product demand in the design of a facility layout. Two procedures are presented: the first procedure is utilised to assess the risk associated with the layout, while the second procedure is used to develop the layout that minimises the risk. Results from case studies have shown that the procedure produces a reduction of risk as high as 68%.

This paper focuses on solving the Continuous Facility Layout Problem (CFLP), which aims to minimize material handling costs by strategically placing facilities in a known or unknown area. The objective is to find optimal or near-optimal facility arrangements while adhering to non-overlapping and spatial constraints, thus enhancing the efficiency of production systems. The study addresses various layout scenarios, including single-row facility layout (with and without clearance), continuous layout, and unequal-area facility layout problems. To achieve this, the authors propose a mixed-integer nonlinear programming (MINLP) model tailored for continuous layouts. Two meta-heuristic algorithms are developed to optimize this model: a hybrid Simulated Annealing-Genetic Algorithm (SA-GA), which leverages genetic crossover operations, and an Enhanced Harmony Search Algorithm (EHSA), featuring dynamic parameters and a novel improvisation technique. The proposed methods provide flexible and efficient solutions for both small and large-scale layout problems, offering decision-makers practical tools for real-world applications.

New complexity measures for the facility layout problem: an empirical study using traditional and neural network analysis

Semiconductor chips are the most basic components of smart wearable device and other AI devices. The problem of facility layout in semiconductor fabrication is considered very important, for it will affect the cost saving and performance improvement of the key chips implanted in artificial intelligence production such as intelligent wearable devices. Facility layout problem in semiconductor fabrication is to determine the optimal placement of facilities in a multi-row particular area. In this study, we propose a mathematical model to solve multi-row facility layout problem regarded as a predefined system of discrete points to place the processing modules at different locations in semiconductor fabrication plants (i.e., semiconductor fabrication). Considering the large amounts of computation required we use particle swarm optimization (PSO) algorithm to solve the multi-row facility layout problem by minimizing the total transportation distance between the modules. The results confirm that the PSO algorithm is an effective and practical approach for solving the multi-row facility layout problem within a shorter period. The effect of the number of particles on the efficiency of the PSO algorithm is also discussed in this paper.

ABSTRACTIn manufacturing industries, the facility layout design is a very important task, as it is concerned with the overall manufacturing cost and profit of the industry. The facility layout problem (FLP) is solved by arranging the departments or facilities of known dimensions on the available floor space. The objective of this article is to implement the firefly algorithm (FA) for solving unequal-area, fixed-shape FLPs and optimizing the costs of total material handling and transportation between the facilities. The FA is a nature-inspired algorithm and can be used for combinatorial optimization problems. Benchmark problems from the previous literature are solved using the FA. To check its effectiveness, it is implemented to solve large-sized FLPs. Computational results obtained using the FA show that the algorithm is less time consuming and the total layout costs for FLPs are better than the best results achieved so far.

<p>The electrical equipment industry in Indonesia is one of the factors that triggers economic growth. Labor productivity determines the success of project implementation. The non-optimal facility layout is one of the factors that triggers low labor productivity. The non-optimal facility layout affects the flow of information in the company. This study examines the problem of non-optimal office facility layout with TSP, ARC and ARD methods at PT. Duta Wijaya Elektrindo Engineering (PT. DWP). The method stated above can minimize the total distance traveled between office facilities so that work efficiency and workforce productivity may increase. The results of data processing indicate that the recommended office facility layout recommendations that are in accordance with the level of closeness between departments based on PST, ARC and ARD is the first recommendation. With reduced total distance traveled in the first layout of the proposed office facilities, the level of employee productivity and work efficiency will increase. The smallest total distance traveled on the proposed layout of the office facilities is 244.22 meters with a reduction of 36% from the initial conditions.</p>

The facility layout problems are always important in the production or service industry system. For many years, it has been a common research field in active research. It seen that various methods were used in literature review for improving facility layout. We used association analysis which is one of the techniques of data mining in this study. The primary aim of this study is to improving the emergency department's efficiency, increasing patient satisfaction and employee satisfaction, decreasing travelled distance in emergency department. In this study, data acquired from information system of an emergency service was examined by means of data mining techniques (association rules such as GRI and Apriori) and relations between departments were found out. Association rules were analyzed via data mining techniques applied and then departments having more flow density with each other were determined. In consideration of this information an alternative facility layout planning was planned in regard to analysis results of departments’ closeness situations, advices of emergency service doctor and observations made.

This paper focuses on facility layout design problem in microfluidic device manufacturing. Microfluidics device manufacturing requires exquisite work of operators and relatively much higher material cost than other types of manufacturing. Facility layout problem can directly affect the overall cost of manufacturing, particularly in handling and transport cost. Therefore, the objective of this study is to minimize the total handling and transport cost for facility layout design problem. A genetic algorithm (GA) is employed to find a good alternative facility layout design which is based on the performance metrics. Experimental results show that this approach is more feasible in dealing with the facility layout in microfluidics device fabrication.

Facility layout problems deal with layout of facilities or departments in a shop floor. This article studies unequal-area static facility layout problems in order to minimize the sum of the material handling costs and unequal-area dynamic facility layout problems so as to minimize the sum of the material handling costs and rearrangement costs. Unequal-area static and dynamic facility layout problems are NP-hard. Therefore, a modified particle swarm optimization was suggested to solve them where the departments have fixed shapes and areas throughout the time horizon. The modified particle swarm optimization was tested using the available problem instances chosen from the literature. The proposed algorithm applied two local search methods and the department swapping method to improve the quality of solutions and to prevent local optima for dynamic and static problems. It also utilized the period swapping method to improve the solutions for dynamic problems. The results showed that the proposed algorithm has created encouraging layouts in comparison with other approaches.

Genetic search for solving construction site-level unequal-area facility layout problems

Free AccessAboutSectionsView PDF ToolsAdd to favoritesDownload CitationsTrack CitationsPermissionsReprints ShareShare onFacebookTwitterLinked InEmail Go to SectionFree Access HomeOperations ResearchVol. 19, No. 1 Technical Note—A Further Note on One-Dimensional Space AllocationDonald M. SimmonsDonald M. SimmonsPublished Online:1 Feb 1971https://doi.org/10.1287/opre.19.1.249"Technical Note—A Further Note on One-Dimensional Space Allocation." Operations Research, 19(1), p. 249 Previous Back to Top Next FiguresReferencesRelatedInformationCited bySingle-row equidistant facility layout as a special case of single-row facility layout15 August 2013 | International Journal of Production Research, Vol. 52, No. 5A polyhedral approach to the single row facility layout problem21 March 2012 | Mathematical Programming, Vol. 141, No. 1-2A computational study and survey of methods for the single-row facility layout problem6 September 2012 | Computational Optimization and Applications, Vol. 55, No. 1Optimal solutions for the double row layout problem30 November 2011 | Optimization Letters, Vol. 7, No. 2A Hybrid Clonal Selection for the Single Row Facility Layout Problem with Unequal DimensionsiBusiness, Vol. 04, No. 03A new lower bound for the single row facility layout problemDiscrete Applied Mathematics, Vol. 157, No. 1An Exact Approach to the One-Dimensional Facility Layout ProblemAndré R. S. Amaral, 1 August 2008 | Operations Research, Vol. 56, No. 4Death Penalty Abolition and the Ratification of the Second Optional ProtocolSSRN Electronic JournalApplications of Set Covering, Set Packing and Set Partitioning Models: A SurveyA heuristic procedure for the single-row facility layout problemEuropean Journal of Operational Research, Vol. 87, No. 1Deux problèmes d'affectation non linéaires29 March 2011 | RAIRO - Operations Research, Vol. 16, No. 3The Layout of Divisible Activities on the Line9 July 2007 | A I I E Transactions, Vol. 10, No. 1On Solving A One-Dimensional Space Allocation Problem With Integer Programming25 May 2016 | INFOR: Information Systems and Operational Research, Vol. 14, No. 2A Minimax Layout Problem on the Line Involving Distances between Classes of Objects9 July 2007 | A I I E Transactions, Vol. 6, No. 3 Volume 19, Issue 1January-February 1971Pages 1-256 Article Information Metrics Information Published Online:February 01, 1971 © 1971 INFORMSCite asDonald M. Simmons, (1971) Technical Note—A Further Note on One-Dimensional Space Allocation. Operations Research 19(1):249-249. https://doi.org/10.1287/opre.19.1.249 PDF download

The facility layout design has been regarded as the key to improve plant productivity, which are relevant to both manufacturing and service sectors. Facility Layout Problems (FLPs) are known to be NP-hard problems; various optimization approaches for small problems and heuristic approaches for the larger problems have been proposed to elucidate the problem. A mathematical model is developed for the unequal size facility layout problem with fixed flow between departments. We are considering the orientations of the departments with various sizes and aims to minimize the distance traveled by people, material, and other supporting services in the safest and most effective manner. Some of the constraints considered in the modeling are the restricted areas, reserved departmentry locations, and also the irregularity of the shapes of manufacturing layout. This paper focuses on the mathematical model and the solution of the non-quadratic assignment problem (non-QAP) by hybridizing the meta-heuristic methods i.e. Genetic Algorithm (GA) and Simulated Annealing (SA). This work could be used in future as a reference for those researchers interested in tackling this challenging unequal facility layout problem.

The Facility Layout Problem (FLP) is a renowned and extensively researched problem that has attracted significant focus from various areas, including industry and manufacturing. One of the recent studies includes the examination of FLP issues in a large room. Analysing the layout of amenities and temperature controls in spacious areas like libraries is crucial for understanding how they affect people’s thermal comfort and energy consumption. The arrangement of facilities typically impacts the air distribution within a large room. Improper facility layout design might create indoor temperature disparities, with specific zones feeling excessively warm or chilly. Consequently, users are unevenly distributed due to each individual’s differing thermal comfort needs. Previous researchers have discussed this issue. However, after a detailed examination of previous studies, a few drawbacks have been identified in building mathematical models. These drawbacks include poorly organised mathematical modelling, ambiguous or disorganised data collection and analysis techniques, and the absence or ambiguity of variables and constraints. Therefore, this study proposed a structured mathematical approach to build a more efficient, inclusive, and reliable model. This study used a university library in Malaysia as a case study. A well-established and widely practised method for assessing mathematical modelling competency based on previous research has been adopted. Subsequently, the list of sub-competencies associated with the modelling process is utilised as a reference point for constructing a mathematical model in this research endeavour. As a result, the entire process of constructing a mathematical model is detailed, and recommendations for future enhancements are provided. This project is considered a significant advancement in the pursuit of conducting further FLP investigations in large rooms for the greater good in the future, which is part of the PhD research carried out at UUM.