Binary Integer Optimization Solver for Trip Placement
·1 min
Binary Integer Optimization Solver for Trip Placement is an optimization tool developed to allocate Stanford University students to limited learning opportunities. It uses a custom Genetic Algorithm to explore high-dimensional data spaces and find the global optimum among multiple constraints.
- Optimization Tool: Developed a tool to allocate students to learning opportunities, reducing manual process time by up to 90%.
- Genetic Algorithm: Implemented a custom Genetic Algorithm to explore high-dimensional data spaces and find the global optimum.
GitHub Repository: Trip Optimization