70,078 research outputs found
Hybridization of multi-objective deterministic particle swarm with derivative-free local searches
The paper presents a multi-objective derivative-free and deterministic global/local hybrid algorithm for the efficient and effective solution of simulation-based design optimization (SBDO) problems. The objective is to show how the hybridization of two multi-objective derivative-free global and local algorithms achieves better performance than the separate use of the two algorithms in solving specific SBDO problems for hull-form design. The proposed method belongs to the class of memetic algorithms, where the global exploration capability of multi-objective deterministic particle swarm optimization is enriched by exploiting the local search accuracy of a derivative-free multi-objective line-search method. To the authors best knowledge, studies are still limited on memetic, multi-objective, deterministic, derivative-free, and evolutionary algorithms for an effective and efficient solution of SBDO for hull-form design. The proposed formulation manages global and local searches based on the hypervolume metric. The hybridization scheme uses two parameters to control the local search activation and the number of function calls used by the local algorithm. The most promising values of these parameters were identified using forty analytical tests representative of the SBDO problem of interest. The resulting hybrid algorithm was finally applied to two SBDO problems for hull-form design. For both analytical tests and SBDO problems, the hybrid method achieves better performance than its global and local counterparts
Design of optimal spacecraft-asteroid formations through a hybrid global optimization approach
Purpose â The purpose of this paper is to present a methodology and experimental results on using global optimization algorithms to determine the optimal orbit, based on the mission requirements, for a set of spacecraft flying in formation with an asteroid.
Design/methodology/approach â A behavioral-based hybrid global optimization approach is used to first characterize the solution space and find families of orbits that are a fixed distance away from the asteroid. The same optimization approach is then used to find the set of Pareto optimal solutions that minimize both the distance from the asteroid and the variation of the Sun-spacecraft-asteroid angle. Two sample missions to asteroids, representing constrained single and multi-objective problems, were selected to test the applicability of using an in-house hybrid stochastic-deterministic global optimization algorithm (Evolutionary Programming and Interval Computation (EPIC)) to find optimal orbits for a spacecraft flying in formation with an orbit. The Near Earth Asteroid 99942 Apophis (2004 MN4) is used as the case study due to a fly-by of Earth in 2029 leading to two potential impacts in 2036 or 2037. Two black-box optimization problems that model the orbital dynamics of the spacecraft were developed.
Findings â It was found for the two missions under test, that the optimized orbits fall into various distinct families, which can be used to design multi-spacecraft missions with similar orbital characteristics.
Research limitations/implications â The global optimization software, EPIC, was very effective at finding sets of orbits which met the required mission objectives and constraints for a formation of spacecraft in proximity of an asteroid. The hybridization of the stochastic search with the deterministic domain decomposition can greatly improve the intrinsic stochastic nature of the multi-agent search process without the excessive computational cost of a full grid search. The stability of the discovered families of formation orbit is subject to the gravity perturbation of the asteroid and to the solar pressure. Their control, therefore, requires further investigation.
Originality/value â This paper contributes to both the field of space mission design for close-proximity orbits and to the field of global optimization. In particular, suggests a common formulation for single and multi-objective problems and a robust and effective hybrid search method based on behaviorism. This approach provides an effective way to identify families of optimal formation orbits
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
The goal of decentralized optimization over a network is to optimize a global
objective formed by a sum of local (possibly nonsmooth) convex functions using
only local computation and communication. It arises in various application
domains, including distributed tracking and localization, multi-agent
co-ordination, estimation in sensor networks, and large-scale optimization in
machine learning. We develop and analyze distributed algorithms based on dual
averaging of subgradients, and we provide sharp bounds on their convergence
rates as a function of the network size and topology. Our method of analysis
allows for a clear separation between the convergence of the optimization
algorithm itself and the effects of communication constraints arising from the
network structure. In particular, we show that the number of iterations
required by our algorithm scales inversely in the spectral gap of the network.
The sharpness of this prediction is confirmed both by theoretical lower bounds
and simulations for various networks. Our approach includes both the cases of
deterministic optimization and communication, as well as problems with
stochastic optimization and/or communication.Comment: 40 pages, 4 figure
A Multi-Layer Line Search Method to Improve the Initialization of Optimization Algorithms (Preprint submitted to Optimization Online)
We introduce a novel metaheuristic methodology to improve the initialization of a given deterministic or stochastic optimization algorithm. Our objective is to improve the performance of the considered algorithm, called core optimization algorithm, by reducing its number of cost function evaluations, by increasing its success rate and by boosting the precision of its results. In our approach, the core optimization is considered as a suboptimization problem for a multi-layer line search method. The approach is presented and implemented for various particular core optimization algorithms: Steepest Descent, Heavy-Ball, Genetic Algorithm, Differential Evolution and Controlled Random Search. We validate our methodology by considering a set of low and high dimensional benchmark problems (i.e., problems of dimension between 2 and 1000). The results are compared to those obtained with the core optimization algorithms alone and with two additional global optimization methods (Direct Tabu Search and Continuous Greedy Randomized Adaptive Search). These latter also aim at improving the initial condition for the core algorithms. The numerical results seem to indicate that our approach improves the performances of the core optimization algorithms and allows to generate algorithms more efficient than the other optimization methods studied here. A Matlab optimization package called âGlobal Optimization Platformâ (GOP), implementing the algorithms presented here, has been developed and can be downloaded at: http://www.mat.ucm.es/momat/software.ht
A deterministic agent-based path optimization method by mimicking the spreading of ripples
Inspirations from nature have fundamentally contributed to the development of evolutionary computation (EC). This paper, by learning from the natural ripple-spreading phenomenon, proposes a novel ripple-spreading algorithm (RSA) for the path optimization problem (POP). In nature, a ripple spreads at a constant speed in all directions, and the node closest to the source will be the first to be reached. This very simple principle forms the foundation of the proposed RSA. In contrast to most deterministic top-down centralized path optimization methods, such as Dijkstra's algorithm, the RSA is a bottom-up decentralized agent-based simulation model. Moreover, it is distinguished from other agent-based algorithms, such as genetic algorithms and ant colony optimization, by being a deterministic method that can always guarantee the global optimal solution with very good scalability. Here, the RSA is specifically applied to four different POPs. The comparative simulation results presented clearly illustrate the advantages of the RSA in terms of effectiveness and efficiency. Thanks to the combination of both agent-based and deterministic features, the RSA opens new opportunities to attack some problems, such as calculating the exact complete Pareto front in multi-objective optimization and determining the kth shortest project time in project management, which are very difficult, if not impossible, for existing methods to resolve. The ripple-spreading optimization principle, aswell as the new distinguishing features and capacities of RSA, enriches the theoretical foundations of EC
Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO
The design of spacecraft trajectories for missions visiting multiple
celestial bodies is here framed as a multi-objective bilevel optimization
problem. A comparative study is performed to assess the performance of
different Beam Search algorithms at tackling the combinatorial problem of
finding the ideal sequence of bodies. Special focus is placed on the
development of a new hybridization between Beam Search and the Population-based
Ant Colony Optimization algorithm. An experimental evaluation shows all
algorithms achieving exceptional performance on a hard benchmark problem. It is
found that a properly tuned deterministic Beam Search always outperforms the
remaining variants. Beam P-ACO, however, demonstrates lower parameter
sensitivity, while offering superior worst-case performance. Being an anytime
algorithm, it is then found to be the preferable choice for certain practical
applications.Comment: Code available at https://github.com/lfsimoes/beam_paco__gtoc
- âŠ