Cart (Loading....) | Create Account
Close category search window

Integrate the Hungarian Method and Genetic Algorithm to Solve the Shortest Distance 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

1 Author(s)
Chin-Jung Huang ; St. John''s Univ., Taipei, Taiwan

In Traveling Salesman Problems, there are n! possible routes for a tourist to visit n cities, by only passing through each city once before finally returning to the city of departure. The difficulty of this problem is in finding the shortest from among these n! possible routes quickly and effectively. This research integrates the Hungarian Method and Genetic Algorithm to find the shortest distance route and the distance or the approximately shortest distance route and the distance, and constructs the shortest distance route system for traveling. The system needs only a personal computer to find the shortest distance route and its corresponding distance quickly and effectively.

Published in:

Digital Manufacturing and Automation (ICDMA), 2012 Third International Conference on

Date of Conference:

July 31 2012-Aug. 2 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.