scholarly journals Optimization of Reconfigurable Satellite Constellations Using Simulated Annealing and Genetic Algorithm

Sensors ◽  
2019 ◽  
Vol 19 (4) ◽  
pp. 765 ◽  
Author(s):  
Sung Paek ◽  
Sangtae Kim ◽  
Olivier de Weck

Agile Earth observation can be achieved with responsiveness in satellite launches, sensor pointing, or orbit reconfiguration. This study presents a framework for designing reconfigurable satellite constellations capable of both regular Earth observation and disaster monitoring. These observation modes are termed global observation mode and regional observation mode, constituting a reconfigurable satellite constellation (ReCon). Systems engineering approaches are employed to formulate this multidisciplinary problem of co-optimizing satellite design and orbits. Two heuristic methods, simulated annealing (SA) and genetic algorithm (GA), are widely used for discrete combinatorial problems and therefore used in this study to benchmark against a gradient-based method. Point-based SA performed similar or slightly better than the gradient-based method, whereas population-based GA outperformed the other two. The resultant ReCon satellite design is physically feasible and offers performance-to-cost(mass) superior to static constellations. Ongoing research on observation scheduling and constellation management will extend the ReCon applications to radar imaging and radio occultation beyond visible wavelengths and nearby spectrums.

1995 ◽  
Vol 21 (1) ◽  
pp. 1-28 ◽  
Author(s):  
Samir W. Mahfoud ◽  
David E. Goldberg

2013 ◽  
Vol 651 ◽  
pp. 548-552
Author(s):  
Parinya Kaweegitbundit

This paper considers two stage hybrid flow shop (HFS) with identical parallel machine. The objectives is to determine makespan have been minimized. This paper presented memetic algorithm procedure to solve two stage HFS problems. To evaluated performance of propose method, the results have been compared with two meta-heuristic, genetic algorithm, simulated annealing. The experimental results show that propose method is more effective and efficient than genetic algorithm and simulated annealing to solve two stage HFS scheduling problems.


Author(s):  
Giridhar Reddy ◽  
Jonathan Cagan

Abstract A method for the design of truss structures which encourages lateral exploration, pushes away from violated spaces, models design intentions, and produces solutions with a wide variety of characteristics is introduced. An improved shape annealing algorithm for truss topology generation and optimization, based on the techniques of shape grammars and simulated annealing, implements the method. The algorithm features a shape grammar to model design intentions, an ability to incorporate geometric constraints to avoid obstacles, and a shape optimization method using only simulated annealing with more consistent convergence characteristics; no traditional gradient-based techniques are employed. The improved algorithm is illustrated on various structural examples generating a variety of solutions based on a simple grammar.


Sign in / Sign up

Export Citation Format

Share Document