~enricoschumann/neighbours

Neighbourhood functions for local-search algorithms
Prepare version 0.1-3
Add function 'next_subset'
Store (and later try to restore) only writable settings

refs

master
browse  log 
v0.1-3_CRAN
browse  .tar.gz 

clone

read-only
https://git.sr.ht/~enricoschumann/neighbours
read/write
git@git.sr.ht:~enricoschumann/neighbours

You can also use your local clone with git send-email.

#neighbours

Neighbourhood functions are key components of local-search algorithms such as Simulated Annealing or Threshold Accepting. These functions take a solution and return a slightly-modified copy of it, i.e. a neighbour. The package provides a single function, neighbourfun(), that produce a neighbourhood function, based on various parameters such as minimum or maximum values. Currently supported are numeric and logical solutions. The algorithms were originally created for portfolio-optimization models, but can also be used for other models.

[More]

#Installing the package

The latest released version is available from http://enricoschumann.net. In an R session, just type:

install.packages('neighbours,
                 repos = c('http://enricoschumann.net/R', getOption('repos')))