Focal distance tabu search

来源 :中国科学:信息科学(英文版) | 被引量 : 0次 | 上传用户:redpig
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
Focal distance tabu search modifies a standard tabu search algorithm for binary optimization by augmenting a periodic diversification step that drives the search away from a current best (or elite) solution until the objective function deteriorates beyond a specified threshold or until attaining a lower bound on the distance from the originating solution.The new augmented algorithm combines the threshold and lower bound approaches by introducing an initial focal distance for the lower bound which is updated when the diversification step is completed.However,rather than terminating the diversification step at the customary completion point,focal distance tabu search (TS) retains the focal distance bound through additional search phases designed to improve the objective function,drawing on a strategy proposed with strategic oscillation.The algorithm realizes this strategy by partitioning the variables into two sets which are managed together with an abbreviated tabu search process.An advanced version of the approach drives the search away from a collection of solutions rather than a single originating solution,introducing the concept of a signature solution to guide the search.The method can be employed to augment a variety of other metaheuristic algorithms such as those using threshold procedures,late acceptance hill climbing,iterated local search,breakout local search,GRASP,and path relinking.
其他文献
Stochastic gradient descent (SGD)-based optimizers play a key role in most deep learning models,yet the learning dynamics of the complex model remain obscure.SGD is the basic tool to optimize model parameters,and is improved in many derived forms includin
This work presents mechanical properties of the NiTi polycrystalline superelastic shape memory alloys(SMA)of 5 different grain sizes under high-speed impacts.The amorphous,nanocrystalline(40,80,120 nm)and coarse grain(20 μm)sheets are manufactured with co
Dear editor,rnFault diagnosis of industrial production processes are crucial for early detection of abnormal conditions and help opera-tors to prevent accidents in a timely manner.Therefore,reasonably establishing a fault diagnosis model with better perfo
期刊
In this paper,we developed a stability analysis for discrete-time uncertain time-delay systems governed by an infinite-state Markov chain (DUTSs-IMC).Some sufficient conditions for the considered systems to be exponential stability in mean square with con
In this paper,we address simultaneous control of a flexible spacecraft\'s attitude and vibrations in a three-dimensional space under input disturbances and unknown actuator failures.Using Hamilton\'s principle,the system dynamics is modeled as an infi
In this paper,we have formulated quantum beetle antennae search (QBAS),a meta-heuristic optimization algorithm,and a variant of beetle antennae search (BAS).We apply it to portfolio selection,a well-known finance problem.Quantum computing is gaining immen
This paper considers the global stability problem of the system comprising a pipe conveying fluid and a nonlinear energy sink (PCF-NES) system.First,a quadratic form model containing a gradient term of a convex function is obtained from a high-order parti
InGaN/GaN multiple quantum-well(MQW)structures with a wavelength range of green were successfully grown on a c-plane GaN template with SiO2 stripe patterns along the[11-20]and[1-100]directions as a mask.The surface morphologies of both samples were invest
Autism spectrum disorder (ASD),a developmental disorder severely affecting cognition and social behavior,is increasing in prevalence [1].This increasing trend is especially severe in children,making the early intervention crucial to ASD treatment.Children
期刊
This paper mainly discusses the stabilization problem for discrete-time Markov jump linear systems (MJLSs) involving multiplicative noise with an infinite horizon.The cost weighting matrices are generalized to be indefinite.To the best of our knowledge,th