Please use this identifier to cite or link to this item:
Title: Layout Optimization in a Fitness Industry: An Application of QAP Formulation and Heuristic Approaches
Authors: Eligüzel, İ.M.
Özceylan, E.
Atasagun, Y.
Keywords: 2-opt
Fitness Center
Integer Programming
Layout Optimization
Quadratic Assignment Problem
Tabu Search
Issue Date: 2021
Publisher: Science Publications
Abstract: The Quadratic Assignment Problem (QAP) is the problem of determining a one-to-one and onto assignment between two sets, each consisting of n objects (e.g., n facilities and n locations) so as to minimize the sum of the distance x flow associated with pairs of assignments. In this study, QAP formulation is applied to a fitness center to assign the sports equipment to the related locations on the layout. Facilities are considered as sports equipment and locations are considered the required area for equipment on the layout. A case study with 19 sports equipment is considered. The objective of the study is to allocate the equipment to the 19 available locations to minimize the total walking distance while considering the interactions between sports equipment. An Integer Programming (IP) formulation is applied using GUROBI package program. 2-opt and tabu search algorithms are also applied to find the feasible/optimal solutions in a reasonable time. The results show that the heuristic approaches are more effective than IP in terms of computational time. The optimal result which is obtained by IP, 2-opt and tabu search provides a better layout with 55.47% less distance x flow compared to the current layout. © 2021 İbrahim Miraç Eligüzel, Eren Özceylan and Yakup Atasagun. All Rights Reserved.
ISSN: 1549-3636
Appears in Collections:Mühendislik ve Doğa Bilimleri Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections

Files in This Item:
File SizeFormat 
jcssp.2021.440.450.pdf616.17 kBAdobe PDFView/Open
Show full item record

CORE Recommender

Page view(s)

checked on Jun 5, 2023


checked on Jun 5, 2023

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.