Please use this identifier to cite or link to this item:
On the Need for Random Baseline Comparisons in Metaheuristic Search
|Title:||On the Need for Random Baseline Comparisons in Metaheuristic Search|
|Keywords:||Intelligent Decision Support for Logistics and Supply Chain Management|
Metaheuristic search, Optimization, Random search
|Issue Date:||03 Jan 2018|
|Abstract:||A wide variety of organizations now regularly rely on established metaheuristic search algorithms in order to find solutions to otherwise intractable optimization problems. Unfortunately, neither the developers of these algorithms nor the organizations that rely on them typically assess the algorithms’ performance against a baseline random search strategy, opting instead to compare a specific algorithm’s performance against that of other metaheuristic search algorithms. This paper reveals the folly of such behavior, and shows by means of an optimization case study that simple random or nearly random search algorithms can, in certain circumstances, substantially outperform several of the most widely used metaheuristic search algorithms in finding solutions to optimization problems. The implications of the observed results for both organizations and researchers are presented and discussed.|
|Rights:||Attribution-NonCommercial-NoDerivatives 4.0 International|
|Appears in Collections:||Intelligent Decision Support for Logistics and Supply Chain Management|
Please contact email@example.com if you need this content in an alternative format.
Items in ScholarSpace are protected by copyright, with all rights reserved, unless otherwise indicated.