Solving the design of distributed layout problem using forecast windows: A hybrid algorithm approach

Authors:
Sai Srinivas Nageshwaraniyer;Nitesh Khilwani;M. K. Tiwari;Ravi Shankar;David Ben-Arieh
Affiliations:
Department of Systems and Industrial Engineering, The University of Arizona, Tucson, USA;Mechanical and Manufacturing Engineering, Loughborough University, Loughborough, LE11 3TU, UK;Department of Industrial Engineering and Management, Indian Institute of Technology Kharagpur, Kharagpur, India;Department of Management Studies, Indian Institute of Technology Delhi, Hauz Khas, New Delhi 110 016, India;Department of Industrial and Manufacturing Systems Engineering, Durland Hall, Manhattan, KS 66506-5101, USA
Venue:
Robotics and Computer-Integrated Manufacturing
Year:
2013

Citing 7
Cited 0

The dynamics of plant layout

Management Science
A simulated annealing algorithm for dynamic layout problem

Computers and Operations Research
A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling

Computers and Operations Research
Simulated annealing heuristics for the dynamic facility layout problem

Computers and Operations Research
Hybrid ant systems for the dynamic facility layout problem

Computers and Operations Research
Learning and optimization using the clonal selection principle

IEEE Transactions on Evolutionary Computation
Solving Part-Type Selection and Operation Allocation Problems in an FMS: An Approach Using Constraints-Based Fast Simulated Annealing Algorithm

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

Abstract

In today's competitive environment, manufacturing facilities have to be more responsive to the frequent changes in product mix and demand by realigning their organizational structure for minimizing material handling cost. However, manufacturing firms are reluctant to modify the layout as it leads to operation disruption and excess rearrangement cost. In this paper, we present an alternative approach for designing a multi-period layout (i.e., distributed layout) that maintains a tradeoff between re-layout cost and cost of excess material handling. Obtaining an optimal solution to distributed layout problem is generally a difficult task, owing to larger size of quadratic assignment problem. In order to overcome the aforementioned drawback, a meta-heuristic, named 'CSO-DLP' (Clonal Symbiotic Operated-Distributed Layout Planning) is developed for designing a distributed layout that jointly determines the arrangement of department and flow allocation among them. It inherits its trait from Symbiotic algorithm and Clonal algorithm. In addition to these; the concept of 'forecast window' is used, which evaluates the layout for varying number of periods at a given time. The proposed meta-heuristic is applied on a benchmark dataset and the effect of system parameters, such as rearrangement cost, department disintegration, and duplication are investigated and benchmarked in this paper.