Skip to main content

hCHAC-4, an ACO Algorithm for Solving the Four-Criteria Military Path-finding Problem

  • Chapter
Nature Inspired Cooperative Strategies for Optimization (NICSO 2007)

Abstract

Algorithms for decision support in the battlefield have to take into account separately all factors with an impact of success: speed, visibility, and consumption of material and human resources. It is usual to combine several objectives, since military commanders give more importance to some factors than others, but it is interesting to also explore and optimize all objectives at the same time, to have a wider range of possible solutions to choose from, and explore more efficiently the space of all possible paths. In this paper we introduce hCHAC-4, the four-objective version of the hCHAC bi-objective ant colony optimization algorithm, and compare results obtained with them and also with some other approaches (extreme and mono-objective ones). It is concluded that this new version of the algorithm is more robust, and covers more efficiently the Pareto front of all possible solutions, so it can be consider as a better tool for military decision support.

Supported by projects TIC2003-09481-C04, TIN2007-68083-C02-01, and P06-TIC-02025.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barán, B., Schaerer, M.: A multiobjective ant colony system for vehicle routing problem with time windows. In: IASTED International Multi-Conference on Applied Informatics, no. 21 in IASTED IMCAI, pp. 97–102 (2003)

    Google Scholar 

  2. Coello, C.A.C., Veldhuizen, D.A.V., Lamont, G.B.: Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer Academic Publishers (2002)

    Google Scholar 

  3. Dorigo, M., Caro, G.D.: The ant colony optimization meta-heuristic. In: D. Corne, M. Dorigo, F. Glover (eds.) New Ideas in Optimization, pp. 11–32. McGraw-Hill (1999)

    Google Scholar 

  4. Dorigo, M., Sttzle, T.: The ant colony optimization metaheuristic: Algorithms, applications, and advances. In: G.K.F. Glover (ed.) Handbook of Metaheuristics, pp. 251–285. Kluwer (2002)

    Google Scholar 

  5. Iredi, S., Merkle, D., Middendorf, M.: Bi-criterion optimization with multi colony ant algorithms. In: E. Zitzler, K. Deb, L. Thiele, C.A.C. Coello, D. Corne (eds.) Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization (EMO 2001), LNCS, vol. 1993, pp. 359–372. Springer, Berlin (2001)

    Google Scholar 

  6. Mora, A.M., Merelo, J.J., Millán, C., Torrecillas, J., Laredo, J.L.J., Castillo, P.A.: Comparing aco algorithms for solving the bi-criteria military pathfinding problem. In: F.A. et al. (ed.) ECAL 2007. Advances in Artificial Life, no. 4648 in LNAI, pp. 665–674. Springer (2007)

    Google Scholar 

  7. Mora, A.M., Merelo, J.J., Millán, C., Torrecillas, J., Laredo, J.L.J., Castillo, P.A.: Enhancing a MOACO for solving the bi-criteria pathfinding problem for a military unit in a realistic battlefield. In: M. Giacobini (ed.) EvoWorkshops 2007. Applications of Evolutionary Computing, no. 4448 in LNCS, pp. 712–721. Springer (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Mora, A.M. et al. (2008). hCHAC-4, an ACO Algorithm for Solving the Four-Criteria Military Path-finding Problem. In: Krasnogor, N., Nicosia, G., Pavone, M., Pelta, D. (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2007). Studies in Computational Intelligence, vol 129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78987-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78987-1_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78986-4

  • Online ISBN: 978-3-540-78987-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics