Applying Heuristics
AnsweredHi,
I am trying to solve a combinatorial MIP problem, I have got an objective function value.
Now, I want to try heuristics on the problem, can anyone tell me the code in python, how should I proceed. I am from mechanical background so difficult for me to understand the jargons and work on it
-
Official comment
-
Gurobi Staff
This post is more than two years old. Some information may not be up to date. For current information, please check the Gurobi Documentation or Knowledge Base. If you need more help, please create a new post in the community forum, or try Gurobot, our chatbot interface offering instant, expert-level support. -
-
-
Community Moderator
Dear Ankit,
solving MIPs can indeed be done exactly (finding optimal, or the best solution - using a solver like Gurobi) or heuristically (without being sure that the solution is optimal - here you can use a solver like Gurobi but also all sorts of different algorithms).
Since you are a beginner, I suggest you start with the resources listed here. If you have a more specific question regarding the use of Gurobi, we will gladly help you further.
Best regards
Jonasz0 -
-
Thanks, but I have to show it in a project report. So if you could tell me how to code it
0 -
-
-
Dear Ankit,
based on the inputs you gave us, it is currently not possible to help you any further. We don't know your optimization problem or its formulation, so it's virtually impossible to tell you which heuristic could potentially do well (let alone point you to a reasonable implementation).
If you need to inform yourself about heuristics for MIPs, you can have a look at this presentation - it is somewhat old but it should give you an idea.
Should you need support in your Gurobi applications in the future, we will be glad to help you.
Best regards
Jonasz0 -
Post is closed for comments.
Comments
4 comments