Application of heuristic and hybrid-GASA algorithms to tool-path optimization problem for minimizing airtime during machining

Authors:
Cuneyt Oysu;Zafer Bingul
Affiliations:
Department of Mechatronics Engineering, University of Kocaeli, Umuttepe Campus, 41380 Kocaeli, Turkey;Department of Mechatronics Engineering, University of Kocaeli, Umuttepe Campus, 41380 Kocaeli, Turkey
Venue:
Engineering Applications of Artificial Intelligence
Year:
2009

Citing 4
Cited 3

Convergence of an annealing algorithm

Mathematical Programming: Series A and B
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints

Computational Optimization and Applications
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem

Computers and Industrial Engineering

Polygon subdivision for pocket machining process planning

Computers and Industrial Engineering
Hybrid PSO and GA for neural network evolutionary in monthly rainfall forecasting

ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part I
Scheduling a single vehicle in the just-in-time part supply for a mixed-model assembly line

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, heuristic algorithms such as simulated annealing (SA), genetic algorithm (GA) and hybrid algorithm (hybrid-GASA) were applied to tool-path optimization problem for minimizing airtime during machining. Many forms of SA rely on random starting points that often give poor solutions. The problem of how to efficiently provide good initial estimates of solution sets automatically is still an ongoing research topic. This paper proposes a hybrid approach in which GA provides a good initial solution for SA runs. These three algorithms were tested on three-axis-cartesian robot during milling of wood materials. Their performances were compared based on minimum path and consequently minimum airtime. In order to make a comparison between these algorithms, two cases among the several milling operations were given here. According to results obtained from these examples, hybrid algorithm gives better results than other heuristic algorithms alone. Due to combined global search feature of GA and local search feature of SA, hybrid approach using GA and SA produces about 1.5% better minimum path solutions than standard GA and 47% better minimum path solutions than standard SA.