Study on Free Search for Combinatorial Optimization Problem
2013 ◽
Vol 411-414
◽
pp. 1904-1910
Keyword(s):
An algorithm based on free search is proposed for the combinatorial optimization problems. In this algorithm, a feasible solution is converted into a full permutation of all the elements and a transformation of one solution into another solution can be interpreted the transformation of one permutation into another permutation. Then, the algorithm is combined with intersection elimination. The discrete free search algorithm greatly improves the convergence rate of the search process and enhances the quality of the results. The experiment results on TSP standard data show that the performance of the proposed algorithm is increased by about 2.7% than that of the genetic algorithm.
2021 ◽
2021 ◽
Vol 10
(9)
◽
pp. 125-131
2000 ◽
Vol 8
(3)
◽
pp. 291-309
◽