OptaPlanner is a good base for metaheuristics research. Read about some of the advantages in this article. Especially OptaPlanner Benchmarker and our big set of already implemented use cases, make it easy to test your new algorithm objectively against the existing algorithms.
If you’re doing academic or professional research on top of OptaPlanner, let us know.
To reference OptaPlanner or the user manual, please use this BibTeX reference:
@manual{optaplanner,
author = {De Smet, Geoffrey and open source contributors},
title = {OptaPlanner User Guide},
year = {2006},
organization = {Red Hat, Inc. or third-party contributors},
url = {https://www.optaplanner.org},
note = {OptaPlanner is an open source constraint solver in Java}
}
Multithreaded incremental solving for local search based metaheuristics with step chasing by Geoffrey De Smet, Tony Wauters (2020)
Paper: PDF
ISBN: 978-0-9929984-3-1
If your paper relates to OptaPlanner, let us know and we’ll add it here.
Want to talk to the experts? Red Hat offers certified binaries with enterprise consulting. Contact optaplanner-info for more information.
Jiří Locker
Geoffrey De Smet
Walter Medvedeo
Christopher Chianelli
Christopher Chianelli
Geoffrey De Smet
Christopher Chianelli
Geoffrey De Smet
Geoffrey De Smet
Geoffrey De Smet
Radovan Synek
Satish Kale
Lukáš Petrovický
Justin Goldsmith
Quarkus insights: AI constraint solving