Parallel Meta-Heuristics and Autonomous Decentralized Combinatorial Optimization

Morikazu NAKAMURA  Kenji ONAGA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E84-A   No.1   pp.48-54
Publication Date: 2001/01/01
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: INVITED PAPER (Special Section on the 10th Anniversary of the IEICE Transactions of Fundamentals: "Last Decade and 21st Century")
combinatorial optimization,  meta-heuristics,  parallel optimization,  autonomous decentralized optimization,  

Full Text: PDF(206.6KB)>>
Buy this Article

This paper treats meta-heuristics for combinatorial optimization problems. The parallelization of meta-heuristics is then discussed in which we show that parallel processing has possibility of not only speeding up but also improving solution quality. Finally we extend the discussion of the combinatorial optimization into autonomous decentralized systems, say autonomous decentralized optimization. This notion becomes very important with the advancement of the network-connected system architecture.