wiki:WikiStart

Version 57 (modified by abeham, 8 years ago) (diff)

--

Welcome to the HeuristicLab Development Homepage
HeuristicLab is a framework for heuristic and evolutionary algorithms that is developed by members of the Heuristic and Evolutionary Algorithms Laboratory (HEAL) since 2002. The developers team of HeuristicLab uses this page to coordinate efforts to improve and extend HeuristicLab.


At a glance:
Getting Started: Find out more about HeuristicLab on the About page, read the User Manual or follow our developer blog, which will be online shortly. For developers who wish to contribute to HeuristicLab we provide development guidelines, demo engines and an API documentation. If you find any bugs or have additional questions or feedback don't hesitate to contact support@heuristiclab.com.
Developers: Check out the Roadmap and monitor the development progress and changes. Read the documentation to see how you can extend HeuristicLab with your own plugin. Find out more about the research group HEAL, the individual contributors and software projects and scientific publications that have been realized with HeuristicLab on heal.heuristiclab.com HEAL is a research unit of the Upper Austria University of Applied Sciences.
  Publications and Projects: The HeuristicLab software framework has been successfully used in many applied research projects and scientific papers, book chapters and journal articles. A full overview can be found on the research group homepage, but an overview of the most important Publications and selected projects can be found here.
Citation: If you publish any results derived from the use of HeuristicLab we would be grateful if you cite the following reference in your papers:

S. Wagner, Heuristic Optimization Software Systems - Modeling of Heuristic Optimization Algorithms in the HeuristicLab Software Environment, PhD Thesis, Institute for Formal Models and Verification, Johannes Kepler University Linz, Austria, 2009.

Imprint: Statement of the ownership/authorship of this webpage plus contact information can be found here.