My novel solution to a modified Cutting Stock problem
As a part of the Computational Intelligence module during my final year at univeristy, we were tasked to create a CI algorithm that could find the optimal or closed to optimal solution, and compare it to a baseline solution and propose a winner in the accompanied write up.
As a brief conlusion to the task, my novel solution was able to achieve the optimal solutions in less genearations but took more time to complete compared to the baseline.