Global optimization
Lipschitzian optimization without the Lipschitz constant
Journal of Optimization Theory and Applications
Global optimization requires global information
Journal of Optimization Theory and Applications
Journal of Global Optimization
Global Optimization by Multilevel Coordinate Search
Journal of Global Optimization
A Taxonomy of Global Optimization Methods Based on Response Surfaces
Journal of Global Optimization
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Maximin Latin Hypercube Designs in Two Dimensions
Operations Research
Comparison among five evolutionary-based optimization algorithms
Advanced Engineering Informatics
Approximate Solutions in Space Mission Design
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
An agent-based memetic algorithm (AMA) for nonlinear optimization with equality constraints
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Memetic Strategies for Global Trajectory Optimisation
ISICA '09 Proceedings of the 4th International Symposium on Advances in Computation and Intelligence
A memetic multi-agent collaborative search for space trajectory optimisation
International Journal of Bio-Inspired Computation
HCS: a new local search strategy for memetic multiobjective evolutionary algorithms
IEEE Transactions on Evolutionary Computation
A global optimization method for the design of space trajectories
Computational Optimization and Applications
Applications of agent-based models for optimization problems: A literature review
Expert Systems with Applications: An International Journal
Search for a grand tour of the jupiter galilean moons
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Multi Agent Collaborative Search based on Tchebycheff decomposition
Computational Optimization and Applications
Hi-index | 0.00 |
In this paper we consider a global optimization method for space trajectory design problems. The method, which actually aims at finding not only the global minimizer but a whole set of low-lying local minimizers (corresponding to a set of different design options), is based on a domain decomposition technique where each subdomain is evaluated through a procedure based on the evolution of a population of agents. The method is applied to two space trajectory design problems and compared with existing deterministic and stochastic global optimization methods.