Multiple Courier Planning
A team project on the NP-hard multiple courier planning problem. I led the MiniZinc model; we compared 4 modeling approaches.
- Collaborated as a team member on a complex combinatorial optimization problem
- Tested 4 different modeling approaches for the planning problem
- Took primary responsibility for the MiniZinc implementation and modeling
- Results suggest MiniZinc is a reliable choice for many combinatorial problems
- Date
- Dec 2024
- Domain
- Algorithms & optimization
- Stack
- MiniZinc, Constraint programming, Python