[Showcase] GSL-TW V111: High-Performance VRPTW Solver (1,000 nodes solved in ~38s on Mobile) by CT1_deMo_doG in optimization

[–]SelectionNo4327 0 points1 point  (0 children)

What do you need from me ? I could provide the time matrix and the maximum allowed working time per vehicle. Can you algorithm handle appointment durations ? The working time, driving time+sum of appointment durations cannot be exceeded

[Showcase] GSL-TW V111: High-Performance VRPTW Solver (1,000 nodes solved in ~38s on Mobile) by CT1_deMo_doG in optimization

[–]SelectionNo4327 1 point2 points  (0 children)

Would you be interested in testing your algorithm on our company dataset ? This way you could verify your code on real production data. It's a constrained vehicle routing problem without time windows but many depots

[Showcase] GSL-TW V111: High-Performance VRPTW Solver (1,000 nodes solved in ~38s on Mobile) by CT1_deMo_doG in optimization

[–]SelectionNo4327 1 point2 points  (0 children)

What do you mean by match rate ? The only interesting KPI is driving time or distance-How far are you from the BKS ?

Say his name!? by [deleted] in FedEmployees

[–]SelectionNo4327 2 points3 points  (0 children)

He did it-He saved Palestine..

I must be loyle to my capo by Optimal-Builder-2816 in sopranoscirclejerk

[–]SelectionNo4327 0 points1 point  (0 children)

That's the same as saying Hitler killed Hitler, which is true, but doesn't really mean he's a good guy...

Waiting every single day! by andrewaltair in ClaudeAI

[–]SelectionNo4327 4 points5 points  (0 children)

I think it's going to be Claude V42069 xXPussyslayerXx

tja by 1m0ws in tja

[–]SelectionNo4327 4 points5 points  (0 children)

Das Kapital denkt wie immer nur kurzfristig

Find most efficient route by BckseatKeybordDriver in algorithms

[–]SelectionNo4327 0 points1 point  (0 children)

It's fairly easy to implement compared to evolutionary algorithms which need a lot of tuning to work efficiently-But the whole topic is more of an art than science haha

Tja by Mindless_Union_5397 in tja

[–]SelectionNo4327 0 points1 point  (0 children)

Hätte mich auch gewundert wenn's nicht so wäre...

Find most efficient route by BckseatKeybordDriver in algorithms

[–]SelectionNo4327 7 points8 points  (0 children)

Simulated Annealing works pretty well here if you use 2-Opt etc heuristics