By Topic

Solving traveling salesman problem by real space renormalization technique

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
U. Yoshiyuki ; Inst. of Phys., Kanagawa Univ., Yokohama, Japan

A real space renormalization technique is introduced which is used in the study of critical phenomenon, to obtain approximate solutions of traveling salesman problems. In the procedure the author prepares in advance the basic optimized paths for 2×2 discrete space and stores those as a data set. In the actual calculation, the considered space covering all cities is divided into square cells of the size 1/2×1/2, 1/4×1/4, 1/8×1/8..., step by step, and a representative point is settled at the center of each cell, if there are cities in the area of cell. Thus all of the positions and paths become discrete, finding a shorter tour of the TSP can be easily and quickly accomplished only by calling a corresponding optimized path from data set. Computer simulation was performed for the case of 532 USA cities data. On average, a 37% longer path for 532 cities than the optimal one was obtained. The shortest tour among 20 different initial conditions was 29% longer

Published in:

Neural Networks, 1994. IEEE World Congress on Computational Intelligence., 1994 IEEE International Conference on  (Volume:7 )

Date of Conference:

27 Jun-2 Jul 1994