This is a half-completed project that I started in Winter 2017 when I was a Research Assistant for Defence Research and Development Canada, in the Department of National Defence in Kingston. While there, I had some conversations that inspired me to apply some of the things that I learned in my discrete optimization classes to problems in casualty evacuation (CASEVAC) planning. The idea was that solving integer programs would allow for optimal routing of evacuation vehicles, in real-time, to new casualty locations, appearing in real-time, based on severity, vehicle type, etc.
This project was my way of first experimenting with integer programming solvers, such as Gurobi, and what kind of things can be built with them. I succeeded there, but as for the project, some early design decisions meant that it would require a complete re-write in order to be completed in the way I wanted. The project is here, but there isn’t too much to look at; instead, I would love the opportunity to talk to anyone who is interested about it.