Chapter

Handbook of Metaheuristics

Volume 146 of the series International Series in Operations Research & Management Science pp 625-640

Date:

Comparison of Metaheuristics

  • John SilberholzAffiliated withCenter for Scientific Computing and Mathematical Modeling, University of Maryland Email author 
  • , Bruce GoldenAffiliated withR.H. Smith School of Business, University of Maryland Email author 

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Metaheuristics are truly diverse in nature—under the overarching theme of performing operations to escape local optima, algorithms as different as ant colony optimization, tabu search, harmony search, and genetic algorithms have emerged. Due to the unique functionality of each type of metaheuristic, comparison of metaheuristics is in many ways more difficult than other algorithmic comparisons. In this chapter, we discuss techniques for meaningful comparison of metaheuristics. We discuss how to create and classify instances in a new testbed and how to make sure other researchers have access to the problems for future metaheuristic comparisons. Further, we discuss the disadvantages of large parameter sets and how to measure complicating parameter interactions in a metaheuristic’s parameter space. Last, we discuss how to compare metaheuristics in terms of both solution quality and runtime.