.png){kind=icon}
返回
An iterated local search algorithm for the minimum differential dispersion problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.knosys.2017.03.028.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given a set of n elements separated by a pairwise distance matrix, the minimum differential dispersion problem (MM-Diff DP) aims to identify a subset of m elements (m < n) such that the difference between the maximum sum and the minimum sum of the inter-element distances between any two chosen elements is minimized. We propose an effective iterated local search (denoted by ILS_MinDiff) for Min-Diff DP. To ensure an effective exploration and exploitation of the search space, ILS_MinDiff iterates through three sequential search phases: a fast descent-based neighborhood search phase to find a local optimum from a given starting solution, a local optima exploring phase to visit nearby high-quality solutions around a given local optimum, and a local optima escaping phase to move away from the current search region. Experimental results on six data sets of 190 benchmark instances demonstrate that ILS_MinDiff competes favorably with the state-of-the-art algorithms by finding 131 improved best results (new upper bounds). (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Combinatorial optimization
Dispersion problems
Heuristics
Iterated local search
Three phase search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
Breakout local search for the Steiner tree problem with revenue, budget and hop constraints具有收入，预算和跳限制的Steiner树问题的突围局部搜索
PREAI
分享收藏
查看更多内容