Ant Colony Optimization for Satellite Customer Assignment
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.
KeywordsTravel Salesman Problem Combinatorial Optimization Problem Pheromone Trail Operational Research Society Generalize Assignment Problem
Unable to display preview. Download preview PDF.
- 1.Bonabeau, E., Dorigo, M., Theraulez, G.: Swarm Intelligence: From Natural to Artificial Intellience. Oxford University Press, New York (1999)Google Scholar
- 6.Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics B26, 29–41 (1996)Google Scholar
- 7.Dorigo, M., Stutzle, T.: The ant colony optimization metaheuristic: algorithms, applications, and advances. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 251–258. Kluwer Academic Publishers, Norwell (2002)Google Scholar
- 10.Montgomery, D.C., Johnson, L.A.: Operations Research in Production Planning Scheduling and Inventory Control. John Wiley & Sons, Chichester (1974)Google Scholar
- 13.Stützle, T.: MAX-MIN Ant system for the quadratic assignment problem. Technical Report AIDA-97-4, FG Intellektik, TU Darmstadt, Germany (1997)Google Scholar