Please use this identifier to cite or link to this item:
|Title:||A tabu search-based optimization approach for process planning||Authors:||Li, W.D.
|Issue Date:||2003||Citation:||Li, W.D.,Ong, S.K.,Lu, Y.Q.,Nee, A.Y.C. (2003). A tabu search-based optimization approach for process planning. Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) 2774 PART 2 : 1000-1007. ScholarBank@NUS Repository.||Abstract:||In this paper, crucial processes in a computer-aided process planning system, such as selecting machining resources, determining set-up plans and sequencing operations of a part, have been considered simultaneously and modelled as a constraint-based optimization problem, and a Tabu search-based approach has been proposed to solve it effectively. In the optimization model, costs of the utilized machines and cutting tools, machine changes, tool changes, set-ups and departure of good manufacturing practices (penalty function) are integrated as an optimization evaluation criterion. A case study, which is used to compare this approach with the genetic algorithm and simulated annealing approaches, is discussed to highlight the advantages of this approach in terms of solution quality, computation efficiency and the robustness of the algorithm.||Source Title:||Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)||URI:||http://scholarbank.nus.edu.sg/handle/10635/73110||ISSN:||03029743|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 4, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.