 |
 |
|
|
| HAL: hal-00137320, version 2 |
| Detailed view |  Export this paper |
 |
| Available versions: | v1 (2007-03-22) | v2 (2007-06-06) |
|
|
|
|
| When Nearer is Better |
|
|
| Maurice Clerc 1 |
|
|
| (2007-05-18) |
|
|
|
| We define a numerical "nearer is better" truth value that can be computed or estimated for all functions on a given definition space. The set of all these functions can be then partitioned into three subsets: the ones for which this truth value is positive, the ones for which it is negative, and the ones for which is is null. We show that most of classical functions belong to the first subset, as the second one is useful to design problems that are deceptive for most of optimisation algorithms. Also on these subset the No Free Lunch Theorem does not hold. Therefore it may exist a best algorithm, and we suggest a way to design it for the first one. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | retraité/retired (RETIRED) |
|
|
|
retraité |
|
|
|
|
|
|
|
|
|
| Subject | : | Mathematics/Optimization and Control |
|
|
| optimisation – optimization – best algorithm – deceptive function – particle swarm |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00137320, version 2 | |
| http://hal.archives-ouvertes.fr/hal-00137320 | |
| oai:hal.archives-ouvertes.fr:hal-00137320 | |
| From: Maurice Clerc | |
| Submitted on: Wednesday, 6 June 2007 09:16:23 | |
| Updated on: Wednesday, 6 June 2007 11:10:28 | |
