An ant algorithm for the single row layout problem in flexible manufacturing systems

Authors:
M. Solimanpur;Prem Vrat;Ravi Shankar
Affiliations:
Mechanical Engineering Group, Faculty of Engineering, Urmia University, Urmia, Iran;Indian Institute of Technology Roorkee, Roorkee 247 667, Uttaranchal, India;Department of Management Studies, Indian Institute of Technology Delhi, Hauz Khas, New Delhi 110 016, India
Venue:
Computers and Operations Research
Year:
2005

Citing 11
Cited 15

A heuristic procedure for the layout of a large number of facilities

Management Science
Machine layout problem in flexible manufacturing systems

Operations Research
ACO algorithms for the quadratic assignment problem

New ideas in optimization
MAX-MIN Ant system

Future Generation Computer Systems
Intelligent Design and Manufacturing

Intelligent Design and Manufacturing
The Ant System Applied to the Quadratic Assignment Problem

IEEE Transactions on Knowledge and Data Engineering
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem

INFORMS Journal on Computing
Adaptive memories for the Quadratic Assignment Problems

Adaptive memories for the Quadratic Assignment Problems
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Optimal facility layout design11This study was supported in part by an Auburn College of Engineering infrastructure award made to Drs. Meller and Vance, and NSF CAREER Grants DMII 9623605 and DMII 9502502.

Operations Research Letters

A Comprehensive Overview of the Applications of Artificial Life

Artificial Life
An ant algorithm for optimization of hole-making operations

Computers and Industrial Engineering
Optimal solution for the two-dimensional facility layout problem using a branch-and-bound algorithm

Computers and Industrial Engineering
Investigation of Ant System parameter interactions by using design of experiments for job-shop scheduling problems

Computers and Industrial Engineering
A particle swarm optimization for the single row facility layout problem

Computers and Industrial Engineering
Note: A polyhedral study of triplet formulation for single row facility layout problem

Discrete Applied Mathematics
Solving facilities location problem in the presence of alternative processing routes using a genetic algorithm

Computers and Industrial Engineering
Graph-based ant system for optimal sizing of standalone hybrid wind/PV power systems

ICIC'06 Proceedings of the 2006 international conference on Intelligent computing: Part II
A new approach for workshop design

Journal of Intelligent Manufacturing
A genetic algorithm with the heuristic procedure to solve the multi-line layout problem

Computers and Industrial Engineering
Insertion based Lin-Kernighan heuristic for single row facility layout

Computers and Operations Research
Review: a comprehensive overview of the applications of artificial life

Artificial Life
Hybrid Estimation of Distribution Algorithm for solving Single Row Facility Layout Problem

Computers and Industrial Engineering
A parallel ordering problem in facilities layout

Computers and Operations Research
A scatter search algorithm for the single row facility layout problem

Journal of Heuristics

Quantified Score

Hi-index	0.01

Visualization

Abstract

Single row machine layout problem is one of the most commonly used layout patterns, especially in flexible manufacturing systems. In this paper, this problem is formulated as a non-linear 0-1 programming model in which the distance between the machines is sequence dependent. An ant algorithm has been developed to solve this problem. A technique is proposed to efficiently implement the proposed algorithm. The performance of the proposed heuristic is tested over a number of problems selected from the literature. Computational results indicate that the proposed approach is more effective compared to many existing algorithms in this area.