neighbours: Neighbourhood Functions for Local-Search Algorithms

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 function neighbourfun() that constructs such neighbourhood functions, based on parameters such as admissible ranges for elements in a solution. Supported are numeric and logical solutions. The algorithms were originally created for portfolio-optimisation applications, but can be used for other models as well. Several recipes for neighbour computations are taken from "Numerical Methods and Optimization in Finance" by M. Gilli, D. Maringer and E. Schumann (2019, ISBN:978-0128150658).

Version: 0.1-2
Suggests: NMOF, quadprog, tinytest
Published: 2022-08-23
Author: Enrico Schumann ORCID iD [aut, cre]
Maintainer: Enrico Schumann <es at>
License: GPL-3
URL: , ,
NeedsCompilation: no
Materials: README NEWS ChangeLog
CRAN checks: neighbours results


Reference manual: neighbours.pdf
Vignettes: Neighbourhood functions


Package source: neighbours_0.1-2.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): neighbours_0.1-2.tgz, r-oldrel (arm64): neighbours_0.1-2.tgz, r-release (x86_64): neighbours_0.1-2.tgz, r-oldrel (x86_64): neighbours_0.1-2.tgz
Old sources: neighbours archive


Please use the canonical form to link to this page.