By Topic

A novel traveling salesman problem solution by accelerated evolutionary computation with approximated cost matrix in an industrial application

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)
Yan Pei ; Grad. Sch. of Design, Kyushu Univ., Fukuoka, Japan ; Takagi, H.

We propose an industrial technological solution for the traveling salesman problem (TSP) by using the approximated cost matrix and an accelerated evolutionary computation (EC) algorithm. The cost matrix used by theoretical research on TSP mostly is the Euclidean distance between cities, which is not proper to the real condition in the industrial product's application. In this paper, we propose an approximation approach on cost matrix based on the geographic information data, so that it approaches to the actual cost matrix. Slow convergence is the main issue of EC. We propose an accelerating EC convergence approach by Lagrange interpolation method to approximate the EC search space landscape, and do a local search near the related best individuals' region. The experimental result shows that the EC convergence is accelerated, and this acceleration approach is also used in an actual TSP application in a vehicle navigation system, in which the product performance is improved by the accelerated EC approach with the approximated cost matrix.

Published in:

Soft Computing and Pattern Recognition (SoCPaR), 2011 International Conference of

Date of Conference:

14-16 Oct. 2011