local-search: AA first attempt at generalised local search within Haskell, for applications in combinatorial optimisation.
This library represents a first attempt at creating a generalised library for local (non-exhaustive) search in Haskell. It is based on work presented to IFL2010, a draft of which is currently available on the homepage. The library models local search space using a rose tree, with child nodes forming the neighbourhood of any solution. The tree can then be transformed by various combinators to implement different searching strategies; the result is then "navigated" to yield a sequence of solutions.
|Versions [RSS] [faq]||0.0.1, 0.0.2, 0.0.3, 0.0.5, 0.0.6, 0.0.7|
|Dependencies||base (>=2.0 && <=5), containers (>=0.2.0.1), random (>=188.8.131.52) [details]|
|Copyright||Copyright (c) 2010 Richard Senington|
|Author||Richard Senington & David Duke|
|Category||Control, Optimisation, Local Search|
|Uploaded||by RichardSenington at 2010-09-07T15:51:35Z|
|Downloads||4032 total (14 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs not available [build log]
Last success reported on 2016-12-29 [all 7 reports]