hCHAC: a family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem

DOI10.1016/j.cor.2011.11.015zbMath1348.90641OpenAlexW2159968262MaRDI QIDQ336313

P. A. Castillo, M. G. Arenas, Antonio M. Mora

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.11.015

zbMATH Keywords

multi-objective optimizationpath planninglogisticsant colony optimizationmilitary problemsmulti-objective ant colony optimizationpathfinding problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• TSPLIB
• CHAC
• MACS-VRPTW

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Optimization of transportation requirements in the deployment of military units
• A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP
• The traveling salesman. Computational solutions for RSP applications
• An efficient constraint handling method for genetic algorithms
• Shortest paths algorithms: Theory and experimental evaluation
• Optimal paths in graphs with stochastic or multidimensional weights
• On a routing problem
• CHAC, A MOACO algorithm for computation of bi-criteria military unit path in the battlefield: Presentation and first results
• Multiobjective A*
• The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances

This page was built for publication: hCHAC: a family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem