StellarGraph

TSP and VRP (Vehicle Routing Problem) with constraints

Hi
I am trying to solve routing problems with network distance (not euclidian) and constraints such as Time Window and Capacity.
There are some papers around TSP and VRP but they do not implement those requirements.

Can StellerGraph support such settings easily?

If yes, what are the requirements?
Thanks!

Hi,

thanks for you interesting in our work.

Currently, StellarGraph does not support algorithms for TSP/VRP.

Can you please point me to the papers you mention? I’ll have a look and let you know if the proposed algorithms are suitable for addition to StellarGraph.

Regards,

P.

Thanks for the respond,

Here is the links to the paper “Attention, Learn To Solve Routing Problems” and its code in GitHub.

Best,

Eli

Hi,

thank you for sending the paper and I apologise for taking so long to respond.

This was a very interesting paper. Unfortunately, solving TSP problems is not in scope for StellarGraph in the short term. However, we will keep this line of work in mind as we move forward.

Thank you for you interest in our work!

P.

Sorry to hear that.
I will continue following after your important work to see if you change your mind.

Best regards,
Eli