چکیده مقاله
A new chromosome and related operators are presented for minimizing non productive time airtime of cutting tool in a laser or water jet cutting device Also to improve the quality of solutions the well known 2 opt heuristic has been utilized This problem can be formulated as a Generalized Traveling Salesman Problem GTSP which is a more complicated case of the well known Traveling Salesman Problem TSP In GTSP, points are divided into a number of groups or clusters and one is interested in finding the shortest closed path that passes through all clusters, given that only one point is selected from any one cluster The function of the proposed new chromosome and its operators are studied using a sample problem and the solutions are presented All solutions were obtained in less than 6 seconds and were optimal in most cases
کلیدواژهها
نویسندگان
H. Jafarzadeh
Faculty of Mechanical and Industrial Engineering, K N Toosi University of Technology, Tehran, Iran
R. Bashirzadeh
Faculty of Mechanical and Industrial Engineering, K N Toosi University of Technology, Tehran, Iran
H. Khandani
Faculty of Mechanical Engineering, University of Tabriz, Tabriz, Iran
شیوه ارجاع
Jafarzadeh, H. and Bashirzadeh, R. and Khandani, H.,1390,An Enhanced Genetic Algorithm for Tool-Path Optimization,12th Iranian Conference on Manufacturing Engineering (ICME 2010),Tehran
ارائهشده در
مجموعه مقالات دوازدهمین کنفرانس ملی مهندسی ساخت و تولید ایران6 دی 1390 · تهران