Multibatching problem implementation#465
Open
g-poveda wants to merge 14 commits into
Open
Conversation
… mathopt/gurobi backend as done in the lib), minizinc flow solver
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
-added problem implementation (satisfy/evaluate, utils) for the multibatching problem where the goal is to flow product from location to others (having demand/supply), in set of transport link with limited capacities), objective is to minimize the cost of used transport
-the problem can be seen as a classical flow problem + binpacking problem to put discrete product quantities to transport means
-solver can be directly tackling the full problem, formalizing each individual transport trip, or decompose it to flow then binpacking problem
-added examples, tests
-added dataset download
this work is soon to be published in cp26