Proposal of Tabu Search Based Multi-Point Search Method for Multi-Objective Combinatorial Optimization Problems

2014 ◽  
Vol 134 (3) ◽  
pp. 466-467
Author(s):  
Shuhei Takamura ◽  
Kenichi Tamura ◽  
Keiichiro Yasuda
Keyword(s):  
Combinatorial Optimization ◽  
Tabu Search ◽  
Optimization Problems ◽  
Search Method ◽  
Multi Objective ◽  
Combinatorial Optimization Problems ◽  
Point Search

1111 Multi-Objective Multi-Point Search Method Based on Tabu Search Using Diversification and Intensification

2014 ◽  
Vol 2014.11 (0) ◽  
pp. _1111-1_-_1111-6_
Author(s):  
Shuhei TAKAMURA ◽  
Kenichi TAMURA ◽  
Keiichiro YASUDA
Keyword(s):  
Tabu Search ◽  
Search Method ◽  
Multi Objective ◽  
Point Search

scholarly journals ITERATED TABU SEARCH: AN IMPROVEMENT TO STANDARD TABU SEARCH

2006 ◽  
Vol 35 (3) ◽  
Author(s):  
Alfonsas Misevicius ◽  
Antanas Lenkevicius ◽  
Dalius Rubliauskas
Keyword(s):  
Combinatorial Optimization ◽  
Tabu Search ◽  
High Efficiency ◽  
Optimization Problems ◽  
Quadratic Assignment Problem ◽  
Special Kind ◽  
Quadratic Assignment ◽  
Combinatorial Optimization Problems ◽  
Diversification Mechanism ◽  
Iterated Tabu Search

The goal of this paper is to discuss the tabu search (TS) meta-heuristic and its enhancement for combinatorial optimization problems. Firstly, the issues related to the principles and specific features of the standard TS are concerned. Further, a promising extension to the classical tabu search scheme is introduced. The most important component of this extension is a special kind of diversification mechanism. We give the paradigm of this new improved TS strategy, which is called an iterated tabu search (ITS). ITS was applied to the difficult combinatorial optimization problems, the traveling salesman problem (TSP) and the quadratic assignment problem (QAP). The results of the experiments with the TSP and QAP show the high efficiency of the ITS strategy. The outstanding performance of ITS is also demonstrated by the fact that the new record-breaking solutions were found for the hard QAP instances - tai80a and tai100a.

Sign in / Sign up

Export Citation Format

Share Document