Experiment Study of Entropy Convergence of Ant Colony Optimization

05/12/2009
by   Chao-Yang Pang, et al.
0

Ant colony optimization (ACO) has been applied to the field of combinatorial optimization widely. But the study of convergence theory of ACO is rare under general condition. In this paper, the authors try to find the evidence to prove that entropy is related to the convergence of ACO, especially to the estimation of the minimum iteration number of convergence. Entropy is a new view point possibly to studying the ACO convergence under general condition. Key Words: Ant Colony Optimization, Convergence of ACO, Entropy

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/12/2019

Convergence of second-order, entropy stable methods for multi-dimensional conservation laws

High-order accurate, entropy stable numerical methods for hyperbolic con...
research
03/17/2020

Diagonal Preconditioning: Theory and Algorithms

Diagonal preconditioning has been a staple technique in optimization and...
research
06/26/2006

Entropy And Vision

In vector quantization the number of vectors used to construct the codeb...
research
02/25/2022

The concavity of generalized entropy powers

In this note we introduce a new family of entropy powers which are relat...
research
05/15/2023

Convex optimization over a probability simplex

We propose a new iteration scheme, the Cauchy-Simplex, to optimize conve...
research
09/16/2006

Cross-Entropy method: convergence issues for extended implementation

The cross-entropy method (CE) developed by R. Rubinstein is an elegant p...
research
06/26/2003

Classical and Nonextensive Information Theory

In this work we firstly review some results in Classical Information The...

Please sign up or login with your details

Forgot password? Click here to reset