Analysis of Some Global Optimization Algorithms for Space Trajectory Design

被引:72
作者
Vasile, M. [1 ]
Minisci, E. [1 ]
Locatelli, M. [2 ]
机构
[1] Univ Glasgow, Glasgow G12 8QQ, Lanark, Scotland
[2] Univ Parma, Dipartimento Ingn Informat, I-43124 Parma, Italy
关键词
Evolutionary algorithms - Space flight - Ability testing - Global optimization;
D O I
10.2514/1.45742
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
This paper analyzes the performance of some global search algorithms on a number of space trajectory design problems. A rigorous testing procedure is introduced to measure the ability of an algorithm to identify the set of epsilon-optimal solutions. From the analysis of the test results, a novel algorithm is derived. The development of the novel algorithm starts from the redefinition of some evolutionary heuristics in the form of a discrete dynamical system. The convergence properties of this discrete dynamical system are used to derive a hybrid evolutionary algorithm that displays very good performance on the particular class of problems presented in this paper.
引用
收藏
页码:334 / 344
页数:11
相关论文
共 24 条
[21]  
Rudolph G, 1996, P IEEE INT C EV COMP
[22]   Design of Earth-Mars transfer trajectories using evolutionary-branching technique [J].
Vasile, M ;
Summerer, L ;
De Pascale, P .
ACTA ASTRONAUTICA, 2005, 56 (08) :705-720
[23]  
Vasile M. M., 2006, J SPACECRAFT ROCKETS, V43
[24]   Global optimization by basin-hopping and the lowest energy structures of Lennard-Jones clusters containing up to 110 atoms [J].
Wales, DJ ;
Doye, JPK .
JOURNAL OF PHYSICAL CHEMISTRY A, 1997, 101 (28) :5111-5116