A Heuristic for Solving Quadratic Assignment Formulations in Plant Layout
نویسنده
چکیده
Eswar Sivaraman School of Industrial Engineering and Management Oklahoma State University, Stillwater, OK ABSTRACT This report details a new heuristic algorithm for solving quadratic assignment problems that arise in plant layout and relative location of activities/facilities. Programmed implementations of the algorithm solve very large problems in a negligible amount of time, results for which are presented. The quality of the solutions derived by the proposed heuristic are compared and contrasted with available examples in the literature, and the solution quality commented upon.
منابع مشابه
Applying Genetic Algorithm to Dynamic Layout Problem
In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in the product mix and demand.[1] Layout design has a significant impact on manufacturing efficiency. Initially, it was treated as a static decision but due to improvements in technology, it is possible to rearrange the manufacturing facilities in different scenarios. The Plant layout...
متن کاملEffective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملOffering a New Algorithm to Improve the Answer-Search Algorithm in Quadratic Assignment Problem
Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...
متن کاملSolving Facility Layout Problem: Three-level Tabu Search Metaheuristic Approach
In this paper an improved tabu search (ITS) based approach is proposed for solving facility layout problem (FLP) which is formulated as quadratic assignment problem (QAP). ITS is an improved version of conventional tabu search technique which incorporates three levels viz. intensification, reconstruction, and solution acceptance. To evaluate the efficacy of the proposed ITS, it is tested for be...
متن کاملA distance assignment approach to the facility layout problem
The facility layout problem has generally been formulated as a quadratic assignment problem, where the interacting facilities are assigned to the various sites. In this paper a different approach, based on assigning distances between pairs of sites to pairs of facilities, is taken. A network formulation and analysis of this problem is provided. An algorithm, composed of three phases, is develop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002