arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1409.5719cs.AI
收藏

多目标相关NK-景观的局部最优集和有界最优解

Local Optimal Sets and Bounded Archiving on Multi-objective NK-Landscapes with Correlated Objectives

Université Libre de Bruxelles(布鲁塞尔自由大学);Université Lille 1(里尔第一大学);Inria Lille-Nord Europe(里尔-北欧欧洲信息与自动化研究所);Université du Littoral Côte d’Opale(滨海奥帕尔海岸大学)

Manuel López-Ibáñez, Arnaud Liefooghe, Sébastien Verel

摘要:

多目标组合优化问题的局部最优解的性质对局部搜索算法的有效性至关重要,特别是当这些算法是基于Pareto优势时。这种局部搜索算法通常返回一组相互非支配的Pareto局部最优(PLO)解,即PLO集。本文通过Pareto局部搜索(PLS)的实验研究了PLO-集的两个方面。首先,我们研究了几个问题的特点的影响,PLO-集的属性多目标NK景观相关的目标。特别是,我们报告说,无论是增加目标的数量或减少目标之间的相关性导致PLO集的大小呈指数递增,而变量相关性只有轻微的影响。其次,我们研究的运行时间和质量达到时,使用边界归档方法来限制PLS处理的档案的大小,因此,PLO-set的最大大小found. We认为,PLS的运行时间和问题实例的难度之间有一个明确的关系。

英文摘要:

The properties of local optimal solutions in multi-objective combinatorial optimization problems are crucial for the effectiveness of local search algorithms, particularly when these algorithms are based on Pareto dominance. Such local search algorithms typically return a set of mutually nondominated Pareto local optimal (PLO) solutions, that is, a PLO-set. This paper investigates two aspects of PLO-sets by means of experiments with Pareto local search (PLS). First, we examine the impact of several problem characteristics on the properties of PLO-sets for multi-objective NK-landscapes with correlated objectives. In particular, we report that either increasing the number of objectives or decreasing the correlation between objectives leads to an exponential increment on the size of PLO-sets, whereas the variable correlation has only a minor effect. Second, we study the running time and the quality reached when using bounding archiving methods to limit the size of the archive handled by PLS, and thus, the maximum size of the PLO-set found. We argue that there is a clear relationship between the running time of PLS and the difficulty of a problem instance.

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

↑