Polytechnic and design, Vol. 4 No. 3, 2016.
Original scientific paper
https://doi.org/10.19279/TVZ.PD.2016-4-3-12
MANIPULATOR ROUTING OPTIMIZATION USING GENETIC ALGORITHM
Hrvoje Rakić
orcid.org/0000-0003-3380-3961
; Zagreb University of Applied Sciences, Zagreb, Croatia
Tomislav Brajković
; Kel d.o.o., Kloštar Ivanić, Croatia
Slobodan Obrenović
; Inovatus d.o.o, Zagreb, Croatia
Abstract
The 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.
Keywords
Optimization; genetic algorithm; traveling salesman problem
Hrčak ID:
191593
URI
Publication date:
15.12.2016.
Visits: 1.115 *