By Topic

An improved genetic algorithm using the convex hull for 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

2 Author(s)
Takenaka, Y. ; Div. of Inf. & Math. Sci., Osaka Univ. ; Funabiki, N.

In this paper, we propose an improved genetic algorithm for the traveling salesman problem (TSP) by using the “visiting order restriction theorem”. The visiting order restriction theorem gives a necessary condition for the shortest tour of TSP on the Euclidean plane by using the convex hull. The convex hull for a set of points S on a plane is defined as the smallest convex polygon that encloses S. In our method, the initial tours are produced to satisfy the necessary condition of the theorem for the shortest path without increasing the computation time. The simulation results using 10 well-known benchmark problems show that our algorithm can find better tour with shorter time than Pal's algorithm (1993)

Published in:

Systems, Man, and Cybernetics, 1998. 1998 IEEE International Conference on  (Volume:3 )

Date of Conference:

11-14 Oct 1998