A Multi-step Intelligent Genetic Algorithm to Optimize Delivery Problem within Interactive-time

To optimize large-scale distribution networks, solving about 1000 (around 40 cities) TSPs (Traveling Salesman Problems) within an interactive length of time (max. scores of seconds) is required. Yet, expert-level (less than 3% of errors) accuracy is necessary. To realize the above requirements, a Mu...

Full description

Saved in:
Bibliographic Details
Published inJournal of Japan Society for Fuzzy Theory and Intelligent Informatics Vol. 20; no. 4; pp. 639 - 652
Main Authors ONOYAMA, Takashi, TSURUTA, Setsuo, KUBOTA, Sen, SAKURAI, Yoshitaka
Format Journal Article
LanguageJapanese
Published Japan Society for Fuzzy Theory and Intelligent Informatics 15.08.2008
Subjects
GA (Genetic Algorithm)
Heuristics
TSP (Traveling Salesman Problem)
Online AccessGet full text

Cover

Be the first to leave a comment!
You must be logged in first