Now showing items 1-4 of 4
An evolutionary discretized Lambert approach for optimal long-range rendezvous considering impulse limit
In this paper, an approach is presented for finding the optimal long-range space rendezvous in terms of fuel and time, considering limited impulse. In this approach , the Lambert problem is expanded towards a discretized ...
Optimal multi-impulse space rendezvous considering limited impulse using a discretized Lambert problem combined with evolutionary algorithms
In this paper, a direct approach is presented to tackle the multi-impulse rendezvous problem considering the impulse limit. Particularly, the standard Lambert problem is extended toward several consequential orbit transfers ...
Approaching the Quadratic Assignment Problem with Kernels of Mallows Models under the Hamming Distance
The Quadratic Assignment Problem (QAP) is a specially challenging permutation-based np-hard combinatorial optimization problem, since instances of size $n>40$ are seldom solved using exact methods. In this sense, many ...
Hybrid Heuristics for the Linear Ordering Problem
The linear ordering problem (LOP) is one of the classical NP-Hard combinatorial optimization problems. Motivated by the difficulty of solving it up to optimality, in recent decades a great number of heuristic and meta-heuristic ...