Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem

(1998) Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem. Systems, Man, and Cybernetics, Part B, IEEE Transactions on, 28.


Download (19kB) | Preview
[img] Microsoft Word

Download (27kB)


This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). It begins with a brief introduction to the TSP and the E-TSP. Then, it presents the proposed algorithm with its two major components: the convex-elastic net (CEN) algorithm and the nondeterministic iterative improvement (NII) algorithm. These two algorithms are combined into the efficient convex-elastic net (ECEN) algorithm. The CEN algorithm integrates the convex-hull property and elastic net algorithm to generate an initial tour for the E-TSP. The NII algorithm uses two rearrangement operators to improve the initial tour given by the CEN algorithm. The paper presents simulation results for two instances of E-TSP: randomly generated tours and tours for well-known problems in the literature. Experimental results are given to show that the proposed algorithm ran find the nearly optimal solution for the E-TSP that outperform many similar algorithms reported in the literature. The paper concludes with the advantages of the new algorithm and possible extensions

Item Type: Article
Subjects: Computer
Department: College of Computing and Mathematics > Information and Computer Science
Depositing User: Mr. Admin Admin
Date Deposited: 24 Jun 2008 13:33
Last Modified: 01 Nov 2019 14:05
URI: http://eprints.kfupm.edu.sa/id/eprint/14378