.png){kind=icon}
返回
Variable neighbourhood structures for cycle location problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2012.05.038.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Variable neighbourhood search is a metaheuristic used mainly to tackle combinatorial optimization problems. Its performance depends on having a good variable neighbourhood structure: that is, a sequence of neighbourhoods that are ideally pairwise disjoint and contain feasible solutions further and further from a given feasible solution. This article defines a variable neighbourhood structure with these properties that is new for cycle location problems. It find bounds for the neighbourhood sizes and shows how to iterate over then when the cycle is a circuit. It tests the structure and iteration method using variable neighbourhood search on a range of median cycle problems and finds a neighbourhood size beyond which there is, on average, no benefit in applying local search. This neighbourhood size is found not to depend on problem size or bound on circuit length. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Heuristics
Variable neighbourhood search
Circuit
Cycle
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Investigation of morphologies and characterization of rare earth metal samarium hexacyanoferrate and its composite with surfactant intercalated graphene oxide for sensor applications.png)
RSC Adv.
RSC Adv.IF0
PREAI
分享收藏Variable neighborhood tabu search and its application to the median cycle problem变邻域禁忌搜索及其在中环问题中的应用
PREAI
分享收藏
A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem求解无容量单分配p-hub中值问题的一般变邻域搜索
PREAI
分享收藏
查看更多内容