Performance and Limitations of Metaheuristics

Details

Serval ID
serval:BIB_61B04689AB5D
Type
A part of a book
Publication sub-type
Chapter: chapter ou part
Collection
Publications
Institution
Title
Performance and Limitations of Metaheuristics
Title of the book
An Introduction to Metaheuristics for Optimization
Author(s)
Chopard B., Tomassini M.
Publisher
Springer International Publishing
ISBN
9783319930725
9783319930732
ISSN
1619-7127
Publication state
Published
Issued date
2018
Peer-reviewed
Oui
Pages
191-203
Language
english
Abstract
In contrast with exact algorithms whose worst-case time complexity is known (see Chapter 1), metaheuristics do not provide that kind of bound. They can be very effective on a given instance of a problem and, at the same time, show long running times on another without finding a satisfactory solution. On the other hand, for example, the selection sort algorithm could spend different amount of time on an already sorted list, and on a list sorted in the opposite order, but we know that, on any list permutation, its time complexity function T(n) will be bounded by a seconddegree polynomial and the list will be sorted correctly.
Create date
20/02/2019 13:29
Last modification date
21/08/2019 5:16
Usage data