Showing 1 - 1 of 1
<title>Abstract</title> A traveling salesman problem (TSP) is an NP-hard optimization problem. So it is necessary to use intelligent and heuristic methods to solve such a hard problem in a less computational time. This paper proposes a novel hybrid approach, which is a data mining (DM) based on multi-objective...
Persistent link: https://www.econbiz.de/10010971512