Advertisement

A Hybrid Search Algorithm of Ant Colony Optimization and Genetic Algorithm Applied to Weapon-Target Assignment Problems

  • Zne-Jung Lee
  • Wen-Li Lee
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2690)

Abstract

Weapon-Target Assignment (WTA) problems are to find a proper assignment of weapons to targets with the objective of minimizing the expected damage of own-force asset. In this paper, a novel hybrid algorithm of ant colony optimization (ACO) and genetic algorithm is proposed to solve WTA problems. The proposed algorithm is to enhance the search performance of genetic algorithms by embedded ACO so as to have locally optimal offspring. This algorithm is successfully applied to WTA problems. From our simulations for those tested problems, the proposed algorithm has the best performance when compared to other existing search algorithms.

Keywords

Genetic Algorithm Local Search Memetic Algorithm Search Performance Quadratic Assignment Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Lloyd, S.P., Witsenhausen, H.S.: IEEE Summer Simulation Conference. In: Weapon allocation is NP-Complete, Reno, Nevada (1986)Google Scholar
  2. 2.
    William, M., Preston, F.L.: A Suite of Weapon Assignment Algorithms for a SDI Mid-Course battle Manager. AT&T Bell Laboratories (1990)Google Scholar
  3. 3.
    Hammer, P.L., Hansen, P., Simeone, B.: Mathematical Programming. Roof duality, complementation and persistency in quadratic 0-1 optimization 28, 121–155 (1984)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Ibarraki, T., Katoh, N.: Resource allocation Problems. The MIT Press, Cambridge (1988)Google Scholar
  5. 5.
    Dorigo, M., Caro, G.D.: Proceedings of the 1999 Congress on Evolutionary Computation. Ant colony optimization: A new meta-heuristic 2, 1470–1477 (1999)Google Scholar
  6. 6.
    Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence From Natural to Artificial Systems. Oxford University Press, Oxford (1999)zbMATHGoogle Scholar
  7. 7.
    Lee, Z.-J., Su, S.-F., Lee, C.-Y.: Journal of the Chinese Institute of Engineers. A Genetic Algorithm with Domain Knowledge for Weapon-Target Assignment Problems 25(3), 287–295 (2002)Google Scholar
  8. 8.
    Lee, Z.-J., Su, S.-F., Lee, C.-Y.: Applied Soft Computing. An Immunity Based Ant Colony Optimization Algorithm for Solving Weapon-Target Assignment Problem 2, 39–47 (2002)Google Scholar
  9. 9.
    Reeves, C.R.: Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications, Oxford (1993)zbMATHGoogle Scholar
  10. 10.
    Merz, P., Freisleben, B.: A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem. In: Proceedings of the 1999 Congress on Evolutionary Computation, vol. 3, pp. 2063–2070 (1999)Google Scholar
  11. 11.
    Maniezzo, V., Colorni, A.: IEEE Transactions on Knowledge and Data Engineering. The ant system applied to the quadratic assignment problem 11, 769–778 (1999)Google Scholar
  12. 12.
    Stűtzle, T., Hoos, H.: MAX-MIN ant system and local search for the traveling salesman problem. In: IEEE International Conference on Evolutionary Computation, pp. 299–314 (1997)Google Scholar
  13. 13.
    Pepyne, D.L., et al.: A decision aid for theater missile defense. In: Proceedings of 1997 IEEE International Conference on Evolutionary Computation, ICEC 1997 (1997)Google Scholar
  14. 14.
    Bjorndal, A.M.H., et al.: European Journal of Operational Research. Some thoughts on combinatorial optimization, 253–270 (1995)Google Scholar
  15. 15.
    Gen, M., Cheng, R.: Genetic Algorithms and Engineering Design. John Wiley & Sons, Inc. Chichester (1997)Google Scholar
  16. 16.
    Aarts, E.H.L., Lenstra, J.K.: Local Search in Combinatorial Optimization. John Wiley & Sons, Inc. Chichester (1997)zbMATHGoogle Scholar
  17. 17.
    Merz, P., Freisleben, B.: IEEE Trans. On Evolutionary Computation. Fitness landscape analysis and memetic algorithms for quadratic assignment problem 4(4), 337–352 (2000)Google Scholar
  18. 18.
    Burke, E.K., Smith, A.J.: IEEE Trans. On Power Systems. Hybrid evolutionary techniques for the maintenance scheduling problem 15, 122–128 (2000)Google Scholar
  19. 19.
    Miller, J., Potter, W., Gandham, R., Lapena, C.: IEEE Trans. On Systems, Man and Cybernetics. An evaluation of local improvement operators for genetic algorithms 23(5), 1340–1341 (1993)Google Scholar
  20. 20.
    Aarts, E.H.L., Korst, J.: Simulated Annealing and Boltzmann Machines. John Wiley & Sons, Inc. Chichester (1989)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Zne-Jung Lee
    • 1
  • Wen-Li Lee
    • 1
  1. 1.Kang-Ning Junior College of NursingTaipeiTaiwan, R.O.C.

Personalised recommendations