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

A Multi-world Intelligent Genetic Algorithm to Interactively Optimize Large-scale TSP

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

5 Author(s)
Sakurai, Y. ; Sch. of Inf. Environ., Tokyo Denki Univ. ; Onoyama, T. ; Kubota, S. ; Nakamura, Y.
more authors

To optimize large-scale distribution networks, solving about 1000 middle scale (around 40 cities) TSPs (traveling salesman problems) within an interactive length of time (max. 30 seconds) is required. Yet, expert-level (less than 3% of errors) accuracy is necessary. To realize the above requirements, a multi-world intelligent GA method was developed. This method combines a high-speed GA with an intelligent GA holding problem-oriented knowledge that is effective for some special location patterns. If conventional methods were applied, solutions for more than 20 out of 20,000 cases were below expert-level accuracy. However, the developed method could solve all of 20,000 cases at expert-level

Published in:

Information Reuse and Integration, 2006 IEEE International Conference on

Date of Conference:

16-18 Sept. 2006

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.