模式识别与人工智能
Thursday, Apr. 3, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2007, Vol. 20 Issue (4): 478-484    DOI:
Papers and Reports Current Issue| Next Issue| Archive| Adv Search |
A TwoStage Tabu Search Algorithm Based on Rough Set Theory
LI Fan, LIU QiHe, YANG GuoWei
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 610054

Download: PDF (552 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  A twostage tabu search algorithm based on rough set theory is proposed for combinatorial optimization problems which are represented by TSP. For most of the adaptive tabu search algorithms, the balance between intensification and diversification is achieved by tuning tabu search parameters dynamically. Unlike them, a twostage search strategy is used in the proposed approach. The aim of the first stage is diversification. In this stage, the search area is stimulated to move away from the initial solution, and the whole solution space is explored to a certain degree. Then, based on the solutions obtained in diversification, a promising area decision table is constructed and the corresponding promising area is found. The goal of the second stage is intensification. In this stage, the search procedure begins with the best solution which contains the promising area. In the search procedure, the selection of the new current solution is limited so as to utilize the useful information obtained in the first stage. The proposed algorithm is tested by TSP benchmark problems. The results show that it is feasible and effective.
Key wordsTabu Search (TS)      Rough Set      Intensification      Diversification      Traveling Salesman Problem (TSP)     
Received: 30 May 2006     
ZTFLH: TP181  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
LI Fan
LIU QiHe
YANG GuoWei
Cite this article:   
LI Fan,LIU QiHe,YANG GuoWei. A TwoStage Tabu Search Algorithm Based on Rough Set Theory[J]. , 2007, 20(4): 478-484.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2007/V20/I4/478
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn