A connectionist machine for genetic hillclimbing
A connectionist machine for genetic hillclimbing
Pure adaptive search in global optimization
Mathematical Programming: Series A and B
Numerical Optimization of Computer Models
Numerical Optimization of Computer Models
Journal of Global Optimization
Global Optimization on Funneling Landscapes
Journal of Global Optimization
Packing equal circles in a square: a deterministic global optimization approach
Discrete Applied Mathematics
A linear programming algorithm to test for jamming in hard-sphere packings
Journal of Computational Physics
On the multilevel structure of global optimization problems
Computational Optimization and Applications
A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
SIAM Journal on Optimization
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
New Approaches to Circle Packing in a Square: With Program Codes (Springer Optimization and Its Applications)
Solving the problem of packing equal and unequal circles in a circular container
Journal of Global Optimization
Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special Issue on scalability of evolutionary algorithms and other metaheuristics for large-scale continuous optimization problems
An Inflationary Differential Evolution Algorithm for Space Trajectory Optimization
IEEE Transactions on Evolutionary Computation
Efficiently packing unequal disks in a circle
Operations Research Letters
Global Optimization: Theory, Algorithms, and Applications
Global Optimization: Theory, Algorithms, and Applications
Hi-index | 0.01 |
In this paper we analyze the behavior of a quite standard Differential Evolution (DE) algorithm applied to the objective function transformed by means of local searches. First some surprising results are presented which concern the application of this method to standard test functions. Later we introduce an application to disk- and to sphere-packing problems, two well known and particularly hard global optimization problems. For these problems some more refined variations of the basic method are necessary in order to take at least partially into considerations the many symmetries those problems possess. Coupling these techniques with DE and local optimization resulted in a new method which, when tested on moderately sized packing problems, was capable of confirming known putative optima for the problem of packing disks, and of discovering quite a significant number of new putative optima for the problem of packing spheres.