ant colony optimization 中文意思是什麼

ant colony optimization 解釋
蟻群演算法
  • ant : n. 螞蟻。 have ants in one's pants (因焦急,氣憤等而)坐立不安,急於採取行動。
  • colony : n 1 殖民地;【希史】殖民城市;【羅史】征服區駐防地。2 殖民[移民]團。3 僑居地,僑民區;〈集合詞〉...
  • optimization : n. 最佳化,最優化。
  1. The principle and application of ant colony optimization

    蟻群優化演算法的原理及其應用
  2. An adaptive ant colony optimization algorithm and simulation

    一種自適應蟻群演算法及其模擬研究
  3. Ant colony optimization algorithm for nonlinear integer programming

    非線性整數規劃的蟻群演算法
  4. Artificial ant colony optimization for intersection signal timing

    交叉口信號配時的人工螞蟻優化
  5. Application of composite ant colony optimization to two - layer pcb routing

    布線的混合螞蟻優化方法
  6. A new ant colony optimization algorithm for stochastic loader problem

    隨機裝卸工問題的新型變異蟻群演算法
  7. An ant colony optimization algorithm of resource scheduling based on petri net

    建模的資源調度的蟻群演算法
  8. Ant colony optimization algorithm and application in mechanical optimal design

    螞蟻演算法及其在機械優化設計中的應用
  9. Partner selection of agile supply chain based on ant colony optimization algorithm

    基於蟻群演算法的敏捷供應鏈夥伴選擇
  10. Ant colony optimization algorithms ( acoas ) were appropriate for this optimization problem

    採用蟻群演算法求解調度模型。
  11. This paper develops an ant colony optimization approach to the orienteering problem, a general version of the well - known traveling salesman problem with many relevant applications in industry

    摘要本研究發展一蟻群最佳化演演算法求解越野賽跑問題,此問題可被視為一廣義之? ?推銷員問題,其應用?圍極為廣泛。
  12. Then, a restricted - aco ( ant colony optimization ) algorithm is proposed to solve the car - sequencing problem with buffer restriction under a round painted body storage, which reaches the objective to minimize the total conveyor stoppage time

    在此基礎上,設計了約束集蟻群演算法求解環型油漆車身緩沖區約束下,以傳送帶中斷時間最短為目標的汽車製造排程問題。
  13. The rectilinear steiner minimal tree rsmt problem is one of the fundamental problems in physical design, especially in routing, which is known to be np - complete. this paper presents an algorithm, called aco - steiner, for rsmt construction based on ant colony optimization

    製造工藝由超深亞微米vdsm進入到納米nanometer階段,作為物理設計physical design重要階段之一的布線routing ,其演算法研究與工具設計面臨新的挑戰。
  14. A novel optimization method by simulated evolutions - ant colony optimization algorithm and its application in the unit commitment problem ( uc ) are exploringly investigated in this thesis

    本文引入最近幾年才提出來的一種新型模擬進化優化演算法-蟻群優化演算法,並以機組最優啟停問題為研究對象,對演算法本身及其在最優啟停問題中的應用進行探索性工作。
  15. The main achievements are as follows : according to the stochastic mechanism, a novel ant colony optimization algorithm with random perturbation behavior ( rpaco ) is presented in this paper. the new algorithm includes two important aspects : a amplify factor formulated by inverse exponent function is developed, which is used to avoid premature, on the other hand, corresponding transition strategy with random selection and perturbation behavior is designed, which is designed to prevent the algorithm from stagnating

    主要成果有:從隨機優化技術出發,提出了一種新穎的隨機擾動蟻群優化演算法,該演算法包含了兩個重要方面:一是提出了採用倒指數曲線來描述的放大因子,可以有效地防止早熟;二是設計出了相應的隨機選擇策略和擾動策略,避免演算法陷入停滯。
  16. Aco - steiner : ant colony optimization based rectilinear steiner minimal tree algorithm

    Aco - steiner :基於蟻群優化策略的最小直角steiner樹構造演算法
  17. Rectilinear steiner minimal tree rsmt, routing, physical design, ant colony optimization

    本文根據蟻群優化策略aco ,提出了一個rsmt的構造演算法,稱為aco - steiner 。
  18. Due to the flexible process inside the manufacturing cell, first of all, production cost model is set up, secondly, based on the dynamic pheromone updating, a developed ant colony optimization algorithm is described in detail. with aim to reduce collaboration with the external partners as well as to decrease the total manufacturing cost, and to balance the production process, this algorithm ensures the

    針對單元內部工藝加工路徑可變而具有一定柔性的情況,建立了柔性工藝路線生產單元的系統耗費,給出了採用信息素動態更新策略的蟻群優化演算法步驟,以解決保證工件交貨期和保障設備均勻生產,減少外協量為目標的作業調度問題。
  19. The swarm intelligence algorithm includes ant colony optimization ( aco ) and particle swarm optimization ( pso )

    群體智能演算法包括蟻群演算法和微粒群演算法。
  20. Illustration results showed vehicle route length by the hybrid algorithm to be less than ant colony optimization

    實例求解結果表明,用該混合演算法優化的車輛總路徑長度小於用蟻群演算法求得的結果。
分享友人