Dear Amaury,

I'm not quite sure that it can help you somehow, but I found and explained (in a very plain language) connections between solving differential equations under null-Laplacian restriction an the message-passing strategy used in the Routing Information Protocol (RIP), which certainly has many analogies to the ACO you are interested in.

It is just a silly guess, but I feel that it may help in your search of a version (or even a new adaptation) of ACO to solve the OTSP.

Unfortunately, it is just a 'home-made' film posted on Youtube, in Portuguese. But I hope it will be useful anyway...

Link: https://youtu.be/khcNbs2Ff-Y

https://youtu.be/khcNbs2Ff-Y

Hi Amaury, 

Hi,

I suggest Ant-Q algorithm for handling NP-hard problem. The  Ant-Q algorithm is an agent based algorithm that combines Ant colony based methods  with the

reinforcement learning technique.

Personnaly I have used the Ant-Q as hyperheuristic for solving the cutting stock problem and I have reached good results.

https://www.researchgate.net/publication/224247371_Ant-Q_hyper-heuristic_approach_for_solving_2-dimensional_Cutting_Stock_Problem

Good luck. 

Conference Paper Ant-Q hyper-heuristic approach for solving 2-dimensional Cut...