𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A combined multistart-annealing algorithm for continuous global optimization

✍ Scribed by Mauro Piccioni

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
441 KB
Volume
21
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A fast annealing evolutionary algorithm
A fast annealing evolutionary algorithm for global optimization
✍ Wensheng Cai; Xueguang Shao πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 136 KB

## Abstract By combining the aspect of population in genetic algorithms (GAs) and the simulated annealing algorithm (SAA), a novel algorithm, called fast annealing evolutionary algorithm (FAEA), is proposed. The algorithm is similar to the annealing evolutionary algorithm (AEA), and a very fast ann

An artificial beehive algorithm for cont
An artificial beehive algorithm for continuous optimization
✍ Mario A. MuΓ±oz; JesΓΊs A. LΓ³pez; Eduardo Caicedo πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 135 KB

This paper presents an artificial beehive algorithm for optimization in continuous search spaces based on a model aimed at individual bee behavior. The algorithm defines a set of behavioral rules for each agent to determine what kind of actions must be carried out. Also, the algorithm proposed inclu

A combined global and local search metho
A combined global and local search method to deal with constrained optimization for continuous tabu search
✍ Xi Chen; Jing Yang; Zhaohua Li; Daqing Tian; Zhijiang Shao πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 269 KB

## Abstract Heuristic methods, such as tabu search, are efficient for global optimizations. Most studies, however, have focused on constraint‐free optimizations. Penalty functions are commonly used to deal with constraints for global optimization algorithms in dealing with constraints. This is some