Influence of parameters on the performance of a MOACO algorithm for solving the bi-criteria military path-finding problem.
Antonio Miguel MoraJuan Julián Merelo GuervósPedro Ángel Castillo ValdiviesoJuan Luis Jiménez LaredoCarlos CottaPublished in: IEEE Congress on Evolutionary Computation (2008)
Keyphrases
- path finding
- bicriteria
- cost function
- dynamic programming
- path planning
- learning algorithm
- np hard
- optimal solution
- computational complexity
- theoretical analysis
- knapsack problem
- linear programming
- integer linear programming
- hill climbing
- ant colony optimization
- np complete
- search space
- objective function
- reinforcement learning