Computational Comparison of Metaheuristics

John Silberholz (), Bruce Golden (), Swati Gupta () and Xingyin Wang ()
Additional contact information
John Silberholz: University of Michigan
Bruce Golden: University of Maryland
Swati Gupta: Simons Institute for the Theory of Computing
Xingyin Wang: Singapore University of Technology and Design

Chapter Chapter 18 in Handbook of Metaheuristics, 2019, pp 581-604 from Springer

Abstract: 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, the computational comparison of metaheuristics is in many ways more difficult than other algorithmic comparisons. In this chapter, we discuss techniques for the meaningful computational 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 these test instances for future metaheuristic comparisons. In addition, we discuss the disadvantages of large parameter sets and how to measure complicated parameter interactions in a metaheuristic’s parameter space. Finally, we explain how to compare metaheuristics in terms of both solution quality and runtime and how to compare parallel metaheuristics.

Keywords: Parallel Metaheuristics; Comparable Solution Quality; Problem Instances; Best-known Solution; Basic Combinatorial Operations (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-319-91086-4_18

Ordering information: This item can be ordered from
http://www.springer.com/9783319910864

DOI: 10.1007/978-3-319-91086-4_18

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().