3. Resolution method

For the planning of several successive missions with a few dozen pieces of candidate debris, the combinatorial problem can't be solved exactly within a reasonable computing time. We have to make do with approximate solutions obtained by metaheuristics. This section presents a solution procedure based on the simulated annealing method.

3.1 Simulated annealing

Simulated Annealing (SA) is an optimization algorithm inspired by the metallurgical process of annealing a metal. . It is very effective on difficult combinatorial problems, such as the travelling salesman problem,...

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!

The Ultimate Scientific and Technical Reference

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors

+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year

From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

This article is included in

Aerospace systems

This offer includes:

Knowledge Base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

Practical Path

Operational and didactic, to guarantee the acquisition of transversal skills

Doc & Quiz

Interactive articles with quizzes, for constructive reading

Subscribe now!

Ongoing reading
Resolution method

Previous
page Transfer problem

Application example

Bibliography

(1) - BETTS (J.T.) - Practical Methods for Optimal Control and Estimation Using Nonlinear Programming. - SIAM (2010).
(2) - CERF (M.) - Techniques d'optimisation 2. - EDP Sciences (2023).
...