1) Jinyou combinations
金优组合
2) Theory of optimized financial portfolio
最优金融资产组合
4) optimal combination
优化组合
1.
Characteristics and optimal combination of pulping technology and equipment in bleached chemimechamical pulp;
漂白化机浆制浆工艺与装备的特点及优化组合
2.
Research on weight optimal combination particle filter algorithm
权值优化组合粒子滤波算法研究
3.
Through further optimal combination of refining and screening equipment, the equipment investment and power consumption can be lowered and the flexibility of pulp adjustment can be increased under the precondit.
通过进一步优化组合磨浆、筛选设备,在保证成浆质量的前提下,降低设备投资和动力消耗,增加浆种调节的灵活性。
5) combinational optimization
组合优化
1.
A kind of quantum genetic algorithm with operation-based encoding and decoding is proposed for solving Job-Shop scheduling problem,a typical NP-hard combinational optimization problem.
提出了一种基于操作方式进行编码和解码的量子遗传算法,并将其用于求解一种典型的NP-hard组合优化问题即Job-Shop调度问题。
2.
In this paper,the problem of the load restoration was studied and it was modeled as a combinational optimization problem with many constraints.
将该问题建模为一个多约束条件的组合优化问题,根据遗传算法特别适合求解大规模组合优化问题的特点,设计了一种粗粒度并行遗传算法来对此优化问题进行求解。
3.
Taking the cabin dimensions,allowed weight and cargo loading rules as constraints,setting the usage of cubage and loading efficiency as objectives,a hybrid genetic algorithm was constructed to solve this typical multi-constraint and multi-objective combinational optimization problem: heuristics were used to determine the layout of cargos in a.
通过对生产实际中散装货船的多品种、大批量货物的配载问题的分析,总结了散装船舶配载问题的特点和钢铁产品的货物堆装规则;以船舶舱容限制、允许重量和货物堆装规则为约束条件,以提高仓容利用率和装载效率为优化目标,构造了一种混合遗传算法来解决此类多目标、多约束的组合优化问题,即①用启发式算法确定各舱货物的具体摆放方式,满足货物装载质量要求,②遗传算法调用启发式算法,计算配载指标,来确定货物在各舱的分布,以满足各舱的仓容限制,提高仓容利用率和装载效率。
6) combination optimization
组合优化
1.
The problem of satellite data transmission tasks scheduling is a very complex combination optimization problem,that is the problem of how to allocate the ground stations resources and their service time in order to satisfy tasks requests farthest.
卫星数传任务调度问题是一个非常复杂的组合优化问题,即如何合理为每个任务分配地面站资源及其服务时间以最大限度满足任务需求的问题。
2.
Because the vehicle scheduling problem restrained by time windows is a typical NP hard problem,it has been an open problems and the front of operations research and combination optimization.
有时间窗的车辆调度问题是一个典型的NP难题 ,一直成为运筹学与组合优化领域的前沿与研究热点问题 ,但传统的方法往往不能令人满意 ,利用遗传算法解决单车场单车型有时间窗约束的非满载车辆调度问题 ,构造了有创新性的染色体结构 ,并在遗传算法的迭代过程中与启发式算法交叉应用 ,现实应用中获得了很好的效
3.
A new combination optimization problem caned China Travelling Salesman Problem (C-TSP) is proposed in this paper.
该文提出了一个新的组合优化问题：中国旅行商问题（Ｃ─ＴＳＰ），讨论了用神经网络的原理和方法解决它，提出了智能化的优化方法。
补充资料：生产要素最优组合
生产要素最优组合：在生产技术和要素价格不变的条件下，生产者在成本既定时实现产量最大或在产量既定时实现成本最小目标时所使用的各种生产要素的数量组合。在等产量曲线与等成本方程的图形中，生产要素最优组合表现为这两条曲线的切点，其满足的条件是：RTSL,K=rL/rK，rLL+rKK= c或：MPL/rL=MPK/rK，rLL+rKK= c。上述条件表明，使用任意两种生产要素的边际技术替代率等于相应的价格比，或者说，每单位成本用于任何要素的购买所得到的边际产量都相等。厂商的生产要素最优组合与利润最大化是一致的。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条