title: Predatory search algorithm with restriction of solution distance.
abstract: A variety of methods and algorithms have been developed to solve NP-Hard problems in recent decades. In this paper, we are concerned with a relatively new algorithm based on animal behavioral adaptability and evolutionary computation, namely predatory search. When first introduced, the algorithm was implemented with restrictions based on solution cost as a simplification of distance adopted by search-intensive predators. Our research concentrates on exploring the possibility of using distance to restrict search area. Based on the research of Boese et al. (1994), we propose a type of predatory search algorithm restricted by solution distance (particularly bond distance), and compare it with the original algorithm based on three benchmark traveling salesman problems. The results indicate that both algorithms are suitable for solving the traveling salesman problems, while our proposed algorithm either outperforms or at least matches its predecessor with respect to both the running time and the quality of solutions. In addition, further experiments suggest that there exists a certain relationship between the two algorithms.
authors.affiliation: Institute of Systems Engineering, Northeastern University, Shenyang 110004, PR China. lch_24@hotmail.com
authors.forename: Chong
authors.initials: C
authors.lastname: Liu
authors.forename: Dingwei
authors.initials: D
authors.lastname: Wang
mesh_terms: D000465:Algorithms; D000818:Animals; D001185:Artificial Intelligence