A modified inver-over operator for the traveling salesman problem

Authors:
Yuting Wang;Jian Sun;Junqing Li;Kaizhou Gao
Affiliations:
College of Computer Science, Liaocheng University, Liaocheng, P.R. China;College of Computer Science, Liaocheng University, Liaocheng, P.R. China;College of Computer Science, Liaocheng University, Liaocheng, P.R. China;College of Computer Science, Liaocheng University, Liaocheng, P.R. China
Venue:
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
Year:
2011

Citing 11
Cited 0

A parallel tabu search algorithm for large traveling salesman problems

Discrete Applied Mathematics
Variable neighborhood search

Computers and Operations Research
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)
Case injected genetic algorithms for traveling salesman problems

Information Sciences: an International Journal - Special issue on frontiers in evolutionary algorithms
Inver-over Operator for the TSP

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Chained Lin-Kernighan for Large Traveling Salesman Problems

INFORMS Journal on Computing
A new hybrid heuristic approach for solving large traveling salesman problem

Information Sciences—Informatics and Computer Science: An International Journal
Particle swarm optimization-based algorithms for TSP and generalized TSP

Information Processing Letters
A memetic neural network for the Euclidean traveling salesman problem

Neurocomputing
Paper: Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections

Parallel Computing
Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Inver-over operator holds a good result for small size Traveling Salesman Problem (TSP) while has worse capability for the large scale TSP. In this study, a Modified Inver-over operator is proposed to solve the TSP. In the Modified Inver-over operator, the direction of the tour is considered when applying the inversion and the city c is decided whether it is kept same after the inversion according to adaptively increasing probability, meanwhile, the α-nearest candidate set is used when selecting city c′. We evaluate the proposed operator based on standard TSP test problems selected from TSPLIB and show that the proposed operator performs better than the Basic Inver-over operator and other operator in terms of solution quality and computational effort.