Orienteering Problem

[ondrejromancov]

Dear All,

I would like to know whether it is possible to use or-tools to solve a version of the orienteering problem with time windows and chosen compulsory vertices. I have looked through the guides and VRPTW with penalties seems to be the most similar example, but it I don't think that its suitable as my main goal is to maximise profit and not to visit all nodes.

Could you please point me to the right direction on what to use?

Thank you and I apologize, for unintentional chaotic issue opening.

[lperron]

Please use the mailing list.

[tucachmo2202]

Any ideas to solve this?

[lperron]

already solved. Look for prizecollecting{tsp_vrp}[_sat].py Laurent Perron | Operations Research | @.*** | (33) 1 42 68 53 00

Le lun. 23 oct. 2023 à 09:39, tucachmo2202 @.***> a écrit :

Any ideas to solve this?

— Reply to this email directly, view it on GitHub https://github.com/google/or-tools/issues/1869#issuecomment-1774599639, or unsubscribe https://github.com/notifications/unsubscribe-auth/ACUPL3K2J2UUTZVY3SXJGZTYAYNJ7AVCNFSM4KRNWZLKU5DIOJSWCZC7NNSXTN2JONZXKZKDN5WW2ZLOOQ5TCNZXGQ2TSOJWGM4Q . You are receiving this because you modified the open/close state.Message ID: @.***>

[tucachmo2202]

already solved. Look for prizecollecting{tsp_vrp}[_sat].py Laurent Perron | Operations Research | @. | (33) 1 42 68 53 00 Le lun. 23 oct. 2023 à 09:39, tucachmo2202 @.> a écrit : … Any ideas to solve this? — Reply to this email directly, view it on GitHub <#1869 (comment)>, or unsubscribe https://github.com/notifications/unsubscribe-auth/ACUPL3K2J2UUTZVY3SXJGZTYAYNJ7AVCNFSM4KRNWZLKU5DIOJSWCZC7NNSXTN2JONZXKZKDN5WW2ZLOOQ5TCNZXGQ2TSOJWGM4Q . You are receiving this because you modified the open/close state.Message ID: @.***>

many thanks

[Mizux]

Single Vehicle

• https://github.com/google/or-tools/blob/main/examples/python/prize_collecting_tsp.py
• https://github.com/google/or-tools/blob/main/examples/python/prize_collecting_tsp_sat.py

Multiple Vehicles

• https://github.com/google/or-tools/blob/main/examples/python/prize_collecting_vrp.py
• https://github.com/google/or-tools/blob/main/examples/python/prize_collecting_vrp_sat.py

First link use the Routing Library solver while the second one use the CP-SAT solver.

[tucachmo2202]

Single Vehicle

• https://github.com/google/or-tools/blob/main/examples/python/prize_collecting_tsp.py
• https://github.com/google/or-tools/blob/main/examples/python/prize_collecting_tsp_sat.py

Multiple Vehicles

• https://github.com/google/or-tools/blob/main/examples/python/prize_collecting_vrp.py
• https://github.com/google/or-tools/blob/main/examples/python/prize_collecting_vrp_sat.py

First link use the Routing Library solver while the second one use the CP-SAT solver.

Thanks for your helps. Are there any examples to solve OP with guide local search or other meta heuristic algorithms that Ortool support?

[tucachmo2202]

Hi, I found that I could use VRP solver and AddDisjunction to give result for OP. However, I don't know whether that is right way to do?