组合最优化 meaning in Chinese
combinatorial optimization
Examples
- Grouping problem is combinatorial optimization problem which is effective to solve by genetic algorithm
成组技术问题是组合优化问题,而遗传算法正是目前求解组合最优化的有效方法之一。 - The shift arrangement problem belongs to the domain of combination optimization and plays an important role in airlines ’ operating control
机组排班问题是属于组合最优化的问题,在航空公司的运营控制中占有重要地位。 - Three - dimensional component packing is a combinatorial optimization and np - complete problem . it is difficult to find its exact global optimum
三维布局问题属于组合最优化问题和np完全问题，在一定时间内求其精确全局最优解是相当困难的。 - 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问题和旅行售货员问题有关，同时在水、电供应网络和通讯网络等设计中也有非常广泛的应用，所以对该问题的研究具有重要的意义。 - 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完全问题，具有高度复杂性，用一般的数学方法根本无法求解，目前解决三维布局问题多为各种启发式方法，本文在对启发式方法进行深入探讨的基础上，采用了用于解决一般三维布局问题的模拟退火算法作为布局系统的操作算法。