Metaheuristic Applications and Their Solutions Quality

Abstract

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 nature. Heuristic researchers often make claims about the relative performance of metaheuristics without considering their stochastic nature and consequently their claims are not reliable. This paper discusses how to make an effective application of these metaheuristics to any NP-hard problem and to assess their solution quality in an acceptable way.