A combination of genetic algorithm and particle swarm optimization method for solving traveling salesman problem
Traveling salesman problem (TSP) is a well-established NP-complete problem and many evolutionary techniques like particle swarm optimization (PSO) are used to optimize existing solutions for that. PSO is a method inspired by the social behavior of birds. In PSO, each member will change its position...
Main Authors: | Keivan Borna, Razieh Khezri |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2015-12-01
|
Series: | Cogent Mathematics |
Subjects: | |
Online Access: | http://dx.doi.org/10.1080/23311835.2015.1048581 |
Similar Items
-
A transfer learning-based particle swarm optimization algorithm for travelling salesman problem
by: Yang, K., et al.
Published: (2022) -
QUANTUM INSPIRED PARTICLE SWARM COMBINED WITH LIN-KERNIGHAN-HELSGAUN METHOD TO THE TRAVELING SALESMAN PROBLEM
by: Bruno Avila Leal de Meirelles Herrera, et al.
Published: (2015-12-01) -
Improvement of Traveling Salesman Problem Solution Using Hybrid Algorithm Based on Best-Worst Ant System and Particle Swarm Optimization
by: Muhammad Salman Qamar, et al.
Published: (2021-05-01) -
Dynamics of Stochastic vs. Greedy Heuristics in Traveling Salesman Problem
by: Maciej Białogłowski, et al.
Published: (2018-12-01) -
Use of Ant Colony Optimization Algorithm for Determining Traveling Salesman Problem Routes
by: Bib Paruhum Silalahi, et al.
Published: (2019-10-01)