DocumentCode
398067
Title
Proximate optimality principle based Tabu Search
Author
Yasuda, Keiichiro ; Kanazawa, Takahiko
Author_Institution
Tokyo Metropolitan Univ., Japan
Volume
2
fYear
2003
fDate
5-8 Oct. 2003
Firstpage
1560
Abstract
This paper proposes an algorithm-Multi Criteria Tabu Search coordinating the intensification and the diversification based on Proximate Optimality Principle (POP)-which has several advantages for solving combinatorial optimization problems. The proposed algorithm is applied to some traveling salesman problems which are typical combinatorial optimization problems in order to verify the performance of the proposed algorithm. The simulation results indicate that the proposed method has higher optimality than the conventional Tabu Search.
Keywords
problem solving; search problems; travelling salesman problems; POP; combinatorial optimization; diversification; intensification; metaheuristics; multicriteria tabu search; problem solving; proximate optimality principle; traveling salesman problems; Computational modeling; Genetic algorithms; NP-hard problem; Polynomials; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man and Cybernetics, 2003. IEEE International Conference on
ISSN
1062-922X
Print_ISBN
0-7803-7952-7
Type
conf
DOI
10.1109/ICSMC.2003.1244634
Filename
1244634
Link To Document