MANIPULATOR ROUTING OPTIMIZATION USING GENETIC ALGORITHM

Problem trgovačkog putnika jedan je od najpoznatijih problema kombinatorne optimizacije. Spada u skupinu NP-potpunih problema i za veći broj gradova nerješiv je egzaktnim metodama u razumnom vremenu. U ovom radu putanja manipulatora optimizirana je pomoću genetskog algoritma. Istraživanja su pokazala da predloženi genetski algoritam pronalazi kraću rutu u realnom vremenu u usporedbi s postojećim modelom odabira putanje manipulatora. Također, istraživanja su pokazala da bi ovakav genetski algoritam trebalo upariti s tehnikama lokalnog pretraživanja prostora za postizanje konzistentno dobrih rješenjaThe traveling salesman problem is one of the most famous combinatorial optimization problems. It’s categorized as one of the NP-complete problems and for the growing number of cities is unsolvable with the use of exact methods in a reasonable time. In this paper manipulator path has been optimized using a genetic algorithm. Studies have shown that the proposed genetic algorithm can find a shorter route in real-time, compared with the existing manipulator model of path selection. Also, studies have shown that the genetic algorithm should be paired with the local search techniques in order to be able to consistently achieve good solutions