您要查找的是不是：
- The applications of ACO to static and dynamic COPs, such as traveling salesman problem, quadratic assignment problem, network routing problem are reviewed. 結合旅行商問(wèn)題、二次指派問(wèn)題以及網(wǎng)絡(luò )路由問(wèn)題等典型組合優(yōu)化問(wèn)題;概述了ACO在靜態(tài)組合最優(yōu)化和動(dòng)態(tài)組合優(yōu)化問(wèn)題中的應用.
- Thirdly the applications of ACA for the combinatorial optimization problems are described,such as TSP,QAP,JSP,VRP,GCP,SOP and the networks routing problem. 然后概述了這種算法在組合優(yōu)化問(wèn)題中的多種應用,諸如旅行商問(wèn)題(TSP)、二次分配問(wèn)題(QAP)、任務(wù)調度問(wèn)題(JSP)、車(chē)輛路線(xiàn)問(wèn)題(VRP)、圖著(zhù)色問(wèn)題(GCP)、有序排列問(wèn)題(SOP)及網(wǎng)絡(luò )由問(wèn)題等。
- ANT COLONY OPTIMIZATION ALGORITHM AND ITS CONVERGENCE FOR WIRELESS SENSOR NETWORK ROUTING PROBLEM 求解無(wú)線(xiàn)傳感器網(wǎng)絡(luò )路由問(wèn)題的蟻群最優(yōu)化算法及其收斂性
- The dissimilar path routing problem is to find out spatial dissimilar paths between source and destination nodes for a given transportation network. 相異路徑選線(xiàn)問(wèn)題考慮的是,給定一運輸網(wǎng)絡(luò )和源宿接點(diǎn),找出源宿節點(diǎn)之間在空間上有差異的路徑。
- The dissimilar path routing problem is to find out spatial dissimilar paths between two specific source and destination nodes for a given transportation network. 相異路徑選線(xiàn)問(wèn)題考慮的是,給定一運輸網(wǎng)絡(luò ),找出某對源宿節點(diǎn)之間的空間上有差異的路徑。
- As one of the latter algorithms, ant colony algorithm has been used to many fields, such as: Traveling Salesman Problem, Quadratic Assignment Problem, Network Routing and Load-Balancing Problem, VLSI Design, etc. 摘要蟻群算法作為一種較新的進(jìn)化類(lèi)方法，目前已經(jīng)在若干領(lǐng)域取得了成功的應用，諸如：旅行商問(wèn)題、二次分配問(wèn)題、通訊網(wǎng)絡(luò )中的路由問(wèn)題以及負載平衡問(wèn)題、大規模集成電路設計等。
- In order to design high-efficient logistics network, location-routing problem (LRP) need to be resolved. LRP is the integration of location-allocation problem (LAP) and vehicle routing problem (VRP). 物流網(wǎng)絡(luò )布局中需要解決的一個(gè)重要問(wèn)題是集成定位-運輸路線(xiàn)安排問(wèn)題,定位-運輸路線(xiàn)安排問(wèn)題是設施定位問(wèn)題和車(chē)輛運輸路線(xiàn)安排問(wèn)題的集成,并且綜合考慮了兩者的相關(guān)性,能夠從整體上優(yōu)化物流系統。
- In order to solve the multi-outgoing campus network's routing problem in Network Address Translation (NAT), a policy routing scheme based on connection tracking information was proposed. 摘要針對網(wǎng)絡(luò )地址轉換(NAT)環(huán)境下多出口園區網(wǎng)絡(luò )存在的路由選擇問(wèn)題，提出了利用連接跟蹤信息來(lái)指導路由判斷的方案。
- When applying platform independence to a closed corporate environment, the headache of complex network routing and bridging multiple proprietary products is eliminated. 當將平臺獨立性應用于封閉的公司環(huán)境時(shí)，多個(gè)專(zhuān)有產(chǎn)品的復雜的網(wǎng)絡(luò )路由連接和橋接等頭疼的問(wèn)題就迎刃而解了。
- Consider the energy consumption of wireless sensor network routing protocol LEACH simulation. 考慮能量消耗的無(wú)線(xiàn)傳感器網(wǎng)絡(luò )LEACH路由協(xié)議仿真。
- Vehicle Routing Problem, or VRP, is a very important sub problem inborn in many distribution systems. 車(chē)輛路徑問(wèn)題(Vehicle Routing Problem，VRP)是物流運輸研究領(lǐng)域內一個(gè)非常重要的問(wèn)題。
- This problem is regarded as the Vehicle Routing Problem with Soft Time Windows (VRPSTW). 此類(lèi)問(wèn)題被稱(chēng)為軟時(shí)窗汽車(chē)路線(xiàn)問(wèn)題(Vehicle Routing Problemwith Soft Time Windows)。
- This maximum hop count greatly restricts the use of RIP in large internetworks but prevents counts to infinity and endless network routing loops. 最大跳躍數大大地限制了RIP于大型互連網(wǎng)路之使用，但避免了無(wú)限計數和無(wú)窮的網(wǎng)路路由迴圈。
- On the basis of describing the vehicle routing problem briefly，a new improved tabu search algorithm is presented. 摘要 簡(jiǎn)要回顧了車(chē)輛路徑問(wèn)題的禁忌搜索算法的發(fā)展現狀，提出了一種改進(jìn)的禁忌搜索算法。
- Both the BGA routing problem and the PCB routing problem are solved based on repeated mincost max-flow computations. 針對球閘陣列封裝以及印刷電路板，我們提出一個(gè)應用重復計算最小成本、最大流量的演算法來(lái)解決繞線(xiàn)問(wèn)題。
- When applying platform independence to a closed corporate environment,the headache of complex network routing and bridging multiple proprietary products is eliminated. 當將平臺獨立性應用于封閉的公司環(huán)境時(shí)，多個(gè)專(zhuān)有產(chǎn)品的復雜的網(wǎng)絡(luò )路由連接和橋接等頭疼的問(wèn)題就迎刃而解了。
- Then an instance of vehicle routing problem (VRP) is put forward and solved to confirm their validity. 通過(guò)對蟻群算法的改進(jìn)和調整，構造出最大-最小蟻群算法，實(shí)例驗證該算法能更快地收斂到全局最優(yōu)解。
- This algorithm is of important meaning to solve the routing problem in content-based publish/subscribe system. 算法對解決基于內容的發(fā)布訂閱系統中相關(guān)的路由問(wèn)題具有重要的作用和意義。
- These control algorithms can be divided into three categories: Network Routing Algorithm, Network Congestion Control Algorithm and Network QoS Control Algorithm. 這些網(wǎng)絡(luò )控制算法大致可分為三大類(lèi):網(wǎng)絡(luò )路由算法、網(wǎng)絡(luò )擁塞控制算法、網(wǎng)絡(luò )服務(wù)質(zhì)量(QoS)控制算法。
- A tabu search algorithm for the capacitated open vehicle routing problem is proposed. 提出了一種用于求解帶裝載能力約束的開(kāi)放式車(chē)輛路徑問(wèn)題的禁忌搜索算法。
