Business Commons^™

Metaheuristic Applications And Their Solutions Quality, Dr. Zahid Hussain

International Conference on Information and Communication Technologies

Over the past few decades, a wide variety of classes of combinatorial problems (e.g. the assignment problem, the knapsack problem, the vehicle routing problem, etc.) have emerged - from such areas as management science, telecommunication, AI, VLSI design and many others. Many large combinatorial problems are NP-hard problems because of the combinatorial growth of their solution search space with the problem size. Such problems are commonly solved by some version of a prominent metaheuristic (e.g. Genetic Algorithms, Tabu Search, Simulated Annealing and etc.). These heuristics seek good but approximate solutions at a reasonable computational cost. These heuristics are of stochastic …