Probabilistic analysis of solving the assignment problem for the traveling salesman problem

1982 ◽  
Vol 9 (1) ◽  
pp. 77-82 ◽  
Author(s):  
J.-C. Panayiotopoulos
2007 ◽  
Vol 5 (1) ◽  
pp. 1-9
Author(s):  
Paulo Henrique Siqueira ◽  
Sérgio Scheer ◽  
Maria Teresinha Arns Steiner

Symmetry ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 48
Author(s):  
Jin Zhang ◽  
Li Hong ◽  
Qing Liu

The whale optimization algorithm is a new type of swarm intelligence bionic optimization algorithm, which has achieved good optimization results in solving continuous optimization problems. However, it has less application in discrete optimization problems. A variable neighborhood discrete whale optimization algorithm for the traveling salesman problem (TSP) is studied in this paper. The discrete code is designed first, and then the adaptive weight, Gaussian disturbance, and variable neighborhood search strategy are introduced, so that the population diversity and the global search ability of the algorithm are improved. The proposed algorithm is tested by 12 classic problems of the Traveling Salesman Problem Library (TSPLIB). Experiment results show that the proposed algorithm has better optimization performance and higher efficiency compared with other popular algorithms and relevant literature.


1995 ◽  
Vol 43 (2) ◽  
pp. 367-371 ◽  
Author(s):  
Yvan Dumas ◽  
Jacques Desrosiers ◽  
Eric Gelinas ◽  
Marius M. Solomon

Sign in / Sign up

Export Citation Format

Share Document