Problem solving in combinatorial optimization based on the algorithmic model of attack behavior of locust swarm

Abstract

The attack behavior of locust swarm has inspired the recently developed computer algorithmic model of locust swarm optimizer (LS) within the swarm artificial intelligence methods. Some NP-hard problems of combinatorial optimization that LS may solve are the following: the traveling salesman problem, the knapsack problem, routing in telecommunication networks, and cellular robotic systems. General models of these combinatorial optimization problems which can be solved with locust swarm optimizer technique are proposed in the present work.