文档介绍：European Journal of Operational Research 157 (2004) 592–606
ate/dsw
Discrete Optimization
Ant colony optimization algorithm to the inter-cell
layout problem in cellular manufacturing
M. Solimanpur a, P. Vrat b, R. Shankar c,*
a Department of Mechanical Engineering, Indian Institute of Technology, Hauz Khas, New Delhi 110 016, India
b Indian Institute of Technology, Roorkee 247 667, Uttaranchal, India
c Department of Management Studies, Indian Institute of Technology, Hauz Khas, New Delhi 110 016, India
Received 10 July 2002; accepted 14 October 2002
Available online 27 August 2003
Abstract
The inter-cell layout problem is discussed and a mathematical formulation for material flow between the cells is
presented. The problem is modeled as a quadratic assignment problem (QAP). An ant algorithm is developed to solve
the formulated problem. The performance of the proposed ant algorithm pared to the facility layout algorithms
such as H63, HC63-66, CRAFT and Bubble Search as well as other existing ant colony implementations for QAP such
as FANT, HAS-QAP, MMAS-QAP2–opt, and ANTS algorithms. The experimental results show that the proposed ant
algorithm performs significantly better than the facility layout algorithms. Also, our experimental results reveal that the
proposed ant algorithm is effective and efficient pared to other existing ant algorithms.
Ó 2003 Elsevier . All rights reserved.
Keywords: Facilities planning and design; Cellular manufacturing; Inter-cell layout problem; Quadratic assignment problem; Ant
algorithms
1. Introduction advantages of CM have been reported in the lit-
erature as reduction in setup time, reduction in
Cellular manufacturing (CM) is a production throughput time, reduction in work-in-process in-
system in which similar parts are classified into ventories, reduction in material handling costs,
part families (PFs) and dissimilar machines are better quality and production control, increment
assigned into mac