TITLE

ISPO: A New Way to Solve Traveling Salesman Problem

AUTHOR(S)
Xiaohua Wang; Aiqin Mu; Shisong Zhu
PUB. DATE
May 2013
SOURCE
Intelligent Control & Automation (2153-0653);May2013, Vol. 4 Issue 2, p122
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
This paper first introduces the concepts of mobile operators and mobile sequence, with which it redefines the rate of particle swarm optimization algorithm and the formula of position updating. Combining this discrete PSO algorithm with neighbors, the paper puts forward Hybrd Particle Swarm Optimization Algorithm, whose effectiveness is verified at the end of this paper.
ACCESSION #
89449160

 

Related Articles

  • Solve Traveling Salesman Problem Using Particle Swarm Optimization Algorithm. Xuesong Yan; Can Zhang; Wenjing Luo; Wei Li; Wei Chen; Hanmin Liu // International Journal of Computer Science Issues (IJCSI);Nov2012, Vol. 9 Issue 6, p264 

    The traveling salesman problem (TSP) is one of the most widely studied NP-hard combinatorial optimization problems and traditional genetic algorithm trapped into the local minimum easily for solving this problem. Particle Swarm Optimization (PSO) algorithm was developed under the inspiration of...

  • Velocity Tentative PSO: An Optimal Velocity Implementation based Particle Swarm Optimization to Solve Traveling Salesman Problem. Akhand, M. A. H.; Akter, Shahina; Rashid, M. A.; Yaakob, S. B. // IAENG International Journal of Computer Science;Sep2015, Vol. 42 Issue 3, p221 

    This paper introduces an effective Particle Swarm Optimization (PSO) based algorithm for solving Traveling Salesman Problem (TSP). Among prominent PSO based methods, the proposed Velocity Tentative PSO (VTPSO) considers Swap Sequence (SS) for velocity operation of the particles. A velocity SS is...

  • Wisdom of Artificial Crowds-A Metaheuristic Algorithm for Optimization. Yampolskiy, Roman V.; Ashby, Leif; Hassan, Lucas // Journal of Intelligent Learning Systems & Applications;May2012, Vol. 4 Issue 2, p98 

    Finding optimal solutions to NP-Hard problems requires exponential time with respect to the size of the problem. Consequently, heuristic methods are usually utilized to obtain approximate solutions to problems of such difficulty. In this paper, a novel swarm-based nature-inspired metaheuristic...

  • An improvement Particle Swarm Optimization for Travelling Salesman Problem with the mutation operator. Jaturong Sriborikit; Panwit Tuwanut // Applied Mechanics & Materials;2015, Vol. 781, p527 

    This document proposed improvement PSO with applying mutation operator for solving Travelling Salesman Problem. To PSO solve or decrease trapping in local optimum. From experiment results of this research show that results of PSO with applying mutation operator obtain better than results of...

  • COMBINATORIAL OPTIMIZATION USING ARTIFICIAL BEE COLONY ALGORITHM AND PARTICLE SWARM OPTIMIZATION SUPPORTED GENETIC ALGORITHM. ÖNDER, Emrah; ÖZDEMİR, Muhlis; YILDIRIM, Bahadır Fatih // Kafkas University, Journal of Economics & Administrative Science;2013, Vol. 4 Issue 6, p59 

    Combinatorial optimization problems are usually NP-hard and the solution space of them is very large. Therefore the set of feasible solutions cannot be evaluated one by one. Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO) and Genetic Algorithms (GA) are metaheuristic techniques...

  • An Improved Modular Hybrid Ant Colony Approach for Solving Traveling Salesman Problem. Sahana, Sudip Kumar; Jain, Aruna // GSTF Journal on Computing;2011, Vol. 1 Issue 2, p123 

    Our primary aim is to design a framework to solve the well known traveling salesman problem(TSP) using combined approach of Ant Colony Optimization (ACO) and Genetic Algorithm (GA). Several solutions exists for the above problem using ACO or GA and even using a hybrid approach of ACO and GA. Our...

  • Multi-objective design optimization of composite laminates using discrete shuffled frog leaping algorithm. Fakhrabadi, Mir; Rastgoo, Abbas; Samadzadeh, Mostafa // Journal of Mechanical Science & Technology;Jun2013, Vol. 27 Issue 6, p1791 

    This paper deals with the optimization of composite laminates using discrete shuffled frog leaping method. This approach is used to find optimal values of three design variables including fiber orientations in matrices, thickness of each ply and number of layers in order to minimize the weights...

  • An Efficient Hybrid Genetic Algorithm for Performance Enhancement in solving Travelling Salesman Problem. Dalip, Navjot Kaur // International Journal on Computer Science & Engineering;2011, Vol. 3 Issue 11, p3502 

    This paper, proposes a solution for Travelling Salesman Problem (TSP) [1], using Genetic Algorithm (GA). The proposed algorithm works on data sets of latitude and longitude coordinates of cities and provides optimal tours in shorter time; giving convergence that is fast and better. To improve...

  • A Particle Swarm Optimization Based on Evolutionary Game Theory for Discrete Combinatorial Optimization. Pei-hua Fu; Yi-jie Wang; Yang Peng // Journal of Convergence Information Technology;Nov2012, Vol. 7 Issue 21, p369 

    This paper presented a new particle swarm optimization based on evolutionary game theory (EPSO) for the traveling salesman problem (TSP) to overcome the disadvantages of premature convergence and stagnation phenomenon of traditional particle swarm optimization algorithm (PSO). In addition, we...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics