A modified tabu search strategy for multiple-response grinding process optimisation. (14th January 2008)

• Record Type: Journal Article
• Authors: Mukherjee, Indrajit; Ray, Pradip Kumar
• Is Part Of: International journal of intelligent systems technologies and applications. Volume 4:Number 1/2(2008)
• Page Start: 97
• Page End: 122
• Publication Date: 2008-01-14
• Subjects: artificial neural networks -- ANN -- back propagation algorithms -- desirability function -- genetic algorithms -- GA -- Mahalanobis distance -- multiple-response grinding -- tabu search -- TS -- optimisation; Artificial intelligence -- Periodicals; Intelligent control systems -- Periodicals; 006.3
• Languages: English
• ISSNs: 1740-8865

Abstract

Multiple-response grinding process is usually too complex to optimise, requiring a large number of interacting process variables and responses. Experimentation techniques, such as factorial design, fractional factorial design and Response Surface Methodology (RSM) that may be used for this process are too difficult to implement for production lines involving grinding and other necessary operations. For grinding process involving continuous variable, non-linear and multiple-response optimisation problem, the potential of Tabu Search (TS) strategy needs to be explored either in its original form or its variant. In this paper, integrating Artificial Neural Network (ANN) and composite desirability function with a Modified Tabu Search (MTS) strategy, based on Mahalanobis multivariate distance approach to identify tabu move, with scatter search intensification scheme is proposed for the above-mentioned problem. Computational results show that MTS provides better consistency in terms of sample mean and standard deviation of composite desirability measures than that of real-coded GA.