… Salesman Problem. Here the features of swap sequences and swap operations on the
sequence of cities (solution/path) of the problem are used to create different solution (path) …

… The Traveling Salesman Problem (TSP) is a problem that … The problem can be easily described
as: If the salesman only … , what cheapest route can the salesman take? Formally, a graph …

… Sequence, we define the operator 63 as merging two Swap … is to construct a Basic Swap
Sequence SS which can act on B … We can swap the nodes in B according to A from left to right to …

… In this paper combining the features of swap sequence and swap … Salesman Problem (TSP).
Interchange of two cities of a path of a TSP is known as swap operation and a sequence of …

… In this paper using the concept of swap operation and swap sequence on a sequence of
the path of a TSP, ABC is modified to solve MOTSP. To determine the fitness of a solution an …

… In DSMO, every spider monkey represents a TSP solution where Swap Sequence (SS)
and Swap Operator (SO) based operations are employed, which enables interaction among …

… In this paper, the enhanced swap sequence based PSO algorithm is applied to solve the
Traveling Salesman Problem (TSP) in a package delivery system which consists of 50 locations …

… To make the paper independently readable this section also gives a brief description existing
Swap Sequence (SS) based PSO. Section III is for experimental studies of the proposed …

… problems. It is also used to solve traveling salesman problems, where swap sequence and
swap … A PSO that uses swap sequence and swap operation is called SSPSO. As discussed in …

… salesman problem. Three special operators for discrete optimization problem named swap,
… have the probability to swap or shift other positions in the sequence so that other positions …