AI Chat AI Image Generator AI Video Text to Speech

Statistical Approach for Selecting Elite Ants

03/01/2012

∙

by G. S. Raghavendra, et al.

∙

∙

Applications of ACO algorithms to obtain better solutions for combinatorial optimization problems have become very popular in recent years. In ACO algorithms, group of agents repeatedly perform well defined actions and collaborate with other ants in order to accomplish the defined task. In this paper, we introduce new mechanisms for selecting the Elite ants dynamically based on simple statistical tools. We also investigate the performance of newly proposed mechanisms.

G. S. Raghavendra
1 publication
N. Prasanna Kumar
1 publication

research

∙ 11/15/2018

Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon

This paper surveys the recent attempts, both from the machine learning a...

0 Yoshua Bengio, et al. ∙

research

∙ 09/13/2019

AED: An Anytime Evolutionary DCOP Algorithm

Evolutionary optimization is a generic population-based metaheuristic th...

0 Saaduddin Mahmud, et al. ∙

research

∙ 08/17/2020

A Survey on Reinforcement Learning for Combinatorial Optimization

This paper gives a detailed review of reinforcement learning in combinat...

0 Andrew Whinston, et al. ∙

research

∙ 11/06/2022

A Survey on Influence Maximization: From an ML-Based Combinatorial Optimization

Influence Maximization (IM) is a classical combinatorial optimization pr...

0 Yandi Li, et al. ∙

research

∙ 06/21/2021

Matrix Encoding Networks for Neural Combinatorial Optimization

Machine Learning (ML) can help solve combinatorial optimization (CO) pro...

0 Yeong-Dae Kwon, et al. ∙

research

∙ 02/14/2022

Optimizing over Serial Dictatorships

Motivated by the success of the serial dictatorship mechanism in social ...

0 Ioannis Caragiannis, et al. ∙

research

∙ 07/15/2022

OSCAR: A Semantic-based Data Binning Approach

Binning is applied to categorize data values or to see distributions of ...

0 Vidya Setlur, et al. ∙