G

Greedy Algorithms

For a mind-free weekend getaway, it allocates individuals to vehicles, ensuring each has ≥2 drivers, following rules and preferences. It initializes, allocates drivers, assigns remaining individuals based on preferences, and validates the allocation, employing a greedy approach, returning None if any step fails, or the achieved allocation otherwise.

This is an ILP implementation in C++ of a new algorithm for the Traveling Repairman Problem with unit time windows. This produces approximate solutions within a factor of 4 to the optimal solution. This resulted in a IEEE paper and MSc. thesis (2015)