Chaotic Particle Swarm Optimization Algorithm for Traveling Salesman Problem

Population-Based Optimization Algorithms for Solving the Travelling Salesman Problem

“…As it is mentioned, the paper uses an algorithm based on ACS for solving the TSP. Table 4 illustrates the results of the paper presented in (Yuan et al, 2007) which works based on ACO in combination with PSO. …”

“…Here, we investigate some of these proposed approaches for solving the TSP. One of the attractive works for solving the TSP was cited in (Yuan et al., 2007). They propose a novel hybrid algorithm which invokes the sufficiency of both PSO and COA (Chaotic Optimization Algorithm) (Zhang et al, 2001).…”

Particle Swarm Optimization Algorithm for the Traveling Salesman Problem

“…A detailed discussion of this approach and the results it obtained is presented in section 3. Yuan et al (2007) and Shi et al (2007) propose extensions for the approach presented by Wang et al (2003). Both algorithms define subtraction in terms of sequences of 2-swap operations as defined in the path-relinking velocity operator presented by Goldbarg et al (2006a), including some uncertainty for the exchange of two elements.…”

“…Both algorithms define subtraction in terms of sequences of 2-swap operations as defined in the path-relinking velocity operator presented by Goldbarg et al (2006a), including some uncertainty for the exchange of two elements. Yuan et al (2007) propose new concepts for "chaos variables" and memory for particles. The m e m o r y o f e a c h p a r t i c l e i s a n | N|-dimensional vector of chaos variables.…”

An Improved Particle Swarm Optimization Algorithm for Traveling Salesman Problems

“…Yuan et al [35] propose new concepts for " chaos variables" and memory for particles. The memory of each particle is a |N|-dimensional vector of chaos variables.…”