Optimal solution of multi-pass turning processes by means of the Differential Evolutionary Algorithm for constraint problem
Korlos, Apostolos/ Kosmanis, Theodoros/ Κοσμάνης, Θεόδωρος/ Κορλός, Απόστολος
|Institution and School/Department of submitter:||ΤΕΙ Θεσσαλονίκης|
|Citation:||Kosmanis, T.,Korlos,A. ([χ.χ.]). Optimal solution of multi-pass turning processes by means of the Differential Evolutionary Algorithm for constraint problem. Applied Mechanics and Materials 19. Διαθέσιμο σε: http://www.researchgate.net/publication/274075612_Optimal_solution_of_multi-pass_turning_processes_by_means_of_the_Differential_Evolutionary_Algorithm_for_constraint_problem (Ανακτήθηκε 9 Ιουλίου 2015)|
|Abstract:||The implementation of the Differential Evolutionary Algorithm for the solution of a multi-pass turning optimization problem is presented in this paper. The optimization of a multi-pass turning process is a highly demanding problem due to the number of constraints imposed. A specific variation of the Differential Evolutionary Algorithm appropriate for the treatment of constrained problems is used. It is based on the separation of candidate solutions into those that satisfy all constraints and those that do not and the simultaneous execution of two optimization algorithms. Numerical results from the minimization of the production cost of a popular multi-pass turning problem with six degrees of freedom, namely cutting speed, feed rate and depth of cut of rough machining and finishing, validate the methodology. The selected problem is characterized by a number of equally stepped roughing passes and a final finishing pass of the cutting tool in order to obtain the desired metal part removal from the initial workpiece|
|Description:||Δημοσιεύσεις μελών--ΣΤΕΦ--Τμήμα Οχημάτων,2015|
|Appears in Collections:||Δημοσιεύσεις σε Περιοδικά|
Files in This Item:
There are no files associated with this item.
Please use this identifier to cite or link to this item:This item is a favorite for 0 people.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.