Detection of outliers in time series following the 
    Chen and Liu (1993) <DOI:10.2307/2290724> procedure. 
    Innovational outliers, additive outliers, level shifts, 
    temporary changes and seasonal level shifts are considered.

Basic infrastructure and some algorithms for the traveling
    salesperson problem (also traveling salesman problem; TSP).
    The package provides some simple algorithms and
    an interface to the Concorde TSP solver and its implementation of the
    Chained-Lin-Kernighan heuristic. The code for Concorde
    itself is not included in the package and has to be obtained separately.
    Hahsler and Hornik (2007) <doi:10.18637/jss.v023.i02>.

Prediction intervals for ARIMA and structural time series
    models using importance sampling approach with uninformative priors for model
    parameters, leading to more accurate coverage probabilities in frequentist
    sense. Instead of sampling the future observations and hidden states of the
    state space representation of the model, only model parameters are sampled,
    and the method is based solving the equations corresponding to the conditional
    coverage probability of the prediction intervals. This makes method relatively
    fast compared to for example MCMC methods, and standard errors of prediction
    limits can also be computed straightforwardly.

Instance feature calculation and evolutionary instance generation
    for the traveling salesman problem. Also contains code to "morph" two TSP
    instances into each other. And the possibility to conveniently run a couple
    of solvers on TSP instances.

Functions for defining and conducting a time series prediction process including pre(post)processing, decomposition, modelling, prediction and accuracy assessment. The generated models and its yielded prediction errors can be used for benchmarking other time series prediction methods and for creating a demand for the refinement of such methods. For this purpose, benchmark data from prediction competitions may be used.