An ant algorithm for optimization of hole-making operations

Authors:
Heidar Ghaiebi;Maghsud Solimanpur
Affiliations:
Department of Mechanical Engineering, Faculty of Engineering, Urmia University, Urmia, Iran;Department of Mechanical Engineering, Faculty of Engineering, Urmia University, Urmia, Iran
Venue:
Computers and Industrial Engineering
Year:
2007

Citing 4
Cited 5

Ant algorithms for discrete optimization

Artificial Life
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem

INFORMS Journal on Computing
An ant algorithm for the single row layout problem in flexible manufacturing systems

Computers and Operations Research
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Short communication: A modified ant optimization algorithm for path planning of UCAV

Applied Soft Computing
Comparison and application of four versions of particle swarm optimization algorithms in the sequence optimization

Expert Systems with Applications: An International Journal
Selection of wire electrical discharge machining process parameters using non-traditional optimization algorithms

Applied Soft Computing
Application of ant colony optimization algorithm in process planning optimization

Journal of Intelligent Manufacturing
Drilling Optimization via Particle Swarm Optimization

International Journal of Swarm Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the optimization of hole-making operations in conditions where a hole may need several tools to get completed. The objective of interest in the considered problem is to minimize the summation of tool airtime and tool switch time. This objective is affected by the sequence through which each operation of each hole is done. The problem is formulated as a 0-1 non-linear mathematical model. An ant algorithm is developed to solve the proposed mathematical model. The paper includes an illustrative example which shows the application of the proposed algorithm to optimizing the sequence of hole-making operations in a typical industrial part. The performance of the proposed algorithm is tested through solving six benchmark problems. The computational experience conducted in this research indicates that the proposed method is both effective and efficient.