By Topic

See the forest before the trees: fine-tuned learning and its application to the traveling salesman 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

4 Author(s)
Coy, S.P. ; Coll. of Eng. & Appl. Sci., Arizona State Univ., Tempe, AZ, USA ; Golden, B.L. ; Runger, G.C. ; Wasil, E.A.

In this paper, we introduce the concept of fine-tuned learning which relies on the notion of data approximation followed by sequential data refinement. We seek to determine whether fine-tuned learning is a viable approach to use when trying to solve combinatorial optimization problems. In particular, we conduct an extensive computational experiment to study the performance of fine-tuned-learning-based heuristics for the traveling salesman problem (TSP). We provide important insight that reveals how fine-tuned learning works and why it works well, and conclude that it is a meritorious concept that deserves serious consideration by researchers solving difficult problems

Published in:

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on  (Volume:28 ,  Issue: 4 )