These projects deal with solving very-large, city-wide waste and recycling collection problems.
The source code is available at: https://github.com/ejwillemse/mcarptif.
A very simple GUI to illustrate how it works is available at: https://github.com/ejwillemse/mcarptif_gui.
The code was adapted and eventually made it into a commercial service offering, as per this demo, where we ran planning scenarios:
We also tested some modifications, such as better clustering through convex-hull constraints:
And more recently, we followed an agentic approach, whereby scenarios can be run and compared using LLMs, linked to the algorithms with SKILLS.md files.
They contain implementations of heuristics to deal with the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities. The problem is directly relevant to waste and recycling collection where a fleet of homogeneous vehicles have to collect waste on streets. Collection routes have to be completed within a certain period, typically corresponding to an 8-hour work day. Vehicles are allowed to unload their waste at intermediate-facilities once they reach capacity. The problem further accounts for mixed-road networks with one and two way streets.
For more information on the problem, see:
And there are these publications:
They are all available from https://www.researchgate.net/profile/Elias_Willemse.