scispace - formally typeset
Journal ArticleDOI

MIP model and elitist strategy hybrid GA–SA algorithm for layout design

TLDR
The results indicate that proposed integrated methodology with developed mixed integer programming based mathematical model along with ESHGA could generate realistic layouts compared to reported result.
Abstract
It is most important for any manufacturing industry to have an efficient layout for their production environment to participate in global competition. One of the prime objectives of such an organisation is to decide an optimal arrangement of their facilities (machines or departments) in a two-dimensional planar region satisfying desired objectives, which is termed facility layout problem. To overcome the drawbacks of traditional layout design methodology, it is attempted to solve three important layout design problems such as inter-cell layout design, determination of optimum location for input/output stations and flow path layout design of material handling system simultaneously in an integrated manner. The quality of the final layout is evaluated by minimizing the total material handling cost, where the perimeter distance metric is used for the distance measurement. Sequence-pair, an elegant representation technique is used for layout encoding. The translation from sequence-pair to layout is efficiently done by longest common subsequence computation methodology. Due to the non-polynomial hard nature of the problem considered, an elitist strategy based hybrid genetic algorithm that uses simulated annealing as local search mechanism (ESHGA) is developed and tested with test problem instances available in the literature. The results indicate that proposed integrated methodology with developed mixed integer programming based mathematical model along with ESHGA could generate realistic layouts compared to reported result.

read more

Citations
More filters
Journal ArticleDOI

Classification of facility layout problems: a review study

TL;DR: In this article, a review of the literature on facility layout problem is made by referring to numerous papers about FLP, mainly motivated by the current and prospective trends of research on such points as layout evolution, workshop characteristics, problem formulation, and solution methodologies.
Journal ArticleDOI

Facility layout planning. An extended literature review

TL;DR: A scientific literature review about FLP from the operations management perspective is offered, stressing that the generation of layout alternatives was done mainly using mathematical optimisation models, specifically discrete quadratic programming models for similar sized departments, or continuous linear and non-linear mixed integer programming model for different sized departments.
Journal ArticleDOI

Elitism and Distance Strategy for Selection of Evolutionary Algorithms

TL;DR: Experimental results show that adding elitism and distance strategy in all generations can significantly improve solutions of the genetic algorithm for the traveling salesman problem and calling the strategy based on the proposed adaptive scheme can statistically improve solution of CoBiDE, a state-of-the-art differential evolution algorithm.
Journal ArticleDOI

Layout design problems with heterogeneous area constraints

TL;DR: One of the FLP models that minimize the material handling cost between rectangular departments is dealt with, and it is shown that the proposed model properly generates layout design for these two types of departments.
References
More filters
Journal ArticleDOI

Optimization by Simulated Annealing

TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Book

Adaptation in natural and artificial systems

TL;DR: Names of founding work in the area of Adaptation and modiication, which aims to mimic biological optimization, and some (Non-GA) branches of AI.
Book

Introduction to Algorithms

TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Related Papers (5)