combinatorial optimization problem 中文意思是什麼

combinatorial optimization problem 解釋
組合最優化問題
  • combinatorial : 組合的
  • optimization : n. 最佳化，最優化。
  • problem : n. 1. 問題，課題；疑難問題；令人困惑的情況。2. 【數、物】習題；作圖題。3. （象棋的）布局問題。adj. 1. 成問題的；難處理的。2. 關于社會問題的。
  1. Vsp is both a pivotal tache in logistic distribution optimization and indispensable in electronic commerce. it can increase logistic economic benefit and realize logistic rationalization. the systemic study on the theory and method of vsp is the base on the growth of logistic intensivism, the establishment of modem chain of command, the development of its and ec. now, the problem is not only applied to the field of auto transportation, but also to ship avigation communication electricity industry management computer application etc. the algorithm has been applied into many combinatorial optimization problems such as the trainman ' s shift arrangement in avigation the optimization design of cargo arrangement in ship company

    對貨運車輛進行調度優化，可以提高物流經濟效益、實現物流科學化。對貨運車輛調度優化理論與方法進行系統研究是物流集約化發展、建立現代調度指揮系統、發展智能交通運輸系統和開展電子商務的基礎。目前，問題的形式已有很大發展，該問題以不僅僅局限於汽車運輸領域，在水運、航空、通訊、電力、工業管理、計算機應用等領域也有一定的應用，其演算法已用於航空乘務員輪班安排、輪船公司運送貨物經過港口與貨物安排的優化設計、交通車線路安排、生產系統中的計劃與控制等多種組合優化問題。
  2. Dp technique is a high efficiency algorithm to solve combinatorial optimization problems by divided the multidimensional problem into multiple 1 - dimension problems. when this technique resorts to accumulate multiple frames, there are some disadvantages

    動態規劃演算法是一種解決組合尋優問題的高效演算法，通過將n維問題變換為n個一維優化問題，一個一個地求解的方法，很好的提高了效率。
  3. It can be boiled down to combinatorial optimization problem in mathematics. on the basis of summarizing the complexity and structural features of hmb and rules of its design and manufacture and analyzing the spatial relationship in 3d layout of hmb, the expressions of relevant variants are put forward using the object - oriented approach

    在全面總結液壓集成塊設計問題的復雜性特點，以及集成塊類零部件的結構特徵和設計、製造信息組成規律的基礎上，本文深入分析了集成塊立體布局的空間關系，用面向對象方法定義了與該問題有關的特徵變量的示性表達式，給出優化目標和約束條件，進而確立了集成塊設計問題的數學優化模型。
  4. The cast grouping and ordering problem of steelmaking continuous casting hot rolling ( sm - cc ) is a combinatorial optimization problem

    摘要煉鋼-連鑄生產的澆次組合與排序是帶有工藝約束的并行機流水車間調度問題。
  5. Traveling salesman problem is combinatorial optimization problem in graph theory, it has npc computation complexity, and lots of problem can transfer to traveling salesman problem. the computation of tsp is analyzed, then the hopfield network method for solving tsp is given, at last we solve 10 - citys traveling salesman problem and chinese traveling salesman problem by using chaos neural network modeling

    首先分析了旅行商問題在窮舉搜索法下的工作量；其次給出了求解旅行商問題的hopfield神經網路方法，同時分析了利用人工神經網路求解旅行商問題所存在的問題；最後利用混飩神經網路模型求解10城市旅行商問題和中國旅行商問題。
  6. On the vehicle dispatching problem in combinatorial optimization

    關于組合優化中的車輛調度問題
  7. Grouping problem is combinatorial optimization problem which is effective to solve by genetic algorithm

    成組技術問題是組合優化問題，而遺傳演算法正是目前求解組合最優化的有效方法之一。
  8. Three - dimensional component packing is a combinatorial optimization and np - complete problem. it is difficult to find its exact global optimum

    三維布局問題屬于組合最優化問題和np完全問題，在一定時間內求其精確全局最優解是相當困難的。
  9. This problem has vide applications in real areas, such as the design of water and electricity supply networks, and communication networks, etc. at the same time, the problem is also closely related with some classical combinatorial optimization problems, including the steiner problem and the travelling salesman problem, which are well - known. so, it is of great importance to study it

    所謂歐幾里德2 -連通steiner網路問題，就是對于給定的平面點集p ，確定它的長度最小的2 -連通steiner網路，該問題與組合最優化中著名的steiner問題和旅行售貨員問題有關，同時在水、電供應網路和通訊網路等設計中也有非常廣泛的應用，所以對該問題的研究具有重要的意義。
  10. Three - dimensional packing ( tdp ) is a combinatorial optimization and hp - complete problem and applied widely to the mechanical manufacture and traffic transportation industries. up to now there are varieties of heuristic algorithms to solve the tdp because of its high complication, we discuss the heuristic algorithm deeply in this paper and apply the simulated annealing ( sa ) algorithm to the packing system

    三維布局問題屬于組合最優化問題和np完全問題，具有高度復雜性，用一般的數學方法根本無法求解，目前解決三維布局問題多為各種啟發式方法，本文在對啟發式方法進行深入探討的基礎上，採用了用於解決一般三維布局問題的模擬退火演算法作為布局系統的操作演算法。
  11. Analyzed the similarity between scheme solving problem and traveling salesman problem ( tsp ), the scheme solving problem for conceptual design is transformed into an optimal path problem in combinatorial optimization, where the dynamic programming based solution space model and the longest path based optimization model are developed

    摘要通過分析概念設計方案求解問題與旅行商問題的相似性，將方案求解問題轉化為組合優化的最優路徑問題，建立了基於動態規劃的解空間模型和基於最長路徑的優化模型。
  12. To solve the combinatorial optimization problem of outer layout and inner connection integrated schemes in the design of hydraulic manifold blocks ( hmb ), an intelligent virtual design method was proposed with combining modern intelligent optimization methods with virtual design technology

    摘要為解決液壓集成塊設計中外部布局和內部布孔集成的組合優化問題，提出了一種融合現代智能優化方法和虛擬設計技術的智能虛擬設計方法。
  13. In addition, simulated annealing algorithm for the combinatorial optimization problem here is also given

    此外，利用模擬退火演算法成功地解決了該組合優化問題。
  14. The optimization of gear parameters in designing movements of clocks and watches is a combinatorial optimization problem. it is difficult to solve the problem

    鐘手錶機芯設計中齒輪參數的優化設計問題是一個組合優化問題，很難用傳統優化方法解決。
  15. Scheduling is one kind of important combinatorial optimization problem, which use some processors, machines or resources to accomplish optimally a batch of given tasks or jobs

    排序問題研究的是若干個任務要在一些機器上進行加工，如何安排機器和任務使得某些要求（目標函數）達到最優的問題。
  16. Recently, genetic algorithm has been tyied to resolve variable combinatorial optimization problems, such as job scheduling problem, but but has began just now in vsp

    近些年來，人們在用遺傳演算法解決現實中的各種組合優化問題上進行了探索，如在生產調度問題中的應用，但在車輛調度問題中的應用才剛剛開始。
  17. The pheromone - based parameterized probabilistic model for the aco algorithm is presented as the solution construction graph that the combinatorial optimization problem can be mapped on. based on the solution construction graph, the unified framework of the aco algorithm is presented. an iterative update procedure of the solutions distribution in the problem ' s probabilistic model is proposed, that will converge to the optimal solutions with probability one, then the minimum cross - entropy pheromone update rule is proposed to approximate the iterative update procedure by minimizing the cross - entropy distance and monte - carlo sampling

    基於解空間參數化概率分佈模型，首先提出了一個以概率1收斂于最優解的解空間概率分佈的迭代更新過程，然後提出了通過最小化不同分佈間的交互熵距離以及蒙特卡洛采樣來逼近此迭代過程的最小交互熵信息素更新規則，接著分別給出了弧模式以及結點模式信息素分佈模型下的最小交互熵等式。
  18. The maximum clique problem ( mcp ) is a classical combinatorial optimization problem which belongs to np - hard, and many practical problems can be formulated to it. therefore, studying the mcp is full of significance both in theory and in practice

    最大團問題是一個經典的np難的組合優化問題，很多實際問題都可以抽象為對無向圖上最大團問題的求解，所以，對最大團問題的研究無論在理論上還是實際上都有重要意義。
分享友人
分享到 Line

分享到臉書