鄰域搜索 的英文怎麼說

中文拼音 [līnyùsōusuǒ]
鄰域搜索 英文
neighbor search
  • 域 : 名詞（在一定疆界內的地方; 疆域） land within certain boundaries; territory; region
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. In this paper we improved the traditional sa algorithm, and the heuristic algorithm is applied to the search and move schedule. the neighborhood is changed from the fixable to the alterable, the operation of moving and rotating is alternate, and the precision of the solution is then guaranteed as well as its convergence speed

    本文對傳統的sa演算法進行了改進，在演算法的搜索策略和變動策略中應用了啟發式方法，由定鄰域搜索變為變鄰域搜索，平移和旋轉變動交替進行，既保證了解的精度又提高了其收斂速度，取得了良好的布局效果。
  2. Then, the associated search optimal algorithm based on virtual avl tree is promoted to rapidly reconstruct the half - edge topological structure. 3. to rebuild the tooth surface from the littery measure data, the membrane deformation algorithm based on loop subdivision is given to fit density triangle meshes to subdivision surface

    前者巧妙、高效地完成了去除冗餘點的工作，將stl數據的存儲尺寸壓縮為原來的18 % 25 % ;後者完成了數據的半邊拓撲重建，使得后續對于邊界邊搜索、 1環鄰域搜索顯示出較好的優勢，實現了三角網格模型的快速拓撲重建。
  3. Three steps of the method are, first, genetic algorithm is adopted in the whole planning area to hunt the possible traverse sequence of the substations ; second, the least weight match algorithm in graph theory is adopted to optimize the tie lines between each substation and its neighbors according to the traverse sequence determined in the first step ; finally, the scheme which has the least cost of investment in tie lines will be taken as the ultimate scheme

    第一層優化是在整個規劃區域內，應用遺傳演算法搜索可能的變電站的遍歷順序；第二層優化是按照第一層優化確定的遍歷順序，應用綱絡圖論中的最小權匹配演算法分別對每一個變電站與其相鄰站之間的聯絡線進行優化。
  4. Neighborhood integer point search method to solve integer programming

    鄰域整點搜索法求解整數規劃
  5. The role of the marine police is to maintain the integrity of the sea boundaries and regional waters of the hksar. it is responsible for enforcing the laws of hong kong in regional waters ; preventing illegal immigration by sea ; search and rescue in hong kong and adjacent waters ; and casualty evacuation

    水警的職責是維持香港特別行政區海上邊界及水域的治安，在本港水域執行香港法例、防止水路非法入境活動、負責本港及鄰近水域的搜索和拯救工作，以及運送死傷者。
  6. The role of the marine police is to maintain the integrity of the sea boundaries and regional waters of the hksar. it is responsible for enforcing the laws of hong kong in regional waters ; preventing smuggling and illegal immigration by sea ; search and rescue in hong kong and adjacent waters ; and casualty evacuation

    水警的職責是維持香港特別行政區海上邊界及水域的治安，在本港水域執行香港法例、防止水路走私及非法入境活動、負責本港及鄰近水域的搜索和拯救工作，以及運送死傷者。
  7. The paper details the objective, types and present research of production scheduling, discusses the current research state of the flow shop scheduling and the relative algorithm of this type of problem, pinpoints existing disadvantages, and then provides the generalization of ordinal coding of genetic algorithm and genetic computing element based on the order

    本文詳細介紹了生產作業調度問題的目標、類型及研究現狀，並著重就流水型作業調度問題的研究現狀和該類問題的數學模型與相關演算法，如啟發式方法、進化演算法、鄰域搜索方法等進行了探討，指出了存在的問題。
  8. After a short - term load forecasting method based analogous and linear extrapolation is proposed, the load forecast and the priority of equipment action are led into static reactive power optimization. the aim function is constructed for the practical situation of power system. on the basis of traditional genetic algorithm the fitness function and the holding of population diversity are improved

    在提出基於相似日和線性外推的短期負荷預測新方法的基礎上，將負荷預測和設備動作優先級引入靜態無功優化中，並結合電網實際情況，構造了實用的目標函數，對遺傳演算法的適應度函數和群體多樣性的保持進行了改進，採用鄰域搜索運算元增加遺傳演算法的局部尋優能力。
  9. A hybrid genetic algorithm based on neighborhood search in resource - constrained project scheduling problem

    資源受限項目調度中基於鄰域搜索的混合遺傳演算法
  10. It is a global search algorithm which combines the respective advantages of hybrid genetic algorithm and neighborhood search algorithm

    它綜合了遺傳演算法和鄰域搜索演算法各自優勢的全局搜索演算法。
  11. The paper based on the idea of k - opt algorithm for tsp, present a swap algorithm for the one - dimensional cutting - stock problem

    摘要根據旅行商問題（ tsp ）的鄰域搜索演算法的思想，提出了型材下料問題的一種優化演算法。
  12. Based on ant algorithm with its mechanisms of transfer search and adjacent domain search, an ant algorithm model for the short - term optimal operation of hydropower station is constructed

    摘要利用螞蟻演算法的轉移搜索和鄰域搜索機制，構造了水電站短期優化運行螞蟻演算法模型。
  13. Secondly, based on the analysis of the relationship between the processing tasks, a hybrid algorithm combined the filtered beam search algorithm with the local search algorithm is proposed

    其次，在對工序任務之間的邏輯關系深入分析的基礎上，提出一種基於過濾束演算法思想與基本鄰域搜索演算法相結合的混合演算法。
  14. Based on analysis and comparison of the existed biochip image segmentation methods, the adaptive circle segmentation algorithm combined with the neighborhood searching algorithm is realized to biochip image segmentation

    在分析並比較了現有生物晶元圖象分割方法的基礎上，採用自適應圓形分割法，結合鄰域搜索演算法，實現了對生物晶元圖象的分割。
  15. We develop a adaptive evolutionary algorithm based on neighborhood searching. firstly, class the individuals by the fitness number to realize the division of population. secondly, mutate each individual, that is mutating a good individual in a small range and a bad individual a large range

    本文設計了一種基於鄰域搜索的自適應演化演算法：首先將種群中的個體按適應值分級，實現對種群中的優勢個體與劣勢個體的分割。
  16. The local search procedure based on several critical block based neighborhood structure is hybrid with aco _ stag algorithm, comparisons with other well - performed algorithms on taillard ' s benchmark problems show that the hybrid algorithm performs better

    給出了fiowshop問題的幾種基於關鍵路徑的鄰域結構，並把蟻群演算法與鄰域搜索相結合構成混合演算法，與其他演算法在taillard流水作業調度測試問題集上的比較試驗表明，混合演算法性能更優。
  17. 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

    本文提出的遺傳禁忌搜索演算法基於遺傳演算法提供的并行搜索主框架，結合遺傳群體進化和禁忌搜索演算法較強的具有避免迂迴搜索能力的鄰域搜索，可以實現快速全局優化。
  18. This hybrid algorithm take advange of local search of pattern search and whole search of genetic algorithm. it first confines the direction of large scale search to the area of high fitness by genetic algorithm, and then utilizes pattern search to search in the small area got by the searching of genetic algorithm., thereby the optim value is got

    該方法利用了單純形法的局域搜索能力和遺傳演算法的全局搜索能力，通過遺傳演算法控制大范圍搜索的方向，使得搜索向著適應度值高的區域發展，再通過單純形法在遺傳演算法搜索到的區域內進行小范圍的鄰域搜索，從而能夠得到高適應度值域的最優值。
  19. Pretreatment is used to generate alternate activities to achieve the requirements. theproblem after pretreatment is characterized as a constraint satisfaction problem, which is solvedby the local search algorithm based on dynamic priority. the solution means to specifycorrespondingactivitiesforeveryrequirementandtoallocateexecutingtimeandresources. in order to validate the modeling framework presented in this paper, a software system isdesigned to implement the mission planning and scheduling for msrs

    預處理過程自動生成完成任務需求的候選活動集;預處理之後的問題被描述為一個約束滿足問題，通過基於動態優先級的局部鄰域搜索演算法完成問題的求解，即為每個需求指定相應的活動，並為這些活動安排執行時間並指派資源。
  20. The main idea of this hybrid algorithm is : at first, all candidates in task collection is lined according to a dispatching rule ( earliest due date, edd ), then this linear queue is divided into some tiers under a criterion that partial order is not allowed to exist in the every tier, many feasible sequences is generated by constructing a neighborhood of a initial sequence in every tier, the allocation of the resources over time is conducted to perform every feasible task sequence, and a set of approximate optimal scheduling schemes is achieved as the precondition of the next tier ’ s disposal in meeting multiple scheduling objectives to obtain the global near - optimal schedule which makes these program run tier by tier until the last task is completed

    該演算法按照最早完工時間優先（ ect ）分派規則，先將參加排序的工序合併成一個串列序列，然後按照同層內不存在偏序關系的原則，將其分解為若干個時間上相互銜接的層次，在每個層次內部，通過構造鄰域產生出多個可行序列，對每個可行序列進行設備配置，採用鄰域搜索演算法進行方案的尋優，保留一組滿足評價要求的可行方案作為下一層設備配置的背景環境，通過層層遞進最終獲取全局的近似最優解。
分享友人
分享到 Line

分享到臉書