Improved genetic algorithm using the convex hull for traveling salesman problem

Yoichi Takenaka, Nobuo Funabiki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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 languageEnglish
Title of host publicationProceedings of the IEEE International Conference on Systems, Man and Cybernetics
Editors Anon
PublisherIEEE
Pages2279-2284
Number of pages6
Volume3
Publication statusPublished - 1998
Externally publishedYes
EventProceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5) - San Diego, CA, USA
Duration: Oct 11 1998Oct 14 1998

Other

OtherProceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5)
CitySan Diego, CA, USA
Period10/11/9810/14/98

Fingerprint

Traveling salesman problem
Genetic algorithms

ASJC Scopus subject areas

  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

Takenaka, Y., & Funabiki, N. (1998). Improved genetic algorithm using the convex hull for traveling salesman problem. In Anon (Ed.), Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (Vol. 3, pp. 2279-2284). IEEE.

Improved genetic algorithm using the convex hull for traveling salesman problem. / Takenaka, Yoichi; Funabiki, Nobuo.

Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. ed. / Anon. Vol. 3 IEEE, 1998. p. 2279-2284.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Takenaka, Y & Funabiki, N 1998, Improved genetic algorithm using the convex hull for traveling salesman problem. in Anon (ed.), Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. vol. 3, IEEE, pp. 2279-2284, Proceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5), San Diego, CA, USA, 10/11/98.
Takenaka Y, Funabiki N. Improved genetic algorithm using the convex hull for traveling salesman problem. In Anon, editor, Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. Vol. 3. IEEE. 1998. p. 2279-2284
Takenaka, Yoichi ; Funabiki, Nobuo. / Improved genetic algorithm using the convex hull for traveling salesman problem. Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. editor / Anon. Vol. 3 IEEE, 1998. pp. 2279-2284
@inproceedings{0d99a4ef2fce47858ebaed5c21b7614c,
title = "Improved genetic algorithm using the convex hull for traveling salesman problem",
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.",
author = "Yoichi Takenaka and Nobuo Funabiki",
year = "1998",
language = "English",
volume = "3",
pages = "2279--2284",
editor = "Anon",
booktitle = "Proceedings of the IEEE International Conference on Systems, Man and Cybernetics",
publisher = "IEEE",

}

TY - GEN

T1 - Improved genetic algorithm using the convex hull for traveling salesman problem

AU - Takenaka, Yoichi

AU - Funabiki, Nobuo

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0032320002&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032320002&partnerID=8YFLogxK

M3 - Conference contribution

VL - 3

SP - 2279

EP - 2284

BT - Proceedings of the IEEE International Conference on Systems, Man and Cybernetics

A2 - Anon, null

PB - IEEE

ER -