arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.4628cs.NEcs.AI
收藏

双目标多重路径问题的连通性效应

On the Effect of Connectedness for Biobjective Multiple and Long Path Problems

INRIA Lille-Nord Europe(法国国家信息与自动化研究所里尔-北欧分部);Université Nice Sophia Antipolis(尼斯索菲亚·安提波利斯大学);CNRS(法国国家科学研究中心);Université Lille 1(里尔第一大学);École des Mines de Douai(杜埃矿业学院)

Sébastien Verel, Arnaud Liefooghe, Jérémie Humeau, Laetitia Jourdan, Clarisse Dhaenens

摘要:

最近,连通性的性质被认为是多目标组合优化(MOCO)局部搜索技术设计的一个强大动力。事实上,当连通性成立时,一个基本的帕累托局部搜索,初始化至少有一个非支配的解决方案,允许确定有效集穷举。然而,这在实践中很快变得不可行,因为有效解决方案的数量通常随着实例大小呈指数级增长。因此,我们通常要处理一个有限大小的近似,在一个良好的样本集必须found.In本文中,我们提出了双目标多个和长路径问题的实验表明,在第一个问题,即使有效的集合是连接的,一个简单的进化算法在采样的有效集的局部搜索可能优于。相反,在第二个问题上,局部搜索算法可以成功地逼近不连通有效集。然后,我们认为,连通性是不是唯一的属性研究的局部搜索算法的设计MOCO。这项工作开启了新的讨论,一个适当的定义的多目标健身景观。

英文摘要:

Recently, the property of connectedness has been claimed to give a strong motivation on the design of local search techniques for multiobjective combinatorial optimization (MOCO). Indeed, when connectedness holds, a basic Pareto local search, initialized with at least one non-dominated solution, allows to identify the efficient set exhaustively. However, this becomes quickly infeasible in practice as the number of efficient solutions typically grows exponentially with the instance size. As a consequence, we generally have to deal with a limited-size approximation, where a good sample set has to be found. In this paper, we propose the biobjective multiple and long path problems to show experimentally that, on the first problems, even if the efficient set is connected, a local search may be outperformed by a simple evolutionary algorithm in the sampling of the efficient set. At the opposite, on the second problems, a local search algorithm may successfully approximate a disconnected efficient set. Then, we argue that connectedness is not the single property to study for the design of local search heuristics for MOCO. This work opens new discussions on a proper definition of the multiobjective fitness landscape.

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

↑