Genetic algorithm (GA) is an artificial intelligence search method that uses the process of
evolution and natural selection theory and is under the umbrella of evolutionary computing …

Tabu search is a “higher level” heuristic procedure for solving optimization problems,
designed to guide other methods (or their component processes) to escape the trap of local …

Bat algorithm is a population metaheuristic proposed in 2010 which is based on the
echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat …

Abstract Grey Wolf Optimizer (GWO) is a recently developed population-based metaheuristic
algorithm which imitates the behaviour of grey wolves for survival. Initially, GWO was …

In this paper, we present an improved and discrete version of the Cuckoo Search (CS)
algorithm to solve the famous traveling salesman problem (TSP), an NP-hard combinatorial …

Faced with the challenge of solving hard optimization problems that abound in the real
world, classical methods often encounter great difficulty. Vitally important applications in …

This is the second half of a two part series devoted to the tabu search metastrategy for
optimization problems. Part I introduced the fundamental ideas of tabu search as an …

Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …

Now in Its Fourth Edition: Your Guide to Successful Facility Design Overcome design and
planning problems using the fourth edition of Facilities Design. Dedicated to the proper …

Hybrid metaheuristics have received considerable interest these recent years in the field of
combinatorial optimization. A wide variety of hybrid approaches have been proposed in the …