一种多线程禁忌搜索算法
A mutli-thread tabu search algorithm
摘要：
本文介绍了一种新的改进禁忌搜索算法，已实施，试图提高搜索的鲁棒性时，应用到特别复杂的问题。在这种方法中，两个禁忌搜索并行进行。每个搜索线程的特点是它自己的短期记忆，这迫使指出了局部最优。然而，这两个搜索线程共享一个中间项记忆，因此允许在它们之间传递一定程度的信息。结果为无约束和约束数值函数，以及在液压回路优化领域的一个问题。通过将优化算法与商业仿真软件包ECOFP相连接，实现了液压回路性能的仿真。
英文摘要：
This paper describes a novel refinement to a Tabu search algorithm that has been implemented in an attempt to improve the robustness of the search when applied to particularly complex problems. In this approach, two Tabu searches are carried out in parallel. Each search thread is characterised by it's own short term memory which forces that point out of local optima. However, the two search threads share an intermediate term memory so allowing a degree of information to be passed between them. Results are presented for both unconstrained and constrained numerical functions as well as a problem in the field of hydraulic circuit optimization. Simulation of hydraulic circuit performance is achieved by linking the optimization algorithm to the commercial simulation package Bathfp.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
