Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 2279-2284 |
| Number of pages | 6 |
| Journal | Proceedings of the IEEE International Conference on Systems, Man and Cybernetics |
| Volume | 3 |
| Publication status | Published - 1998 |
| Event | Proceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5) - San Diego, CA, USA Duration: Oct 11 1998 → Oct 14 1998 |
ASJC Scopus subject areas
- Control and Systems Engineering
- Hardware and Architecture