## Search

Now showing items 1-10 of 12

#### An evolutionary discretized Lambert approach for optimal long-range rendezvous considering impulse limit

(2019-09-18)

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

(2019-07-01)

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

(2019-07)

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

(2019)

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 ...

#### Bayesian inference for algorithm ranking analysis

(2018-08-30)

The statistical assessment of the empirical comparison of algorithms is an essential step in heuristic optimization. Classically, researchers have relied on the use of statistical tests. However, recently, concerns about ...

#### Distance-based exponential probability models on constrained combinatorial optimization problems

(2018-08-30)

Estimation of distribution algorithms have already demonstrated their utility when solving a broad range of combinatorial problems. However, there is still room for methodological improvements when approaching constrained ...

#### Are the artificially generated instances uniform in terms of difficulty?

(2018-06)

In the field of evolutionary computation, it is usual to generate artificial benchmarks of instances that are used as a test-bed to determine the performance of the algorithms at hand. In this context, a recent work on ...

#### perm mateda: A matlab toolbox of estimation of distribution algorithms for permutation-based combinatorial optimization problems

(2018)

Permutation problems are combinatorial optimization problems whose solutions are naturally codified as permutations. Due to their complexity, motivated principally by the factorial cardinality of the search space of ...

#### Spacecraft Trajectory Optimization: A review of Models, Objectives, Approaches and Solutions

(2018)

This article is a survey paper on solving spacecraft trajectory optimization problems. The solving process is decomposed into four key steps of mathematical modeling of the problem, defining the objective functions, ...

#### Multi-objectivising Combinatorial Optimisation Problems by means of Elementary Landscape Decompositions

(2017-12)

In the last decade, many works in combinatorial optimisation have shown that, due to the advances in multi-objective optimisation, the algorithms from this field could be used for solving single-objective problems as well. ...