We aim to make the source code of most of our algorithms available. An overview of the currently available toolboxes and the corresponding papers is provided below.
- SolvePOMDP - A toolbox containing exact and approximate algorithms for Partially Observable Markov Decision Processes. In particular, it contains the software implementation of the accelerated vector pruning algorithm described in the following paper: Erwin Walraven and Matthijs T. J. Spaan. Accelerated Vector Pruning for Optimal POMDP Solvers. Proceedings of the 31st AAAI Conference on Artificial Intelligence, 2017. For feature requests or any other inquiries, please contact Erwin Walraven.
- MADP - The MultiAgent Decision Process toolbox contains several algorithms and tools for planning and learning in multiagent systems. For more details we refer to the dedicated webpage. Contact: Matthijs Spaan.
- PowerTAC - A simulator for trading in wholesale electricity markets. Most of this work is done by John Collins and Wolf Ketter, but Mathijs de Weerdt has contributed to some of the design questions. See also the report describing this tool.
- STP and all-pairs shortest path algorithms and benchmark data - This page collects various benchmark problem sets to compute shortest paths on, for example to solve all-pairs short path problems such as useful for solving Simple Temporal Planning (STP) problems. In particular, it contains the code and data described in the following paper: L. R. Planken, M. M. de Weerdt and R. P.J. van der Krogt (2012) "Computing All-Pairs Shortest Paths by Leveraging Low Treewidth", Volume 43, pages 353-388.
- The data used for the simulations described in "Intention-Aware Routing of Electric Vehicles"
- Multi-Machine Scheduling Lower Bounds Using Decision Diagrams - This is an implementation of decision diagrams in order to obtain lower bounds for a multi-machine scheduling problem, as described in van den Bogaerdt, P., de Weerdt, M.M.: Multi-machine scheduling lower bounds using decision diagrams. Operations Research Letters 46(6), 616–621 (2018).
- Lower Bounds for Uniform Machine Scheduling Using Decision Diagrams - This is an implementation of decision diagrams for lower bounds on uniform multi-machine scheduling problem instances, based on the implementation above. This is described in van den Bogaerdt, de Weerdt (2019), Lower Bounds for Uniform Machine Scheduling Using Decision Diagrams, In Louis-Martin Rousseau, Kostas Stergiou (Eds.), Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 565-580.
- Order acceptance and scheduling with sequence-dependent setup times - Implementations of different algorithms and benchmark instances for a single machine scheduling problem with rejection can be found here. The respective paper can be found here. More up to date source code with an improved algorithm can be found here. Updated benchmark instances can be found here. If you use these, please cite our work: He L , De Weerdt M , Yorke-Smith N. Time/sequence-dependent scheduling: the design and evaluation of a general purpose tabu-based adaptive large neighbourhood search algorithm. Journal of Intelligent Manufacturing, 2019
- B-FELSA - A framework for benchmarking flexible electric load scheduling algorithms. The toolbox includes a number of optimization algorithms and a scenario generator. See here for a bit more explanation. The toolbox is described in Koos van der Linden and Natalia Romero and Mathijs M. de Weerdt (2020). Benchmarking Flexible Electric Loads Scheduling Algorithms under Market Price Uncertainty, arXiv 2002.01246.