Is it possible the solution was right there all along??
I've been on-and-off tweaking the #radar #scheduling #optimization #constraintprogramming #python #software project to include routing
I kept finding that routing takes longer to figure out than pure packing--no surprise.
But this was even the case when the constraints put on the routing were extremely minimal.
This made me wonder how much actual optimization was happening in the NON-routing case. As it turns out, none. If it doesn't have to do any work, it goes fast.
Sounds pretty obvious, but it's very helpful. Why? See next toot.




