禁忌搜索 的英文怎麼說

中文拼音 [jīnjìsōusuǒ]
禁忌搜索 英文
tabu search
  • 禁 : 禁動詞1. （禁受; 耐） bear; stand; endure 2. （忍住） contain [restrain] oneself
  • 忌 : 動詞1 （忌妒 ） be jealous of; envy 2 （怕; 顧忌） fear; dread; scruple 3 （認為不適宜而避免; 禁...
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 禁忌 : 1 （犯忌諱的話和行動） taboo 2 （戒） avoid; abstain from 3 [醫學] contraindication; 禁忌詞 taboo...
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. The capacitated open vehicle routing problem and its tabu search algorithm

    帶裝載能力約束的開放式車輛路徑問題及其禁忌搜索演算法研究
  2. A tabu search algorithm for the capacitated open vehicle routing problem is proposed

    提出了一種用於求解帶裝載能力約束的開放式車輛路徑問題的禁忌搜索演算法。
  3. Crossover tabu search for traveling salesman problem

    一種求解旅行商問題的交叉禁忌搜索
  4. Tabu search technique for solving the routing problem

    禁忌搜索演算法用於解決網路路由問題
  5. Multiuser detector based on genetic algorithm and tabu search

    基於遺傳演算法和禁忌搜索的多用戶檢測器
  6. Heuristics algorithm for knapsack problem based on the tabu search

    基於禁忌搜索的啟發式求解背包問題演算法
  7. Tabu search ( ts ) algorithm is a meta - heuristic algorithm

    禁忌搜索演算法（ tabusearch ， ts ）是一種亞啟發式搜索演算法。
  8. Heuristics decision algorithm for mission path planning based on tabu search

    基於禁忌搜索的啟發式任務路徑規劃演算法
  9. An algorithms with taboo search in traveling salesman problem

    一種求解旅行商問題的禁忌搜索演算法
  10. By setting the properties of switches in each loop corresponding to the tie switch, the ts searching areas of each loop are made " independent " to each other. in this way the solution areas are made continuous and the dimensions of solution areas are decoupled by numbers of tie switch

    通過設置各環網中常閉分段開關的屬性，將各個環網的禁忌搜索鄰域「獨立」 ，使解空間連續並按聯絡開關個數分解，從而很好的發揮禁忌演算法尋優效率高和全局尋優的特點。
  11. The proposed genetic - tabu algorithms, which are based on the parallel search main flame provided by genetic algorithms, integrating biology evolution of genetic algorithms and local search of tabu search which can avoid circuit search, can solve global optimization problems quickly

    本文提出的遺傳禁忌搜索演算法基於遺傳演算法提供的并行搜索主框架，結合遺傳群體進化和禁忌搜索演算法較強的具有避免迂迴搜索能力的鄰域搜索，可以實現快速全局優化。
  12. Reactive tabu search algorithm for time - dependent vehicle routing problem with backhauls

    適應性禁忌搜索演算法求解帶回程的時變速度車輛路徑問題
  13. Combining tabu search and fuzzy neural networks has the wide application prospect in the fields of control, signal processing etc

    禁忌搜索演算法和模糊神經網路的結合在控制、信號處理等領域具有廣闊的應用前景。
  14. But as a good optimization method, the researches on using tabu search as the learning algorithms for fuzzy neural networks are very few

    然而，目前使用禁忌搜索演算法作為模糊神經網路參數學習演算法的研究卻不多見。
  15. Recently researches show that tabu search has the equivalent ( even better ) capability to genetic algorithms and simulated annealing

    近年來的研究表明，禁忌搜索演算法具有遺傳演算法、模擬退火演算法相當的性能甚至更優越。
  16. According to the shortage of the results given in this thesis, some comments on the improvement of the main frame of the tabu search algorithm are presented

    文中還提出了個人對禁忌搜索演算法思想框架的一點改進意見。
  17. This means that according to memorial frequency information the tabu length and the number of candidates are adaptively adjusted, and multitask parallel technology is realized through the arrangement of the search assignment

    將自適應機制和并行技術引入禁忌搜索演算法中，根據記憶頻率信息自適應調整禁忌長度與候選集規模，通過搜索任務並分配安排形成多任務并行處理。
  18. The main research work of dissertation can be concluded as follows : 1. two kinds of hybrid strategies of genetic algorithms and tabu search are discussed systematically in this paper. the idea of tabu search is introduced to improve crossover operator and mutation operator of genetic algorithms for the first strategy, while tabu search is executed to a certain proportional selected individuals in the population after genetic evolution of every generation for the second strategy

    本文的主要研究成果概括如下: 1 .論文比較系統地探討了遺傳演算法和禁忌搜索演算法的兩種混合策略:第一種是利用禁忌搜索的思想來改進遺傳演算法的交叉運算元和變異運算元;第二種是對每代中交叉變異后得到的新種群中的一定比例的個體進行禁忌搜索處理。
  19. And we provide a rule to set the parameter of the algorithm. a new method to solve hammerstein model using tabu search is also introduced. the conception of searching area is defined and the strategy of choosing neighboring points is given

    本文提出了一種利用改進型禁忌搜索演算法來解決hammerstein模型辨識問題的方法，定義了搜索域空間，給出了鄰點確定策略，提出演算法流程，並通過大量的模擬實驗，得出針對hammerstein模型合適的禁忌列表長度，可能解列表長度，以及合適的被劃分鄰域的數目。
  20. According to the rules and considerations which are based and taken into account in the practical work, this paper proposes a new model for distribution maintenance scheduling which intends to find the most economical maintenance schedule without violating any restrictions and also the paper makes a deep research of ga, sa and ts. by constructing two effective instructive rules which derive from the feature of distribution maintenance schedule and introducing ts into mutation operation of ga in the earlier generations, the proposed method improves the convergence of optimization and shortens the calculation time. the proposed model and method are applied to a practical system, and numerical results verify ' the correctness and validity of them

    本文結合實際電力調度計劃工作中檢修計劃的制定原則和所要考慮的各種因素，抽象出適合配電網檢修計劃優化的數學模型：對遺傳演算法、模擬退火演算法以及禁忌搜索演算法等多種演算法進行了研究和分析比較，針對遺傳演算法的不足提出了通過對實際問題的分析抽象出一定規則指導演算法在解空間進行搜索和兩階段變異運算元兩項改進措施，並應用於配電網檢修計劃優化，編制了相應的應用軟體；應用該軟體對我國南方某地區供電局某月的檢修計劃進行優化的結果表明，本文所提出的模型和改進的優化方法是正確和有效的。
分享友人
分享到 Line

分享到臉書