Research Article
Evolutionary Optimization of Multirendezvous Impulsive Trajectories
Algorithm 1
Partially Matched Crossover (PMX) algorithm.
procedure PMX ⊳ Input: parents | choose randomly a, b so that | | | for all do | ⊳ Proposal | whiledo | find so that map into | ⊳New proposal | end while | ⊳ Accept the proposal | end for | return ⊳Output: child | end procedure |
|