Springer alerts me about the availability of the paper hCHAC-4, an ACO Algorithm for Solving the Four-Criteria Military Path-finding Problem, which was published some time ago at the NICSO 2007 conference. Here’s the 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.
If SpringerLink is not available at your institution and you are interested in a copy, please drop us a line. This article is further ahead the research line than the previous article, which used two objectives that were an aggregate of several sub-objectives. Results are better in this case, and all sub-objectives can be pursued at the same time.
GeNeura Team 