Ant colony optimization for satellite customer assignment

Authors:
S. S. Kim;H. J. Kim;V. Mani;C. H. Kim
Affiliations:
Department of Industrial Engineering, Kangwon National University, Chunchon, Korea;CIST, Korea University, Seoul, Korea;Department of Aerospace Engineering, Indian Institute of Science, Bangalore, India;Ainsolution Co., Seoul, Korea
Venue:
ICUCT'06 Proceedings of the 1st international conference on Ubiquitous convergence technology
Year:
2006

Citing 5
Cited 0

Swarm intelligence: from natural to artificial systems

Swarm intelligence: from natural to artificial systems
Ant algorithms for discrete optimization

Artificial Life
Swarm intelligence: power in numbers

Communications of the ACM - Evolving data mining into solutions for insights
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Open shop, satellite communication and a theorem by Egerváry (1931)

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the meta-heuristic method of ant colony optimization to the problem of assigning customers to satellite channels. It is shown in an earlier study that finding an optimal allocation of customers to satellite channels is a difficult combinatorial optimization problem and is NP-complete. Hence, we propose an ant colony system (ACS) with strategies of ranking and Max-Min ant system (MMAS) for an effective search of the best/optimal assignment of customers to satellite channels under a dynamic environment. Our simulation results show that this methodology is successful in finding an assignment of customers to satellite channels. Three strategies, ACS with only ranking, ACS with only MMAS, and ACS with both ranking and MMAS are considered. A comparison of these strategies are presented to show the performance of each strategy.