By Topic

A GA-based systematic reasoning approach for solving traveling salesman problems using an orthogonal array crossover

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
$33 $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)
Shinn-Ying Ho ; Dept. of Inf. Eng., Feng Chia Univ., Taichung, Taiwan ; Jian-Hung Chen

This paper proposes a novel genetic algorithm-based systematic reasoning approach using an orthogonal array crossover (OAX) for solving the traveling salesman problem (TSP). OAX makes use of the systematic reasoning ability of orthogonal arrays that can effectively preserve superior sub-paths from parents and guide the solution towards better quality. OAX combines the advantages of two traditional approaches: canonical approach and heuristic approach. It is shown empirically that OAX outperforms various superior crossovers in both accuracy and speed. An improved OAX with a well-known heuristic method is also presented.

Published in:

High Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition on  (Volume:2 )

Date of Conference:

14-17 May 2000