Localization of Voltage Regulators in Distribution Systems by a Mixed Genetic–Tabu Search Algorithm

The optimal allocation of regulators banks in distribution systems is a merely combinatorial problem in which the best points of installation correspond to the best benefit, considering the admitted objective function, without violating and operating limits. The objective function must be chosen so that its value represents the operation state of the system. As the problem possesses combinatorial nature, its complexity will increase exponentially with the number of possibilities. Systems with large numbers of nodes and / or with the possibility of installing more than one bank require a large number of calculations to find the solution. An additional issue is the fact that the problem does not have a continuous nature, presenting discontinuity points in the objective function, limiting the application of optimization methods based on gradients. Based on the nature of the problem two optimization methods were used to solve the problem: Genetic Algorithm (GA) and modified Tabu Search (TS). The GA function will scour the search space and find regions with local minima that are candidates to be the solution. On the other hand the TS provides local search in the regions defined by GA so that the overall optimum is achieved.

A new focused crawler using an improved tabu search algorithm incorporating ontology and host information

To solve the problems of incomplete topic description and repetitive crawling of visited hyperlinks in traditional focused crawling methods,in this paper,we propose a novel focused crawler using an improved tabu search algorithm with domain ontology and host information(FCITS_OH),where a domain ontology is constructed by formal concept analysis to describe topics at the semantic and knowledge levels.To avoid crawling visited hyperlinks and expand the search range,we present an improved tabu search(ITS)algorithm and the strategy of host information memory.In addition,a comprehensive priority evaluation method based on Web text and link structure is designed to improve the assessment of topic relevance for unvisited hyperlinks.Experimental results on both tourism and rainstorm disaster domains show that the proposed focused crawlers overmatch the traditional focused crawlers for different performance metrics.

A multi-dimensional tabu search algorithm for the optimization of process planning

Computer-aided process planning(CAPP) is an essential component of computer integrated manufacturing(CIM) system. A good process plan can be obtained by optimizing two elements,namely,operation sequence and the machining parameters of machine,tool and tool access direction(TAD) for each operation. This paper proposes a novel optimization strategy for process planning that considers different dimensions of the problem in parallel. A multi-dimensional tabu search(MDTS) algorithm based on this strategy is developed to optimize the four dimensions of a process plan,namely,operation sequence(OperSeq),machine sequence(MacSeq),tool sequence(ToolSeq) and tool approach direction sequence(TADSeq),sequentially and iteratively. In order to improve its efficiency and stability,tabu search,which is incorporated into the proposed MDTS algorithm,is used to optimize each component of a process plan,and some neighbourhood strategies for different components are presented for this tabu search algorithm. The proposed MDTS algorithm is employed to test four parts with different numbers of operations taken from the literature and compared with the existing algorithms like genetic algorithm(GA),simulated annealing(SA),tabu search(TS) and particle swarm optimization(PSO) . Experimental results show that the developed algorithm outperforms these algorithms in terms of solution quality and efficiency.

Optimal Polygonal Approximation of Digital Planar Curves Using Genetic Algorithm and Tabu Search

Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained. Compared to the famous Teh chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error. Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.

A Niche-Based Evolutionary Tabu Search Algorithm for Optimal Coordination of Protection Relays in Power Networks

In this paper, refusal of operation and the degree of constraint violation are considered as one part of the objective function for optimizing the protection relay setting coordination of over current relays in power systems; a new expression of objec- tive function in this optimization problem is proposed. To combine the advantages of both Tabu search (TS) and evolutionary algo- rithms (EAs), a new niche-based evolutionary Tabu search algo- rithm (named NETS) is presented to solve this optimization prob- lem. Moreover, in two cases of power networks, comparisons be- tween NETS and two published algorithms are given. Experimen- tal results show the expression of the objective function for pro- tection relay setting is feasible and reasonable, and the proposed algorithm NETS exhibits a good performance.

一种改进的Tabu Search算法及其在区域电网无功优化中的应用

提出将改进的Tabu(禁忌)搜索算法用于区域电网无功电压优化控制问题的求解.首先根据已知的实际电网的历史数据获得可行的初始解,然后对区域电网采用改进的禁忌搜索方法进行无功优化.在求解的过程中,由于对Tabu表中所记录的"移动"采取"有条件地释放Tabu表中的记录"这一策略,可以使搜索有效地跳出局部极小值点,更好地找到最优解.通过IEEE-14节点算例验证了该算法的有效性.

Tabu Search算法在优化配送路线问题中的应用

将ＴＳ算法应用到物流系统的配送路线优化问题中。在给出了此类问题的描述后，着重阐述了ＴＳ启发式算法的设计，编程实现此算法的要点。最后，用模拟算例对设计的算法进行了验证，计算结果是比较理想的。

基于Tabu搜索算法真实世界中喜炎平注射液治疗儿童肺炎的联合用药复杂网络研究

目的挖掘喜炎平注射液治疗儿童肺炎核心联用药物方案的临床应用规律,为探索临床不同诊疗思路、用药经验和提高中医药临床证据的循证等级提供参考。方法本研究基于全国29家医院信息管理系统(Hospital Information System,HIS)儿童肺炎的用药数据,运用Tabu禁忌搜索算法,对真实世界喜炎平注射液治疗儿童肺炎人群的联合用药情况进行回顾性数据挖掘分析。结果在核心联用西药方面,抗感染治疗可以联用青霉素/美洛西林/阿莫西林、头孢呋辛/头孢曲松/头孢替安、阿奇霉素等;对症治疗可以联用对乙酰氨基酚/布洛芬、氨溴索+布地奈德+沙丁胺醇等;并发症治疗可以联用水合氯醛+苯巴比妥、磷酸肌酸+抗坏血酸等。在核心联用中药方面,可以联用小柴胡颗粒/小儿柴桂退热颗粒+鼻渊通窍颗粒、热毒宁注射液/蓝芩口服液/连花清瘟胶囊+开喉剑喷雾剂/口腔炎喷雾剂/双料喉风散、小儿肺咳颗粒+醒脾养儿颗粒/四磨汤口服液等。结论本研究的喜炎平注射液核心联用中西药方案,基本符合相关指南及诊疗规范,为优化临床联合用药、合理用药提供了一定的指导和参考。建议临床实际应用过程中,根据患儿的疾病进展情况,合理评估临床联合用药方案的疗效及安全性,注意用药配伍禁忌。

Search for circular and noncircular critical slip surfaces in slope stability analysis by hybrid genetic algorithm

A local improvement procedure based on tabu search(TS) was incorporated into a basic genetic algorithm(GA) and a global optimal algorithm,i.e.,hybrid genetic algorithm(HGA) approach was used to search the circular and noncircular slip surfaces associated with their minimum safety factors.The slope safety factors of circular and noncircular critical slip surfaces were calculated by the simplified Bishop method and an improved Morgenstern-Price method which can be conveniently programmed,respectively.Comparisons with other methods were made which indicate the high efficiency and accuracy of the HGA approach.The HGA approach was used to calculate one case example and the results demonstrated its applicability to practical engineering.

基于改进Tabu Search算法的配电线路无功运行优化系统控制策略研究

在配电网无功补偿优化过程中,Tabu Search算法能够高效地将最优解搜索出来,因此,将Tabu Search算法应用于配电网无功补偿优化具有现实可操作性。本文对Tabu Search方法的原理进行了详细介绍,因为农村配电网线路具备很多特点,综合考量其并联电容器投切等问题及特点,本文在Tabu Search的基础上,进行了一系列改进,用来解决配电网的投切优化问题。提出了基于电容器投切分组的二进制编码优化,基于无功补偿的损耗降低特点,根据功率传输方向,对权重根据由低到高的顺序排列,然后进行二进制编码,从二进制编码串的末端进行移动;Tabu Search非常依赖于初始解,提出了当前时段处于运行退出状态时,根据无功缺额电容器的配置方式进行。

基于Tabu搜索的彩色图像可逆数据隐藏算法

针对当前算法对彩色图像进行可逆隐藏时无法获取最优嵌入数据,存在综合性能差以及加密性能差的问题,提出基于Tabu搜索的彩色图像可逆数据隐藏算法,首先对彩色图像进行加密,确定嵌入的位置,利用Tabu搜索算法提取出最优嵌入秘密数据,在加密图像时进行秘密数据的嵌入,对秘密信息以及图像进行预处理;其次接收者利用自带的密钥对已经嵌入数据的加密图像进行解密,同时对图像进行翻转恢复以及信息提取,实现彩色图像可逆数据隐藏。实验结果表明,所提算法的综合性能高以及加密性较好。

Test Cost Optimization Using Tabu Search

In order to deliver a complete reliable software product, testing is performed. As testing phase carries on, cost of testing process increases and it directly affects the overall project cost. Many a times it happens that the actual cost becomes more than the estimated cost. Cost is considered as the most important parameter with respect to software testing, in software industry. In recent year’s researchers have done a variety of work in the area of Cost optimization by using various concepts like Genetic Algorithm, simulated annealing and Automation in generation of test data etc. This paper proposes an efficient cost effective approach for optimizing the cost of testing using Tabu Search (TS), which will provide maximum code coverage along with the concepts of Dijkstra’s Algorithm which will be implemented in Aspiration criteria of Tabu Search in order to optimize the cost and generate a minimum cost path with maximum coverage.

基于低碳物流的危化品仓库堆垛布局优化研究

为保证危化品仓库安全的同时有效减少碳排放并提升经济效益,建立危险指数最小、物料搬运量最小和碳排放成本最小的危化品仓库堆垛布局多目标优化模型,采用改进的粒子群-禁忌搜索混合算法对模型进行求解。该算法在传统粒子群算法的基础上加入多点变异操作,并在粒子群算法得出解的基础上加入禁忌搜索算法,提高算法跳出局部最优解的能力。研究结果表明:利用本文建立的多目标优化模型及改进算法,危险指数、物料搬运量和碳排放成本均有所下降,解集质量较高,从而在保证危化品安全的情况下,有效降低物料搬运量及碳排放成本。研究结果可为危化品企业对仓库内部碳排放量的影响因素和数值计算以及危化品仓库安全性的界定提供参考与借鉴。

基于改进Tabu搜索算法的电力系统无功优化

本文将一种改进的 Tabu搜索算法 (MTSA)用于电力系统无功优化 ,建立了相应的数学模型 ,考虑了有功损耗费用和补偿费用 ,使得总费用最小。在一般 Tabu搜索算法的基础上 ,对搜索步长、禁忌表、不同循环起始点的选择以及算法终止判据等问题做了分析、讨论 ,并做了一些改进 ,使得更容易挑出局部最优解 ,保证可以搜索整个可行域 ,从而得到全局最优解的可能性更大。应用 MTSA对 IEEE6节点系统行了无功优化计算 ,与线性规划算法、Box算法进行了比较 ,结果表明 MTSA与 Box算法一类的随机搜索算法的优化结果相近 。

基于Tabu搜索方法的电力系统无功优化

将 Tabu搜索方法用于电力系统无功优化 ,采用二进制和十进制编码 2种方案。对IEEE30节点系统和 1 2 5节点山东省某地区电网进行了优化计算 ,并与简单遗传算法、结合模拟退火的遗传算法进行了比较 ,结果表明 Tabu搜索方法具有更强的全局寻优能力 ,可用于运行方式安排 。

电机电磁场逆问题数值计算的改进 TABU 算法

在分析现有ＴＡＢＵ算法基础上，本文提出了一种通用的连续变量全局优化ＴＡＢＵ算法；典型数学函数验证和应用实例表明：本文算法仅用模拟退火（ＳＡ）算法２０％左右的迭代次数便可得到略好于ＳＡ算法的（全局）最优解。

随机Hough变换与Tabu搜索算法在基元提取中的比较

Ｈｏｕｇｈ变换（ＨＴ）是目前应用最广的几何基元提取方法，其基本思想在于通过证据积累来提取基元．最近不少人又提出了通过代价函数的全局优化来提取几何基元的思想．随机Ｈｏｕｇｈ变换（ＲＨＴ）和Ｔａｂｕ搜索（ＴＳ）分别是Ｈｏｕｇｈ变换和优化方法中的佼佼者．ＲＨＴ和ＴＳ分别基于不同的策略，两种方法的相互比较在许多文献中已有提及，但目前尚无较完整的理论分析和系统的比较．本文在提取单个基元所需对最小点集的采样次数的期望值这一准则的基础上，对两种方法进行了比较．分析表明，随机Ｈｏｕｇｈ变换通常要优于Ｔａｂｕ搜索．从我们做的大量仿真和实际图像的实验也可看出，在提取的基元正确率相同的情况下，ＲＨＴ约比ＴＳ快１—２倍．

基于改进Tabu搜索算法的含分布式电源配电网最优潮流

针对含分布式电源的配电网络,建立了发电费用最小、污染物处理费用最小和系统有功网损最小等三种目标函数的最优潮流模型。采用前推回代法进行含分布式电源的配电网络潮流计算,利用改进的Tabu搜索算法求解最优潮流。在搜索过程中,引入了自适应步长来提高解的精度。通过对IEEE33节点算例系统进行求解,验证了所建立的模型和算法的正确性。研究表明对接入分布式电源的配电网潮流进行最优控制能够实现降低成本、网损和环境污染的目的。

无缓存流水线生产系统中AGV调度问题的研究

针对无缓存流水线生产系统中的AGV(automatedguidedvehicle)调度问题提出了复合评分的启发式调度算法,降低了系统中AGV执行任务的间隔等候时间.首先,通过建立数学模型,对目前主流的AGV规模估计方法做出了改进.其次,提出了一种新的基于复合评分禁忌搜索的AGV前瞻调度算法.不同于目前主流的以空驶距离为优化目标的调度算法,该算法能够以最小化工件延误时间、最小化AGV空驶距离等多目标来统筹调度AGV.最后,为验证所提算法的有效性,从多个角度与已有算法进行了实验对比.仿真实验结果表明,相较于其他算法,提出的前瞻调度算法能够更有效地解决无缓存流水线生产系统这一新场景的AGV调度问题.实车实验也证明了该算法在实际生产中的有效性.

基于混合果蝇算法的桩锚支护深基坑临界滑面搜索

进行基坑整体稳定性分析常采用极限平衡法,但仍然需要依据经验试算一系列滑面,将安全系数最小的滑面确定为最危险滑面.针对此问题,提出将果蝇优化(FOA)算法与禁忌搜索(TS)算法融合,提出自适应步长的混合果蝇优化算法(HFOA),以克服基本果蝇算法局部寻优精度不高且易陷入局部最优的缺点,确保获得全局最优解,并结合简化Bishop算法用于临界滑面的搜索.在Matlab中编程实现该算法,通过与6种启发式算法进行对比,结果表明,HFOA适用于均质土悬臂支护基坑、成层土和含软弱夹层的桩锚支护基坑,相较于遗传算法等6种算法具有更快的收敛速度、更高的收敛精度和可靠性,为深基坑临界滑动面搜索提供了一种新的求解策略.