Parallel Meta-Heuristics and Autonomous Decentralized Combinatorial Optimization
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E84-A No.1 pp.48-54
- Publication Date
- 2001/01/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section INVITED PAPER (Special Section on the 10th Anniversary of the IEICE Transactions of Fundamentals: "Last Decade and 21st Century")
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Morikazu NAKAMURA, Kenji ONAGA, "Parallel Meta-Heuristics and Autonomous Decentralized Combinatorial Optimization" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 1, pp. 48-54, January 2001, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_1_48/_p
Copy
@ARTICLE{e84-a_1_48,
author={Morikazu NAKAMURA, Kenji ONAGA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Parallel Meta-Heuristics and Autonomous Decentralized Combinatorial Optimization},
year={2001},
volume={E84-A},
number={1},
pages={48-54},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Parallel Meta-Heuristics and Autonomous Decentralized Combinatorial Optimization
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 48
EP - 54
AU - Morikazu NAKAMURA
AU - Kenji ONAGA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2001
AB - 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.
ER -
English
