Introducing a binary ant colony optimization

Authors:
Min Kong;Peng Tian
Affiliations:
Shanghai Jiaotong University, Shanghai, China;Shanghai Jiaotong University, Shanghai, China
Venue:
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Year:
2006

Citing 8
Cited 4

MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows

New ideas in optimization
A Graph-based Ant system and its convergence

Future Generation Computer Systems
On how pachycondyla apicalis ants suggest a new search algorithm

Future Generation Computer Systems
A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics
Continuous interacting ant colony algorithm based on dense heterarchy

Future Generation Computer Systems - Special issue: Computational chemistry and molecular dynamics
A short convergence proof for a class of ant colony optimizationalgorithms

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
The hyper-cube framework for ant colony optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Stigmergic optimization in dynamic binary landscapes

Proceedings of the 2007 ACM symposium on Applied computing
Binary ant algorithm

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Near-optimal joint selection of transmit and receive antennas for MIMO systems

ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Binary ant colony algorithm for symbol detection in a spatial multiplexing system

UC'07 Proceedings of the 6th international conference on Unconventional Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a Binary Ant Colony Optimization applied to constrained optimization problems with binary solution structure. Due to its simple structure, the convergence status of the proposed algorithm can be monitored through the distribution of pheromone in the solution space, and the probability of solution improvement can be in some way controlled by the maintenance of pheromone. The successful implementations to the binary function optimization problem and the multidimensional knapsack problem indicate the robustness and practicability of the proposed algorithm.