Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《JOURNAL OF SYSTEMS ENGINEERING》 1998-03
Add to Favorite Get Latest Update

GENETIC ALGORITHM AND TABU SEARCH:A HYBRID STRATEGY

Li Dawei(Anshan Institute of Iron and Steel Technology,Anshan 114002)Wang Li(Anshan Normal College,Anshan 114005)Wang Mengguang(Northeastern University,Shenyang 110006)  
The appearance of genetic algorithms and tabu search provide powerful tools for solving combinatorial optimization problems in high dimensions.The two methods either have some common bonds,or significant differences.Through analysing,we propose a hybrid strategy of genetic algorithm and tabu search.The memory function of tabu search is introduced into procedure of genetic algorithms.A new recombination operator is constructed,while mutation operator is replaced by tabu search.Genetic algorithm and hybrid strategy are used separately to solve traveling salesman problem.The experiment results show that the hybrid strategy is superior to the standard genetic algorithm in many aspects.
【CateGory Index】: N94
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved