A Kind of New Algorithm to Solve the Multi-Objective Traveling Salesman

Liu Shui-qiang, Jianhua Zhou, Lei Jun-cheng · International Review on Computers and Software (IRECOS) · 2013

A kind of new approximate algorithms by “attractor” is designed to solve the multi-objective traveling salesman problem, which can improve algorithm principle analysis. The main idea of this paper is trying to illustrates a kind of new approximate algorithm’s thought about its application to deal with some objective problem through analysis to cite example.

Read the paper · More papers on PaperTik