assignment problems meaning in Chinese
指派问题
Examples
- 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
摘要蚁群算法作为一种较新的进化类方法，目前已经在若干领域取得了成功的应用，诸如：旅行商问题、二次分配问题、通讯网络中的路由问题以及负载平衡问题、大规模集成电路设计等。 - By this algorithm , the optimal solution can been obtained in transportation problem n assignment problem , traveling salesman problenu flow shop sequencing problems hamilton problem . in addition , numerical examples have been given to demonstrate the actual applicant procedure
并且通过对排序问题、货郎担货问题、指派问题、 hamilton问题等线形规划问题典型算例的求解，表明新的分配原则在一定程度上简化了原有的分配过程，具有更强的通用性。 - An algorithm to resolve the coupling effect problem is proposed during the cross point assignment ( cpa ) stage . in the algorithm , the priority queue concept and the rip - up and reroute strategy are combined to control crosstalk noise caused by interconnect coupling capacitance . first , the nets are arranged into different priority queues according to their weighted sum of their length and criticality . then , the cpa problem for one queue of nets is translated into a linear assignment problem . after the assignment of one queue of nets , a post - cpa checking routine is performed to check and rip up the net pairs which violate the crosstalk noise constraint and then push them into the next queue to be reassigned . the algorithm is tested by a set of bench mark examples , and the experimental results are promising
提出了一种在过点分配阶段解决噪声耦合效应问题的算法.该算法采用优先队列同拆线重布策略相结合的方法,控制由互连线耦合电容引起的串扰噪声.算法中,首先按照线长和约束限制,将线网划分到若干个优先队列中.然后,将每个优先队列的过点分配问题转换为线性分配问题.在完成一个线网队列的分配后,通过过点分配后处理过程检查串扰约束满足情况,对违反约束的线网对进行拆除,放入后续线网队列进行重新分配.实验数据表明,该算法能够取得好的效果 - We have found that many application of linear programming , such as assignment problem . , traveling salesman problem , flow shop sequencing problem , hamilton problem and so on , fall into the category of transportation problem , that is , of shipping at minimum total cost a homogeneous good from a set of m warehouses to a set of n markets
元素判别值分配法是基于运输问题引发出的通用解法，通过遍历调运表中的各行各列计算出每个元素的分配优先权重? ?元素判别值，然后依据元素判别值，根据调配原则进行元素分配，使得分配方案在多数情况下一次分配即可获得最优解，但目前仍需要完善。 - Dynamic assignment problem in a large cellular system can be formulated as an dynamic programming problem , by using java programming to simulate the rl arithmetic and fixed channel assignment , and comparing the blocking probability of them with the conditions of changing the cell configurations and parameters
把一个庞大蜂窝系统中的动态信道分配问题公式化为动态编程问题，采用java程序设计对动态信道分配的rl算法与固定信道分配算法进行仿真，在改变小区配置和不同参数设置的情况下比较了两种信道分配方案的新建通话阻塞率。