arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.09678math.OC
收藏

组合最优化问题的一般时空模型(不仅)

A general space-time model for combinatorial optimization problems (and not only)

Maria Barbati, Salvatore Corrente, Salvatore Greco

摘要:

我们考虑的问题,定义一个战略,包括一套设施,同时考虑到他们必须被分配的位置和时间,他们必须被激活。这些设施是根据一套标准进行评价的。该计划的设计必须尊重与问题的不同方面有关的一些限制,例如由于设施的性质而造成的优先限制。在这些制约因素中,有一些与可用预算有关。我们还考虑了与设施性能相关的不确定性,以及参与决策的多个利益相关者。所考虑的问题可以看作是一些典型的运筹学问题的组合:背包问题,定位问题和项目调度。实际上,我们的模型的基本砖块是一个变量$x_{ilt}$,如果设施$i$在位置$l$在时间$t$被激活,则该变量取值1,否则取值$0$。由于在决策变量中同时考虑了位置和时间,我们所提出的模型可以看作是运筹学问题的一般时空模型。我们讨论了这样一个模型如何允许处理复杂的问题,使用多种方法,包括多属性价值论和多目标优化。对于后一点,不失一般性,我们考虑妥协规划和基于优势粗糙集方法的交互式方法。我们用一个简单的教学例子来说明我们的模型的应用。

英文摘要:

We consider the problem of defining a strategy consisting of a set of facilities taking into account also the location where they have to be assigned and the time in which they have to be activated. The facilities are evaluated with respect to a set of criteria. The plan has to be devised respecting some constraints related to different aspects of the problem such as precedence restrictions due to the nature of the facilities. Among the constraints, there are some related to the available budget. We consider also the uncertainty related to the performances of the facilities with respect to considered criteria, and plurality of stakeholders participating to the decision. The considered problem can be seen as the combination of some prototypical operations research problems: knapsack problem, location problem and project scheduling. Indeed, the basic brick of our model is a variable $x_{ilt}$ which takes value 1 if facility $i$ is activated in location $l$ at time $t$, and $0$ otherwise. Due to the conjoint consideration of a location and a time in the decision variables, what we propose can be seen as a general space-time model for operations research problems. We discuss how such a model permits to handle complex problems using several methodologies including multiple attribute value theory and multiobjective optimization. With respect to the latter point, without any loss of the generality, we consider the compromise programming and an interactive methodology based on the Dominance-based Rough Set Approach. We illustrate the application of our model with a simple didactic example.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑