An assumption is usually introduced into traveling salesman problem with pickup and delivery(TSPD) that all the delivery demands must be satisfied before pickup.

Improved particle swarm optimization based on k-center and its application in traveling salesman problem;

Modified particle swarm optimization algorithm for traveling salesman problem;

Hybrid approach based on Ant Colony System for solving traveling salesman problem;

Predatory search algorithm based on tabu list and its experimental research on travelling salesman problems;

The problem of path planning for coordinated mine clearance operation of multiple autonomous underwater vehicles was formulated as a kind of multiple travelling salesman problem and two models of multiple travelling salesman problem were developed from the mission background information.

This paper introduces six different random sampling methods for cycling permutations and carries out a further study of solving the travelling salesman problem by simulated annealing.

Application Research for TSP Based on Neural Network-Ant Colony Algorithm;

Improved Genetic Algorithms for TSP;

An improved Simulated Annealing Algorithm to TSP;

Aimed at many fields combinational optimization problems being transformed into travelling salesman problem(TSP),a complex particle swarm optimization(CPSO) algorithm was put forward to solve TSP.

The operation of the genetic algorithm of Travelling Salesman Problem(TSP) needs lots of time and it is easy to fall into the local optimal solution.

When the method of antibody distilling and injecting used in Travelling Salesman Problem(TSP) were presented,the convergence of AIGA was proven theoretically.