本地搜索和管理实际变量的效率 [英] Efficiency of local search and management of real variables

问题描述

您好，

我有两个问题：

1）我想知道MSF中的本地搜索算法是否有效。有人有任何反馈吗？

2）对于我必须管理的问题，我的决策变量是整数（或布尔值取决于建模的选择）：产品排序的顺序。 br />
为了表达我的约束，我需要使用中间变量（取决于决策变量值）：每个产品的坐标。如果我不使用这些中间变量，则约束将是不可读的。

这些约束并非都是线性的...

可以和MSF处理这样的模型。

提前感谢任何建议。

Laurent Pajou。

 

 

 

解决方案

嗨Laurent，

关于第一个问题 - 这是主观的。我们尝试使本地搜索算法尽可能高效地处理它可以处理的各种模型。也许论坛上的其他人可以分享他们的经历。

关于第二个：中间变量完全没问题。如果涉及非线性约束，则将调用局部搜索或约束求解器。如果变量都是整数（或布尔值），那么约束求解器将被选择为
，否则将使用局部搜索求解器。

谢谢，Nathan

Hello,

I have two questions:

1) I would like to know if local search algorithms in MSF are efficient. Does someone has any feedback ?

2) For the problem I have to manage, my decision variables are integer (or boolean depending on the choice of modelling) : order of sequencing of products.
In order to express my constraints, I need to use intermediate variables (depending on decision variables values) : coordinate of each product. If I don't use these intermediate variables, the constraints will be unreadable.
These constraints are not all linear...
Can  MSF handles such a model.

Thanks in advance for any advice.

Laurent Pajou.

 

 

 

解决方案

Hi Laurent,

Regarding the first question - that is subjective. We have tried to make the local search algorithm as efficient as possible over the broad range of models that it can handle. Perhaps someone else on the forum can share their experiences.

Regarding the second: intermediate variables are no problem at all. If nonlinear constraints are involved then either the local search or constraint solver will be invoked. If the variables are all integer (or boolean) then the constraint solver will be chosen, otherwise the local search solver will be used.

Thanks, Nathan

这篇关于本地搜索和管理实际变量的效率的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！