Applying Data Mining technology in Imperialist Competitive Algorithm for solving Traveling Salesman Problem
碩士 === 元智大學 === 資訊管理學系 === 104 === Evolutionary algorithms are often use to solve the combination problems. In recent years, researcher used heuristic algorithms to solve optimization problem. Most of the algorithms can achieve a good solution quality, but due to the combination of problems the comp...
Main Authors: | Chen-Chuan Li, 李鎮全 |
---|---|
Other Authors: | Pei-Chann Chang |
Format: | Others |
Language: | zh-TW |
Published: |
2016
|
Online Access: | http://ndltd.ncl.edu.tw/handle/ejyf6h |
Similar Items
-
Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem
by: Shuhui Xu, et al.
Published: (2014-05-01) -
Apply algorithm of changes to solve traveling salesman problem
by: Chio, Chou Hei
Published: (2011) -
An imperialist competitive algorithm for solving the production scheduling problem in open pit mine
by: Mojtaba Mokhtarian Asl, et al.
Published: (2016-06-01) -
An Efficient Imperialist Competitive Algorithm for Solving the QFD Decision Problem
by: Xue Ji, et al.
Published: (2016-01-01) -
Using Triscanning Algorithm to Solve the Traveling Salesman Problem
by: Yau-Loong Hong, et al.
Published: (2005)