local-search: A first attempt at generalised local search within Haskell, for applications in combinatorial optimisation.
This library operates by representing metaheuristics as generators of solutions, or streams of solutions, which are themselves the result of resolving the interactions of other streams of values. The library contains combinators for constructing and managing these structures.
|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), combinatorial-problems (>=0.0.4), containers (>=0.4.0.0), random (>=220.127.116.11) [details]|
|Copyright||Copyright (c) 2012 Richard Senington|
|Author||Richard Senington & David Duke|
|Category||Control, Optimisation, Local Search|
|Uploaded||by RichardSenington at 2012-09-03T11:01:47Z|
|Downloads||4032 total (14 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs available [build log]
Successful builds reported [all 1 reports]