DocumentCode
465910
Title
Multi-point Tabu Search based on Proximate Optimality Principle
Author
Niizuma, Daichi ; Yasuda, Keiichiro ; Ishigame, Atushi
Author_Institution
Tokyo Metropolitan Univ., Tokyo
Volume
3
fYear
2006
fDate
8-11 Oct. 2006
Firstpage
2297
Lastpage
2302
Abstract
This paper proposes an algorithm - multi-point tabu search based on proximate optimality principle (POP) - which has several advantages for solving combinatorial optimization problems. The proposed algorithm is applied to several 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
combinatorial mathematics; optimisation; search problems; combinatorial optimization problem; multipoint tabu search; proximate optimality principle; Approximation algorithms; Computational complexity; Control systems; Cybernetics; Feedback; Genetic algorithms; Large-scale systems; Mathematical model; Optimization methods; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man and Cybernetics, 2006. SMC '06. IEEE International Conference on
Conference_Location
Taipei
Print_ISBN
1-4244-0099-6
Electronic_ISBN
1-4244-0100-3
Type
conf
DOI
10.1109/ICSMC.2006.385205
Filename
4274211
Link To Document