This repository introduces a benchmark problem for the evaluation of an automated design method’s ability to solve design decision tree problems that are multimodal, opaque, unbounded, and contain an ever-increasing number possible modification as the complexity grows. The test problem is highly analogous to many complex design problems of interest, but solutions to it can be evaluated quickly with minimal computational resources. This enables rapid testing of automated design algorithms. Within these files, we include a Monte Carlo Tree Search, two Genetic Algorithms, and Ant Colony Optimization. The algorithms are compared to each other on the Color Graph problem. The work is published in:
"A Comparison of Tree Search Method for Graph Topology Design Problems" by Ada-Rhodes Short, Bryony Dupont and Matt Campbell, International Conference On Design Computing And Cognition (Dcc'18 Or Dcc18), 2–4 July 2018, Politecnico di Milano, Italy. doi: pending
This material is based upon work supported by the National Science Foundation under grant CMMI-1662731. Any opinions, findings, and conclusions or recommendations presented in this paper are those of the authors and do not necessarily reflect the views of the National Science Foundation.