Revisiting the auto-regressive functions of the cross-entropy ant system

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The Cross-Entropy Ant System (CEAS) is an Ant Colony Optimization (ACO) system for distributed and online path management in telecommunication networks. Previous works on CEAS have enhanced the system by introducing new features. This paper takes a step back and revisits the auto-regressive functions at the core of the system. These functions are approximations of complicated transcendental functions stemming from the Cross-Entropy (CE) method for stochastic optimization, computationally intensive and therefore not suited for online and distributed operation. Using linear instead of hyperbolic approximations, new expressions are derived and shown to improve the adaptivity and robustness of the system, in particular on the occurrence of radical changes in the cost of the paths sampled by ants. © 2009 Springer-Verlag.

Cite

CITATION STYLE

APA

Paquereau, L., & Helvik, B. E. (2009). Revisiting the auto-regressive functions of the cross-entropy ant system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5918 LNCS, pp. 137–148). https://doi.org/10.1007/978-3-642-10865-5_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free