The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Cet article traite des méta-heuristiques pour les problèmes d'optimisation combinatoire. La parallélisation des méta-heuristiques est ensuite discutée dans laquelle nous montrons que le traitement parallèle a la possibilité non seulement d'accélérer mais également d'améliorer la qualité des solutions. Enfin, nous étendons la discussion sur l'optimisation combinatoire à systèmes décentralisés autonomes, dire optimisation décentralisée autonome. Cette notion devient très importante avec l'avancement de l'architecture des systèmes connectés au réseau.
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.
Copier
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
Copier
@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},}
Copier
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 -