In this paper we evaluate how constructive heuristics degrade when a problem transits from P to NP-hard. This is done by means of the linear ordering problem. More specifically, for this problem we prove that the objective function can be expressed as the sum of two objective functions, one of which is associated with a P problem (an exact polynomial time algorithm is proposed to solve it), while the other is associated with an NP-hard problem. We study how different constructive algorithms whose behaviour only depends on univariate information perform depending on the contribution of the P or NP-hard components of the problem. A number of experiments are conducted with reduced dimensions, where the global optimum of the problems is known, giving different weights to the NP-hard component, while the weight of the P component is fixed. It is observed how the performance of the constructive algorithms gets worse as the weight given to the NP-hard component increases.
翻译:在本文中,我们评估了当问题从P到NP-hard之间发生时,何等具有建设性的黑奴主义会如何退化。这是通过线性订购问题来完成的。更具体地说,我们证明,对于这一问题,客观功能可以表现为两个客观功能的总和,其中一项与P问题有关(建议采用精确的多元时间算法解决这个问题),另一项则与NP-硬性问题有关。我们研究的是,由于P或NP-硬成分对问题的贡献,其行为仅依赖于单体信息的不同建设性算法如何发挥作用。一些实验的进行范围缩小,了解了问题的全球最佳性,对NP-硬成分给予不同的权重,同时确定了P部分的权重。观察了随着对NP-硬成分的权重增加,建设性算法的性能如何恶化。