Skip to content
Discussion options

You must be logged in to vote

https://gist.github.com/Mizux/4870e4af09b31dd45b7ac632d1830a73#file-cvrptw-py-L154-L157

The idea here, is to "allow solver to drop nodes if we can't visit ALL locations" (e.g. at 6pm you want to go to the cinema and at 6pm you also want to go to a restaurant instead of returning infeasible we accept as a valid solution to not going to the cinema or the restaurant or both) but if penalty is very low then the best objective is to drop all nodes (since you pay the penalty BUT not the arc cost !)....and that's clearly not what we want !

Here we would like to visit the most locations possible even if it increase the objective cost so to make it the dominant factor I used a "big enough" number …

Replies: 3 comments 2 replies

Comment options

You must be logged in to vote
0 replies
Comment options

You must be logged in to vote
1 reply
@Mizux
Comment options

Mizux Jun 1, 2021
Maintainer

Comment options

You must be logged in to vote
1 reply
@Mizux
Comment options

Mizux Jun 1, 2021
Maintainer

Answer selected by lperron
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
2 participants
Converted from issue

This discussion was converted from issue #2569 on May 30, 2021 07:18.