Selection of algorithms to solve traveling salesman problems using meta-learning1

Jorge Yoshio Kanda, André C. P. L. F. de Carvalho, Eduardo R. Hruschka, Carlos Soares · International Journal of Hybrid Intelligent Systems · 2011

Many real-world problems, like microchip design, can be modeled by means of the well-known traveling salesman problem (TSP). Many instances of this problem can be found in the literature. Although several optimization algorithms have been applied to

Read the paper · More papers on PaperTik