Skip to main content

Ant Colony Optimization for Satellite Customer Assignment

  • Conference paper
  • 430 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4412))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bonabeau, E., Dorigo, M., Theraulez, G.: Swarm Intelligence: From Natural to Artificial Intellience. Oxford University Press, New York (1999)

    Google Scholar 

  2. Bullnheimer, B., Hartl, R., Strauss, C.: An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research 89, 319–328 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Cattrysse, D., Van Wassenhove, L.N.: A survey of algorithms for the generalized assignment problem. European Journal of Operational Research 60, 260–272 (1992)

    Article  MATH  Google Scholar 

  4. Dell’Amico, M., Martello, S.: Open shop, satellite communication and a theorem by Egervary (1931). Operations Research Letters 18, 209–211 (1996)

    Article  MathSciNet  Google Scholar 

  5. Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant algorithms for discrete optimization. Artificial Life 5, 137–172 (1999)

    Article  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 

  8. Lee, H., Ahn, D.H., Kim, S.: Optimal routing in non-geostationary satellite ATM networks with intersatellite link capacity constraints. Journal of the Operational Research Society 54, 401–409 (2003)

    Article  MATH  Google Scholar 

  9. Levine, J., Ducatelle, F.: Ant colony optimization and local search for bin packing and cutting stock problems. Journal of the Operational Research Society 55, 705–716 (2004)

    Article  MATH  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 

  11. Prins, C.: An overview of scheduling problems arising in satellite communications. Journal of the Operational Research Society 45, 611–623 (1994)

    Article  MATH  Google Scholar 

  12. Scott, C.H., Skelton, O.G., Rolland, E.: Tactical and strategic models for satellite customer assignment. Journal of the Operational Research Society 51, 61–71 (2000)

    Article  MATH  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 

  14. Tarasewich, P., McMullen, P.R.: Swarm intelligence: Power in numbers. Communications of the ACM 45, 62–67 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Frank Stajano Hyoung Joong Kim Jong-Suk Chae Seong-Dong Kim

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Kim, S.S., Kim, H.J., Mani, V., Kim, C.H. (2007). Ant Colony Optimization for Satellite Customer Assignment. In: Stajano, F., Kim, H.J., Chae, JS., Kim, SD. (eds) Ubiquitous Convergence Technology. ICUCT 2006. Lecture Notes in Computer Science, vol 4412. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71789-8_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71789-8_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71788-1

  • Online ISBN: 978-3-540-71789-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics