![](/assets/images/picto-drapeau-france-3a76576a5d60a512053b4612ab58dae5.png)
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,...
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!
![](/assets/images/logo-eti-286623ed91fa802ce039246e516e5852.png)
The Ultimate Scientific and Technical Reference
This article is included in
Systèmes aéronautiques et spatiaux
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
Resolution method
Bibliography
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!
![](/assets/images/logo-eti-286623ed91fa802ce039246e516e5852.png)
The Ultimate Scientific and Technical Reference