Abstract
A new population-oriented simulated annealing technique is introduced here as an efficient global search tool for solving optimisation problems. Unlike the conventional simulated annealing or its hybrid algorithms, each individual in the population can intelligently plan its own annealing schedule in an adaptive fashion to the given problem at hand. This not only enhances the search speed, but also yields a solution near the global optimum.
| Original language | English |
|---|---|
| Pages (from-to) | 312-313 |
| Number of pages | 2 |
| Journal | Electronics Letters |
| Volume | 34 |
| Issue number | 3 |
| DOIs | |
| State | Published - 5 Feb 1998 |