A Tabu Search for Multi-Objective Single Row Facility Layout Problem

Lenin, N. C.; Kumar, M. Siva; Ravindran, D.; Islam, Mohammad Nazrul

doi:10.1142/s0219686714500024

Cited by 17 publications

(3 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Lenin vd. [43] bir önceki çalışmalarındaki probleme ek olarak toplam malzeme elleçleme maliyetini minimize etmeyi de ekleyerek tabu arama algoritmasıyla çözüm aramışlardır. Son olarak, Lenin ve Siva Kumar [44] geri hareketlere de izin veren çok ürünlü çok sıralı tesis düzenleme problemini ele almışlardır.…”

Section: Li̇teratür Araştirmasi (Literature Review)unclassified

Çok ürünlü özdeş makineli iki sıralı tesis düzenleme problemi için matematiksel model önerileri

Durmaz

Şahin

2022

Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi

View full text Add to dashboard Cite

 Double row facility layout problem  New mathematical model proposals for the multi-product production environment  Use of identical machines in the production environment Figure A. Double row facility layout problemPurpose: In this study, double row facility layout problem (DRFLP), which is a frequently used layout type in flexible manufacturing systems, is discussed. It is aimed to model and solve the DRFLP that takes into account the processing routes of products and the use of identical machines in a multi-product production environment. Theory and Methods:Firstly, a mixed-integer mathematical model that allows only forward movement of products was proposed for DRFLP in a multi-product production environment with different processing routes. Secondly, the problem was expanded with identical machines capable of performing the same operation. With the proposed model, the products choose the alternative route that will enable them to move a shorter distance during their forward movement. Results:Randomly generated test problems were used to evaluate the proposed mathematical models and solved using GUROBI 8.1 solver with MATLAB R2018b. Optimal solutions were obtained for instances up to the size of 8 products and 25 machines in the first problem. For the second problem with identical machines, instances up to the size of 3 products, 20 machines, and 2 identical machine groups were solved optimally. The optimality gaps reached within a time limit were reported for larger problems. Conclusion:This study discusses the effect of multiple processing routes and using identical machines on the arrangement of machines in DRFLP. It can be said that adding identical machines to the problem increases the complexity of the model. On the other hand, the large number of identical machines provides route flexibility in a multiproduct environment with multiple flow-lines. However, a trade-off arises due to the high initial investment costs of the machines.

show abstract

Section: Li̇teratür Araştirmasi (Literature Review)unclassified

Çok ürünlü özdeş makineli iki sıralı tesis düzenleme problemi için matematiksel model önerileri

Durmaz

Şahin

2022

Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi

View full text Add to dashboard Cite

show abstract

“…Kothari and Ghosh [14] presented a genetic algorithm (GA) to solve the singlerow FLP where all the individuals in a generation are subjected periodically to local search to improve their fitness. Lenin et al [18] used a tabu search for multi-objective single-row FLP to find the linear machine sequence while minimizing the total investment cost of machines, the total material handling cost, the total number of machines in the final sequence, and the total flow distance of the products in units. Shivhare and Bansal [27] used a particle swarm optimization (PSO) algorithm to address the bidirectional loop FLP in a flexible manufacturing system with the objective to minimize the distance traveled by automated guided vehicles and the number of backtracking.…”

Section: Literature Reviewmentioning

confidence: 99%

A Multi-Agents System for Solving Facility Layout Problem: Application to Operating Theater

Chraibi

Kharraja

Osman

et al. 2019

Journal of Intelligent Systems

View full text Add to dashboard Cite

Facility layout problem (FLP) has a great impact on the efficiency of any organization. It is concerned with defining the optimal location for each facility in order to optimize the supply chain productivity. In this kind of problems, the choice of resolution approach depends on the complexity and the size of the problem. Operating theaters are generally big structures containing a lot of facilities, which makes the conception of their layout a complex problem. In the literature, exact methods are powerless when faced with problem sizes up to 18 facilities. This leads us to explore other approaches, looking for efficient solutions. This paper presents a novel approach using a multi-agents system where agents’ skills are exploited to cover a wide research space, to accelerate the decision-making process and to deal with real-life problem sizes. This decision-making tool is based on several mixed integer linear programming models for solving the FLP, and considers two types of environments with deterministic and variant patient demand. Several experiments have been performed to demonstrate the effectiveness of our approach, and several problem instances with >80 facilities have been solved in reasonable time.

show abstract

“…The Tabu-search algorithm was used to solve single row facility layout [13] problems and find the linear sequence in order to minimize the total material handling cost. The algorithm found a common linear machine layout for more than one product [14]. The selecting routing heuristics performance and efficiency were affected by the layout and the number of locations, especially in inventory material handling of the size requested, and batching methods affected by route length.…”

Section: Introductionmentioning

confidence: 99%

Minimize the Route Length Using Heuristic Method Aided with Simulated Annealing to Reinforce Lean Management Sustainability

Abed

Elattar

2020

Processes

View full text Add to dashboard Cite

Cost reduction is a cornerstone of the Lean administration’s sustainability through modify its algorithms scheme to become multi-useful. This paper focuses on control “movement” waste, to minimize pipeline, cabling and sewerage network deployments time, to avoid demurrages (i.e., constructor sectors) and quickens planning through two stages. The first belongs to the build constrained hybridization of published heuristic routing methods (e.g., S-Shape, Mid-point, Largest-Gap, Return, Ascending, FLA-5, FLA-6 [Flow Line Analysis], and Composite) to select the shortest path that serves many locations (i.e., Plan-A), while allowing for the modification of these locations during service (i.e., Plan-B). The new locations are grouped into two clusters, the first of which lay on the shortest preferred path, while the second cluster contains locations that do not lay on the preferred path and are therefore moved on the backlogs-list, then use Simulated Annealing when to serve them. Finally, the impact of the selected performance is investigated after studying its correlation with another published effective one under cost considerations. The computational results of proposed Minimize-Route-Length aided with simulated annealing (MRL-SA) significantly outperform others in terms of the performance of the routing heuristics and total costs and develop the Last Planner System, which has a good reputation in construction projects and approve the proposed algorithm to maintain its competitiveness sustainability.

show abstract

A Tabu Search for Multi-Objective Single Row Facility Layout Problem

Cited by 17 publications

References 28 publications

Çok ürünlü özdeş makineli iki sıralı tesis düzenleme problemi için matematiksel model önerileri

Çok ürünlü özdeş makineli iki sıralı tesis düzenleme problemi için matematiksel model önerileri

A Multi-Agents System for Solving Facility Layout Problem: Application to Operating Theater

Minimize the Route Length Using Heuristic Method Aided with Simulated Annealing to Reinforce Lean Management Sustainability

Contact Info

Product

Resources

About