整数规划问题 meaning in English
integer programming problem
Examples
- Many problems of engineering and system are integer or mixed integer programming problems . lt is well known that the problem of integer programming is a np - hard problem , and the method for it is exponential complex
工程、系统问题中有许多问题属于整数或混合整数规划问题。众所周知，线性整数规划问题是np - hard问题，求解该问题的精确解算法具有指数复杂性。 - By theoretical analysis and numerical experimentation , the genetic method for large scaling multi - apex and no smooth mixed integer nonlinear programming can get a good global solution , and it is better than other algorithms used to resolve in the feasibility , stabilization and convergent speed of the solution
理论分析及数值试验表明：该算法对大范围、多峰、非光滑混合整数规划问题有较好的全局求解能力，在解的精度、稳定性和收敛速度等方面优于一般的求解混合整数非线性规划的算法。 - However , signals take effect by the switch of signal phases , which introduces integer control values into the traffic control problem , so the traffic control problem becomes a large - scale mixed integer programming problem , the computation of which requires an exponential - complexity optimiz ation algorithm
但是，信号灯通过相位切换对交叉口进行控制，同时也在交通控制模型中引入了整数决策变量，使交通控制模型成为一个大规模混合整数规划问题，需要指数复杂度的优化算法。 - On the base of analysing the shortcoming of genetic algotithms , three improved techniques for genetic algorithms are bring forward in this paper : fuzzy penalty fitness function , random dislocation arithmetic crossover , fuzzy parameter adjust policy , which improve genetic algorithms capability of global convergence and convergent speed . at the same time , the improved genetic algorithms are applied to nonlinear mixed integer problems and complex nonlinear function optimization
在分析实数型遗传算法不足的基础上，本文研究了遗传算法的关键技术，分别提出了模糊惩罚评价函数、随机错位算术杂交算子、模糊自适应参数控制等改进技术，以提高遗传算法的全局收敛性和收敛速度，并应用于求解非线性混合整数规划问题和复杂高维的函数优化问题。 - In essence , optimal network planning is a cosmic , dynamic , nonlinear , mixed and integral planning . because large system scale involved in and the consumed time for solutions are limited when applied to practical power system , and the difficulty to obtain the optimal solutions , it is required to simplify the model
网架优化规划本质上是大规模动态非线性混合整数规划问题，实际中其求解规模和时间都受到很大限制，很难计算出最优解，因此重要对模型进行简化。