Proximate Optimality Principle Based Tabu Search

IEEJ Transactions on Electronics, Information and Systems

Volumn 124, Issue 3, 2004, Pages 912-920

  Kanazawa, Takahiko ^a   Yasuda, Keiichiro ^a  

^a TOKYO METROPOLITAN UNIVERSITY   (Japan)

Author keywords

Combinatorial Optimization; Meta heuristics; POP; Tabu Search; Traveling Salesman Problem

Indexed keywords

EID: 34547163533     PISSN: 03854221     EISSN: 13488155     Source Type: Journal    
DOI: 10.1541/ieejeiss.124.912     Document Type: Article

References (5)

1. F. Glover: “Future Paths for Integer Programming and Links to Artificial Intelligence”, Computers and Operations Research, Vol. 13, pp. 533-549 (1986)
2. F. Glover: “Tabu Search Part I”, ORSA Journal of Computing, Vol. 1, No. 3, pp. 190-206 (1989)
3. M. Kubo and Y. Miyamoto: “A New Framework of Meta-heuristics-The Hierachical Buildings Block Method -”, T. IEE Japan, Vol. 121-C, No. 6, (2001-6) (in Japanese)
4. R. Battiti and G. Tecchilli: “The Reactive Tabu Search”, ORSA Journal on Computing Vol. 6, No. 2, pp. 126-140 (1994)
5. K. Yasuda and T. Kanazawa: “Improvement of Tabu Search considering a Proximate Optimality Principle in Combinatorial Optimization Problems”, Proc. of the Thirteenth Annual Conference of Electronics, Information & Syst., IEE of Japan, (Sep, 2002) (in Japanese)