These are binary constraint satisfaction problems created to test the performance of algorithms. The first set covers the landscape of solvable to non-solvable problems and covers the phase transition of easy to hard to easy. The second set comprises small to large problems.
See these papers for a detailed description:
- Comparing Evolutionary Algorithms on Binary Constraint Satisfaction Problems (B.G.W. Craenen, A.E. Eiben, J.I. van Hemert), In IEEE Transactions on Evolutionary Computation, volume 7, 2003.
- Application of Evolutionary Computation to Constraint Satisfaction and Data Mining (J.I. van Hemert), PhD thesis, Leiden University, 2002. (ISBN: 90-6734-057-X)
Goals
-
To facilitate as a suit of programs to create and analyse randomly created binary constraint satisfaction problems,
for those who do not like to work with libraries for any reason a suite of programs is included that provides a simple interface to the library. With these programs it is easy to create a set of random problem instances, to verify solutions and to analyse instances on a number of features.
-
To be used as a library to implement and test new or existing constraint satisfaction solving techniques,
the library part has an extended documentation of its class hierarchy that helps new developers on their way creating new tools or solving techniques for binary constraint satisfaction. At the same time the library allows testing using a number of theoretical models.
-
To be freely available for anyone,
the library and programs that come with it are all licensed under the Gnu Public License, ensuring free use forever.
Changelog
Changes with previous (1.7.0) version: Added Model RB by Xu and Li; works now with GCC-3.3.2; changed default output from list to matrix
Downloads
This evolutionary art system is designed to be as general as possible. It makes it an easy to extend system, open to many different forms of art. The system also utilises a database to store the actions of its visitors, thereby creating an interesting pool of data for studying subjective user preferences regarding two dimensional visual art. It is completely written in Perl, making it very flexible and easy to maintain.
eArtWeb
Description
This page will transform your Netscape (Communicator’s) bookmark file into a Palm Pilot Database file suitable for List DB. This way your can carry around your bookmarks in an easy to view way without having to Graffiti all those bookmarks by hand. Just enter your file in the box (or use the browse button) and click on ‘Get PDB file’. A download window will appear with the file.
Downloads
Description
Converts the mail aliases of Elm to a list of aliases suited for the Mutt mail reader.
Downloads
This application produces Mondriaan (also known as Mondrian) like art. To help people remember what Mondriaan’s art looks like the site is in style of the paintings he made during his last years. Black horizontal and vertical lines that intersect forming rectangular areas that are coloured exclusively using white, black or one of the primary colours. Static Linux version available.
Mondriaan Art
Description
This library implements a framework for an evolutionary algorithm. It aims at including different techniques from the area of evolutionary computation, such as genetic algorithms and genetic programming, in one framework. It is setup such that new projects can be implemented by adjusting only the necessary parts in the library.
Downloads
Description
This program was used in research on random constraint satisfaction problems. The code is based on work and ideas of Jan Paredis.
Downloads
For performing experiments on graph k-colouring with the Grouping Genetic Algorithm (GGA) as introduced by E. Falkenauer. For problem instances it uses the Graph Coloring Problem Generator by Joe Culberson. All results in the paper included as a separate archive.
See the following papers for more details.
- Graph Coloring with Adaptive Evolutionary Algorithms (A.E. Eiben, J.K. van der Hauw, J.I. van Hemert), In Journal of Heuristics, Kluwer Academic Publishers, volume 4, 1998.
- Comparison of the SAW-ing Evolutionary Algorithm and the Grouping Genetic Algorithm for Graph Coloring (J.I. van Hemert, A.E. Eiben), Technical report, Leiden University, 1997.
Description
This application implements the Stepwise Adaptation of Weigths Algorithm (SAW) and can be used to run experiments on graph k-colouring instances created using the Graph Coloring Problem Generator of Joe Culberson.
Downloads