This project consisted of solving the Travelling Salesman Challenge.
An ACO algorithm was employed with a genetic algorithm meta-optimization.
This project is described in a published paper by Springer Optimizing Meta-heuristics for the Time-Dependent TSP Applied to Air Travels.
For this project, our group made a Java tool, capable of detecting if certain patterns occur in a .java file code. A custom grammar was developed to allow the user to write the pattern that should be found. The matching is done by comparing the .java AST and our own grammar AST.
(4 people team)
Diagramo was the winner of the "Creative" category of a 60-hour long hackathon called Make or Break. It is a Web application that consists on a canvas and a compiler, which allows the creation of diagrams by coding. It uses programming concepts such as objects and inheritence to make it allow quick creation and change of diagrams.
You can ready a full description of what it did on the repository's README.
Page under construction.