local-search: AA first attempt at generalised local search within Haskell, for applications in combinatorial optimisation.

[ control, library, local-search, optimisation ] [ Propose Tags ]

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 (>=, random (>= [details]
License LicenseRef-GPL
Copyright Copyright (c) 2010 Richard Senington
Author Richard Senington & David Duke
Maintainer sc06r2s@leeds.ac.uk
Category Control, Optimisation, Local Search
Home page http://www.comp.leeds.ac.uk/sc06r2s/Projects/HaskellLocalSearch
Uploaded by RichardSenington at 2010-09-07T15:51:35Z
Distributions NixOS:0.0.7
Downloads 4032 total (14 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs not available [build log]
Last success reported on 2016-12-29 [all 7 reports]


  • Control
    • Search
      • Control.Search.Local
        • Control.Search.Local.Example
        • Control.Search.Local.Navigator
        • Control.Search.Local.Neighbourhood
        • Control.Search.Local.Transformation
        • Control.Search.Local.Tree


Maintainer's Corner

For package maintainers and hackage trustees