Developing a hybrid data mining approach based on multi-objective particle swarm optimization for solving a traveling salesman problem
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 particle sw...
Main Authors: | Abdorrahman Haeri, Reza Tavakkoli-Moghaddam |
---|---|
Format: | Article |
Language: | English |
Published: |
Vilnius Gediminas Technical University
2012-10-01
|
Series: | Journal of Business Economics and Management |
Subjects: | |
Online Access: | https://journals.vgtu.lt/index.php/JBEM/article/view/4440 |
Similar Items
-
A combination of genetic algorithm and particle swarm optimization method for solving traveling salesman problem
by: Keivan Borna, et al.
Published: (2015-12-01) -
An evaluation of solution-generating Algorithms for the asymmetric traveling salesman problem
by: McGuire, Randy L.
Published: (1983) -
Tabu Search Method for Solving the Traveling salesman Problem
by: Isra Alkallak, et al.
Published: (2008-12-01) -
On the Optimization and Parallelizing Little Algorithm for Solving the Traveling Salesman Problem
by: V. V. Vasilchikov
Published: (2016-08-01) -
An implementation of a branch-and-cut algorithm for the travelling salesman problem
by: Geldenhuys, Christel Erna
Published: (2012)