An Improved Annealing Algorithm Based on Multi-Agent

Journal Home
Volume 19 - 2024
- Vol. 19, Issue 2 pp.81-190
- Vol. 19, Issue 1 pp.1-80
Volume 18 - 2023
- Vol. 18, Issue 2 pp.81-160
- Vol. 18, Issue 1 pp.1-80
Volume 17 - 2022
- Vol. 17, Issue 2 pp.83-160
- Vol. 17, Issue 1 pp.1-80
Volume 16 - 2021
- Vol. 16, Issue 2 pp.83-159
- Vol. 16, Issue 1 pp.1-80
Volume 15 - 2020
- Vol. 15, Issue 2 pp.83-160
- Vol. 15, Issue 1 pp.1-73
Volume 14 - 2019
- Vol. 14, Issue 4 pp.243-320
- Vol. 14, Issue 3 pp.163-240
- Vol. 14, Issue 2 pp.83-160
- Vol. 14, Issue 1 pp.1-80
Volume 13 - 2018
- Vol. 13, Issue 4 pp.243-320
- Vol. 13, Issue 3 pp.163-240
- Vol. 13, Issue 2 pp.83-160
- Vol. 13, Issue 1 pp.1-80
Volume 12 - 2017
- Vol. 12, Issue 4 pp.243-320
- Vol. 12, Issue 3 pp.163-240
- Vol. 12, Issue 2 pp.83-160
- Vol. 12, Issue 1 pp.1-80
Volume 11 - 2016
- Vol. 11, Issue 4 pp.243-320
- Vol. 11, Issue 3 pp.163-240
- Vol. 11, Issue 2 pp.83-160
- Vol. 11, Issue 1 pp.1-80
Volume 10 - 2015
- Vol. 10, Issue 4 pp.243-320
- Vol. 10, Issue 3 pp.163-240
- Vol. 10, Issue 2 pp.83-160
- Vol. 10, Issue 1 pp.1-80
Volume 9 - 2014
- Vol. 9, Issue 4 pp.243-320
- Vol. 9, Issue 3 pp.163-240
- Vol. 9, Issue 2 pp.83-153
- Vol. 9, Issue 1 pp.1-80
Volume 8 - 2013
- Vol. 8, Issue 4 pp.243-320
- Vol. 8, Issue 3 pp.163-240
- Vol. 8, Issue 2 pp.83-160
- Vol. 8, Issue 1 pp.1-80
Volume 7 - 2012
- Vol. 7, Issue 4 pp.243-320
- Vol. 7, Issue 3 pp.163-240
- Vol. 7, Issue 2 pp.83-160
- Vol. 7, Issue 1 pp.1-80
Volume 6 - 2011
- Vol. 6, Issue 4 pp.243-320
- Vol. 6, Issue 3 pp.163-240
- Vol. 6, Issue 2 pp.83-160
- Vol. 6, Issue 1 pp.1-80
Volume 5 - 2010
- Vol. 5, Issue 4 pp.243-320
- Vol. 5, Issue 3 pp.163-240
- Vol. 5, Issue 2 pp.83-160
- Vol. 5, Issue 1 pp.1-80
Volume 4 - 2009
- Vol. 4, Issue 4 pp.243-320
- Vol. 4, Issue 3 pp.161-239
- Vol. 4, Issue 2 pp.83-160
- Vol. 4, Issue 1 pp.1-80
Volume 3 - 2008
- Vol. 3, Issue 4 pp.243-268
- Vol. 3, Issue 3 pp.163-224
- Vol. 3, Issue 2 pp.83-152
- Vol. 3, Issue 1 pp.1-72
Volume 2 - 2007
- Vol. 2, Issue 4 pp.243-298
- Vol. 2, Issue 3 pp.163-240
- Vol. 2, Issue 2 pp.85-160
- Vol. 2, Issue 1 pp.1-80
Volume 1 - 2006
- Vol. 1, Issue 5 pp.259-317
- Vol. 1, Issue 4 pp.195-256
- Vol. 1, Issue 3 pp.129-192
- Vol. 1, Issue 2 pp.65-128
- Vol. 1, Issue 1 pp.1-64

Volume 1, Issue 3

J. Info. Comput. Sci. , 1 (2006), pp. 161-167.

[An open-access article; the PDF is free to any online user.]

Full PDF 156 2376

Cited by

google scholar semantic scholar

Export citation

Abstract

Considering the characteristics of Simulated Annealing Algorithm (SAA), based on the agents’ perception and retroaction to their surroundings, in this paper a new algorithm called Multi-agent Annealing Algorithm (MAA) is presented. And the global convergence of MAA is gotten. Finally, we make several numerical experiments to compare MAA with SAA and Genetic Algorithm (GA) by three classical test functions in optimization, which suggest that MAA is superior to GA and SAA.

Keywords

AMS Subject Headings

Email address

BibTex
RIS
TXT

@Article{JICS-1-161, author = {}, title = {An Improved Annealing Algorithm Based on Multi-Agent}, journal = {Journal of Information and Computing Science}, year = {2006}, volume = {1}, number = {3}, pages = {161--167}, abstract = { Considering the characteristics of Simulated Annealing Algorithm (SAA), based on the agents’ perception and retroaction to their surroundings, in this paper a new algorithm called Multi-agent Annealing Algorithm (MAA) is presented. And the global convergence of MAA is gotten. Finally, we make several numerical experiments to compare MAA with SAA and Genetic Algorithm (GA) by three classical test functions in optimization, which suggest that MAA is superior to GA and SAA. }, issn = {3080-180X}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jics/22840.html} }

TY - JOUR T1 - An Improved Annealing Algorithm Based on Multi-Agent AU - JO - Journal of Information and Computing Science VL - 3 SP - 161 EP - 167 PY - 2006 DA - 2006/06 SN - 1 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jics/22840.html KW - AB - Considering the characteristics of Simulated Annealing Algorithm (SAA), based on the agents’ perception and retroaction to their surroundings, in this paper a new algorithm called Multi-agent Annealing Algorithm (MAA) is presented. And the global convergence of MAA is gotten. Finally, we make several numerical experiments to compare MAA with SAA and Genetic Algorithm (GA) by three classical test functions in optimization, which suggest that MAA is superior to GA and SAA.

. (2006). An Improved Annealing Algorithm Based on Multi-Agent. Journal of Information and Computing Science. 1 (3). 161-167. doi:

Copy to clipboard

BibteX RIS TXT

The citation has been copied to your clipboard

- LOGIN -

- E-mail verification -

- REGISTER -