Artificial Bee Colony Algorithm with Proposed Discrete Nearest Neighborhood Algorithm for Discrete Optimization Problems
چکیده
Travelling salesman problem (TSP) is one the problems of NP-complete family, which means finding shortest complete close tour in graph. This study seeks to solve this using Artificial Bee Colony (ABC) Algorithm along with proposed Discrete Nearest Neighborhood (DNNA). DNNA finds path among points by starting from an arbitrary point. In next steps links will be a guide make tour. other words partial tours have higher chance final solution. order improve solutions single created tour, The employee bees’ movement radius has been limited, because avoidance long random jump between nodes. To reduce optimization time artificial bee colony algorithm, fixed-radius near neighbor 2-opt algorithm was used as well. addition, 2 types scout were for intensify probability property algorithm. Also, convergence function prevented increasing number route-creating tours. first applies and secondary improves bees probable way. Although Althought average error ABC 0.371% than best solution all methods, it could 3 3.305%. better basic tested 0.570%.