Informatica Logo

INFORMATICA
International Journal

Main Page
Editorial Board
Abstracting/Indexing
Instructions to Authors
Subscription Information


Contents
Author Index
Papers in Production

INFORMATICA, 2015, Vol. 26, No. 4, 649-662
© Institute of Mathematics and Informatics,
DOI: http://dx.doi.org/10.15388/Informatica.2015.69

ISSN 0868-4952

On Benchmarking Stochastic Global Optimization Algorithms

Eligius M.T. HENDRIX, Algirdas LANCINSKAS1

Computer Architecture, Universidad de Málaga, Spain Institute of Mathematics and Informatics, Vilnius University, Lithuania E-mail: eligius@uma.es, algirdas.lancinskas@mii.vu.lt

Abstract

A multitude of heuristic stochastic optimization algorithms have been described in literature to obtain good solutions of the box-constrained global optimization problem often with a limit on the number of used function evaluations. In the larger question of which algorithms behave well on which type of instances, our focus is here on the benchmarking of the behavior of algorithms by applying experiments on test instances. We argue that a good minimum performance benchmark is due to pure random search; i.e. algorithms should do better. We introduce the concept of the cumulative distribution function of the record value as a measure with the benchmark of pure random search and the idea of algorithms being dominated by others. The concepts are illustrated using frequently used algorithms.

Keywords:

stochastic global optimization, benchmark, black-box, meta-heuristic


1Corresponding author.
To preview Lithuanian abstract see full article text

PDFTo preview full article text in PDF format click here

Get Free ReaderYou could obtain free Acrobat Reader from Adobe


TopTop Copyright © INFORMATICA, Vilnius University Institute of Mathematics and Informatics, 2010