By Topic

Single minimum method for combinatorial optimization problems and an efficient algorithm of TSP problem

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
$31 $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

2 Author(s)
Xu, D. ; Dept. of Comput. Sci., Tokyo Inst. of Technol., Japan ; Kumazawa, I.

The problem of local minima often appears when solving combinatorial optimization problems by conventional methods relying on the minimization of an objective function. A new approach to combinatorial optimization problems, called the single minimum method (SMM) is proposed. An analysis using the analogy of thermodynamics is given. In order to show how the method works, an algorithm based on it is suggested for solving the traveling salesman problem. The simulation results show that, for 10-city problems, the algorithm can find the shortest or near shortest path with a high success rate

Published in:

Neural Networks, 1993., IEEE International Conference on

Date of Conference: