MILP using Genetic algorithm - penalty value increases beyond the global minimum

1 次查看（过去 30 天）
Udayanka Mulleriyawage
评论： Udayanka Mulleriyawage 2020-3-5
I have been using GA to solve a minimization problem and this involves interger variables as well. My programm is working fine except for one abnormality observed in the penalty value vs generations graph.
As you cna see here, (Best value in Black and mean value in blue) best values jumps from around 0 to 1.3. Has anyone come across a similar issue and how you could oivercome it.
Thanks.

请先登录，再回答此问题。

采纳的回答

Dheeraj Singh
Dheeraj Singh 2019-8-23
You can refer to the following example in the link to know more about solving MILP using GA:
https://in.mathworks.com/help/gads/examples/solving-a-mixed-integer-engineering-design-problem-using-the-genetic-algorithm.html
Alternatively, if you are trying to solve MILP it would be more robust to use intlinprog. Also, you can verify your results you get from GA algorithm and see if there is any abnormality.
You can refer to the following link to know more about solving MILP using GA:
https://in.mathworks.com/help/gads/examples/solving-a-mixed-integer-engineering-design-problem-using-the-genetic-algorithm.html
  1 个评论
Udayanka Mulleriyawage
Udayanka Mulleriyawage 2020-3-5
Thank you so much for the response. I used intlinprog to solve the problem I had and then used cplex for matlab. The solver cplexmilp appraches to the optimal solution much faster than intlinprog.

请先登录，再进行评论。

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Genetic Algorithm 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by