Results 1  10
of
15
A Genetic Approach to the Quadratic Assignment Problem
, 1992
"... The Quadratic Assignment Problem (QAP) is a wellknown combinatorial optimization problem with a wide variety of practical applications. Although many heuristics and semienumerative procedures for QAP have been proposed, no dominant algorithm has emerged. In this paper, we describe a Genetic Algori ..."
Abstract

Cited by 70 (7 self)
 Add to MetaCart
The Quadratic Assignment Problem (QAP) is a wellknown combinatorial optimization problem with a wide variety of practical applications. Although many heuristics and semienumerative procedures for QAP have been proposed, no dominant algorithm has emerged. In this paper, we describe a Genetic Algorithm (GA) approach to QAP. Genetic algorithms are a class of randomized parallel search heuristics which emulate biological natural selection on a population of feasible solutions. We present computational results which show that this GA approach finds solutions competitive with those of the best previouslyknown heuristics, and argue that genetic algorithms provide a particularly robust method for QAP and its more complex extensions.
A Genetic Algorithm For Facility Layout Design In Flexible Manufacturing Systems
, 1996
"... The flexible manufacturing system (FMS) facility layout problem (FLP) involves the positioning of cells within a given area so as to minimize the material flow costs between cells. The FLP design includes specifying the spatial coordinates of each cell, the orientation of each cell in either a horiz ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
The flexible manufacturing system (FMS) facility layout problem (FLP) involves the positioning of cells within a given area so as to minimize the material flow costs between cells. The FLP design includes specifying the spatial coordinates of each cell, the orientation of each cell in either a horizontal or vertical position, and the position of each cell's pickup anddropoff points. The layout design problem is both tactically and strategically important since the layout plays a large role in determining the efficiency and flexibility of the system. The FMS layout problem differs from traditional layout problems in that there are additional constraints on a cell's shape and orientation and the location of the pickup/dropoff points must be determined. A mixed integer programming formulation for the FLP developed byDas (1993) is adapted and heuristically solved in this paper. Because of the NPhard nature of the solution space, a genetic algorithm based decomposition strategy is proposed and computationally tested. A comparison of the computational results with the existing methods indicate that the heuristic is a viable alternative for efficiently and effectively generating layout designs for flexible manufacturing systems.
Computing globally optimal solutions for singlerow layout problems using semidefinite programming and cutting planes
 INFORMS J. COMPUT
, 2008
"... This paper is concerned with the singlerow facility layout problem (SRFLP). A globally optimal solution to the SRFLP is a linear placement of rectangular facilities with varying lengths that achieves the minimum total cost associated with the (known or projected) interactions between them. We demon ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
This paper is concerned with the singlerow facility layout problem (SRFLP). A globally optimal solution to the SRFLP is a linear placement of rectangular facilities with varying lengths that achieves the minimum total cost associated with the (known or projected) interactions between them. We demonstrate that the combination of a semidefinite programming relaxation with cutting planes is able to compute globally optimal layouts for large SRFLPs with up to thirty departments. In particular, we report the globally optimal solutions for two sets of SRFLPs previously studied in the literature, some of which have remained unsolved since 1988.
Comparison of Selection Methods for Evolutionary Optimization
 Evolutionary Optimization
, 2000
"... . Selection is an essential component of evolutionary algorithms, playing an important role especially in solving hard optimization problems. Most previous studies on selection have focused on more or less ideal properties based on asymptotic analysis. In this paper, we address the selection problem ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
. Selection is an essential component of evolutionary algorithms, playing an important role especially in solving hard optimization problems. Most previous studies on selection have focused on more or less ideal properties based on asymptotic analysis. In this paper, we address the selection problem from a more practical point of view by considering solution quality achievable within acceptable time. The repertoire of methods we compare includes proportional selection, ranking selection, linear ranking, tournament, Genitor selection, simulated annealing, and hillclimbing. All these methods use genetic operators in one form or another to create new search points. Experiments are performed in the context of the machine layout design problem. This problem is a real industrial application having both continuous and discrete optimization characteristics. The experimental results for solving tworow machine layout problems of size ranging from 10 to 50 show strong evidence that ranking and tournament selection are, in general, more effective in both solution quality and convergence time than proportional selection and other methods. We provide a theoretical explanation of the experimental results using a predictive model of evolutionary optimization based on selection differential and response to selection. Keywords: Evolutionary optimization, machine layout design, selection methods, selection differential, response to selection, heritability 1.
Provably NearOptimal Solutions for Very Large SingleRow Facility Layout Problems
, 2009
"... The facility layout problem is a global optimization problem that seeks to arrange a given number of rectangular facilities so as to minimize the total cost associated with the (known or projected) interactions between them. This paper is concerned with the singlerow facility layout problem (SRFLP) ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
The facility layout problem is a global optimization problem that seeks to arrange a given number of rectangular facilities so as to minimize the total cost associated with the (known or projected) interactions between them. This paper is concerned with the singlerow facility layout problem (SRFLP), the onedimensional version of facility layout that is also known as the onedimensional space allocation problem. It was recently shown that the combination of a semidefinite programming (SDP) relaxation with cutting planes is able to compute globally optimal layouts for SRFLPs with up to 30 facilities. This paper further explores the application of SDP to this problem. First, we revisit the recently proposed quadratic formulation of this problem that underlies the SDP relaxation and provide an independent proof that the feasible set of the formulation is a precise representation of the set of all permutations on n objects. This fact follows from earlier work of Murata et al., but a proof in terms of the variables and structure of the SDP construction provides interesting insights on our approach. Second, we propose a new matrixbased formulation that yields a new SDP relaxation with fewer linear constraints but still yielding highquality global lower bounds. Using this new relaxation, we are able to compute nearlyoptimal solutions for instances with up to 100 facilities.
A Polyhedral Approach to the Single Row Facility Layout Problem
, 2011
"... The Single Row Facility Layout Problem (SRFLP) is the ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
The Single Row Facility Layout Problem (SRFLP) is the
A Polyhedral Study of Triplet Formulation for Single Row Facility Layout Problem
"... The Single Row Facility Layout Problem (SRFLP) is the problem of arranging n departments with given lengths on a straight line so as to minimize the total weighted distance between all department pairs. We present a polyhedral study of the triplet formulation of the SRFLP introduced by Amaral [Discr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The Single Row Facility Layout Problem (SRFLP) is the problem of arranging n departments with given lengths on a straight line so as to minimize the total weighted distance between all department pairs. We present a polyhedral study of the triplet formulation of the SRFLP introduced by Amaral [Discrete Applied Mathematics 157(1)(2009)183190]. For any number of departments n, we prove that the dimension of the triplet polytope is n(n−1)(n−2)/3 (this is also true for the projections of this polytope presented by Amaral). We then prove that several valid inequalities presented by Amaral for this polytope are facetdefining. These results provide theoretical support for the fact that the linear program solved over these valid inequalities gives the optimal solution for all instances studied by Amaral.
NorthHolland A distance assignment approach to the facility layout problem
, 1990
"... Abstract: The facility layout problem has generally been formulated as a quadratic assignment problem, where the interacting facilities are assigned to the various ites. In this paper a different approach, based on assigning distances between pairs of sites to pairs of facilities, is taken. A networ ..."
Abstract
 Add to MetaCart
Abstract: The facility layout problem has generally been formulated as a quadratic assignment problem, where the interacting facilities are assigned to the various ites. 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 developed. The first phase involves preprocessing of the distance matrix. The second phase involves solving the (generalized assignment) network problem. The third phase employs a heuristic procedure which transforms the solution of the second phase into a feasible assignment of facilities to sites. Finally, computational experience with the new algorithm is provided.
Solving Facility Layout Problem: Threelevel Tabu Search Metaheuristic Approach
"... Abstract — 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 ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract — 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 benchmark instances taken from published literature. Also, a comparative analysis of ITS with other metaheuristic approach is presented. It is found that ITS based approach provide comparative results. I.
Publication No. ______
"... I would like to express my deepest gratitude to my advising professor, Dr. K.J. Rogers, for her guidance and help during my PhD endeavor. Dr. Rogers does not only supervise me in research but also sets a high standard of professorship for me to follow. Thank you very much for everything, Dr. Rogers. ..."
Abstract
 Add to MetaCart
I would like to express my deepest gratitude to my advising professor, Dr. K.J. Rogers, for her guidance and help during my PhD endeavor. Dr. Rogers does not only supervise me in research but also sets a high standard of professorship for me to follow. Thank you very much for everything, Dr. Rogers. I would also like to thank my PhD committee members—Dr. Bonnie Boardman, Dr. John Priest, and Dr. Lynn Peterson—for their invaluable times and comments to make this dissertation possible. Special thanks go to Ms. Christie Murphy, Ms. Kimetha Williams and Ms. Julie Estill for their administrative help. Additionally, I would like to acknowledge my fellow PhD students for those fun brainstorming sessions we had. Most of all, I wish to express my appreciation to my family, especially my parents, Fomay FengMing Chen and ShuMei Chen, for their love and support — you raise me up... to more than I can be.