OR-Tools for Team Orienteering Problem with Time Window

[Ramakrishna N]

Hello @all,

I am a newbie to or-tools and I am wondering if it has a functionality to solve Team Orienteering Problems with Time Window (TOP-TW).

An example problem formulation: There is one vehicle which is available for just 2 hours and there are multiple destinations to be served. Serving all destinations is NOT mandatory. An optimal route has to be found so that maximum number of destinations are served during the 2 hours.

Any pointers to code, implementation, reference or tutorial cases would be of great help. 

Many Thanks!

Best Regards,

-Rama

[Gwénaël Rault]

Hello, 

You should probably have a look to the AddDisjunction function : https://github.com/google/or-tools/blob/ab4f7941f70f1d7149823c8cffbb188c3e042ab0/src/constraint_solver/routing.h#L525

It will allow you to represent in a way the reward of serving a point.

for the tutorials, you should look at the examples concerning the tsp, cvrp and pdptw. And more generally the routing library https://developers.google.com/optimization/routing

[Wanzhe Hu]

hello, 

       have you solved your problem, solving TOP with or-tools?

       I also need this kind of examples. 

       Many thanks!

best wishes,

wanzhe