说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 禁忌搜索(TS)
1)  tabu search (TS)
禁忌搜索(TS)
2)  Tabu Search
禁忌搜索
1.
Neural network ensembles based on tabu search;
基于禁忌搜索的神经网络集成
2.
An improved tabu search for reconfiguration of distribution systems;
基于改进禁忌搜索的配电网重构
3.
Application of tabu search to calculating safety factor of slope stability;
禁忌搜索在确定土坡危险滑动面中的应用
3)  Taboo Search
禁忌搜索
1.
Application of Hybrid Taboo Search to lake eutrophication evaluation;
混合禁忌搜索算法在湖泊富营养化评价中的应用
2.
PP model based on taboo search and its application to evaluating water resources;
禁忌搜索优化的投影寻踪及其在水资源评价中的应用
3.
An algorithm based on taboo search method for job shop scheduling;
一种基于禁忌搜索方法的作业车间调度
4)  tabu search algorithm
禁忌搜索
1.
Voltage and reactive power control based on tabu search algorithm for substations;
基于禁忌搜索算法的变电站电压无功优化控制
2.
At the same time, the problem is solved by means of the tabu search algorithm.
通过禁忌搜索智能算法进行仿真计算 ,结果验证了算法的有效
3.
Then a hybrid heuristic algorithm(HHA) is proposed to solve the model,which uses the tabu search algorithm to establish the binary variables and a genetic algorithm based on priority weight coding to solve multi-stage transportation problem.
该算法用禁忌搜索法确定整型变量,用基于优先权的遗传算法解决多阶段运输问题。
5)  tabu search(TS)
禁忌搜索
1.
The mathematical model and example about the problem are built,an improved Tabu Search(TS) is designed to solve the problem.
建立了问题模型,运用改进的禁忌搜索算法测试了算例。
2.
Based on the Matching Pursui(tMP) method signal sparse decomposi-tion algorithm,Genetic Algorithm(GA) and Tabu Search(TS),which combines quick find MP process every step of the best atomic decomposition.
利用基于Matching Pursui(tMP)方法实现的信号稀疏分解算法,采用遗传算法(GA)和禁忌搜索(TS)相结合,快速寻找MP过程中每一步分解的最佳原子,最后再利用原子的特性进一步的优化。
6)  tabu search algorithm
禁忌搜索法
1.
Aimed at the complexity of third party inventory routing problem,a genetic algorithm embedded by tabu search algorithm is prop.
首先对配送间隔进行编码,然后用禁忌搜索法计算每天需要配送的车辆路线问题。
补充资料:带禁忌的转移


带禁忌的转移
transition with prohibitions

  带禁忌的转移ltr吐dd佣铺山户而肠山璐;肚Pexo几C,朋pe城ea”.M加],带禁忌状态的转移(加田51七onwithta饮洲〕s七立众‘),对于Ma琳oB链的 在给定的时间区间内从未进人一个特定的状态集的MaP劝.链〔MaJ傲。vclujn)的轨道集.例如,令以t)是离散时间Ma伴阳链,其状态集为S,而H是“禁忌’状态集(禁忌集)(tal众〕set)),则禁忌概李(ta腼卿恤b山石。),夕‘,(‘)是H夕,(芯)二p{看(k)堵H(k二l,…,t一), 亡(t)二J}寸(O)二j},i,j任5.禁忌概率,P,j(约的性质类似于通常的转移概率(han-sitionPro加城毗)P,j〔t)的性质,因为矩阵族尸‘t)二}}夕,)(t){}卜,。、和p,,(t)一}{。p:,(t){},,,、、\。,r)0,形成乘法半群;不过,艺,‘、夕,了(:)一l,而艺,;,、,了(亡)乓1各种各样的问题,例如,对Ma琳阳链首次进人给定集合的时间或对分支过程(brdnchiogp~防)在非灭绝条件下的极限定理的研究,事实上相当于对禁忌概率各种性质的研究.
  
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条