.png){kind=icon}
返回
Variable neighborhood search
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(97)00031-2.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Systematic change of neighborhood within a local search algorithm yields a simple and effective metaheuristic for combinatorial optimization. We present a basic scheme for this purpose which can be implemented easily using any local search algorithm as a subroutine. Its effectiveness is illustrated by improvements in the GENIUS algorithm for the traveling salesman problem [1], without and with backhauls [2]. (C) 1997 Elsevier Science Ltd.
Keyword:
TRAVELING SALESMAN PROBLEM
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
Adsorption of Cu(II), Pb(II), and Cd(II) Ions from Acidic Aqueous Solutions by Diethylenetriaminepentaacetic Acid-Modified Magnetic Graphene Oxide二乙烯三胺五乙酸改性的磁性氧化石墨烯对酸性水溶液中Cu(II)，Pb(II) 和Cd(II) 离子的吸附
PREAI
分享收藏
Money in the Middle: Contribution Strategies among Affluent Donors to Federal Elections, 1980–2008
PREAI
分享收藏PSD-95 Is Essential for Hallucinogen and Atypical Antipsychotic Drug Actions at Serotonin Receptors
OAAI
OAAI分享收藏Iodine-mediated aryl transfer reaction from arylhydrazine hydrochlorides to nitriles.png)
Tetrahedron
TetrahedronIF0
PREAI
分享收藏 没有更多内容
没有更多内容