蚁群算法是基于群体合作的一类仿生算法，适合于解困难的离散组合优化问题。
Ant colony algorithm is a novel simulated evolutionary algorithm based on group cooperation and can be applied to solve hard discrete combinatorial optimization problem.
通过引入随机交换序、PMX算子使微粒群优化算法能够求解车辆路径问题这类离散组合优化问题。
PSO can solve a discrete combination optimization such as VRP by using random exchange sequence and PMX operator.
通过引入随机交换序、PMX算子使微粒群优化算法能够求解车辆路径问题这类离散组合优化问题。
A PSO can solve a discrete combination optimization such as VRP by using random exchange sequence and PMX operator.
配电网重构是一个多目标、 多约束、离散的非线性组合优化问题。
Distribution network reconfiguration is a multi - objective , multi - constraint, discrete nonlinear combinatory optimization problem.
函数优化实验研究表明，在算法中采用何种离散重组算子较为合适与算子的组合能力有关，也与优化问题有关。
Function optimization experiments show that which operator works better in an algorithm depends on both the combination capability of the operator and the problem to be optimized.
粒子群算法在求解连续函数优化问题中取得了广泛的应用，但是其在离散的组合优化问题中的运用还比较少。
Particle swarm optimization is widely used to solve continuous function optimization issue, but its application in discrete combination optimization problems is still relatively few.
配电网络规划是一个复杂的组合优化问题，其具有多约束、非线性和离散性的特点。
Distribution system planning is a complicated combinatorial optimization problem, which is characterized by multi-constrains, non-linearity and discreteness.
本文采用年值法建立了包含输气干线优化设计和压缩机站优化运行的综合优化模型，这两个模型分别属于混合离散优化和组合优化。
In this paper, the method of annually costs is used to found the collective optimization model including gas transportation pipeline optimum design and compressor station optimum operation.
连续体结构的拓扑优化本质上是一种0-1离散变量的组合优化问题。
Topology optimization of a continuum structure is essentially a 0-1 discrete variable optimization problem.
用MDCP法(混合离散变量组合形法)求解输油管道优化运行的数学模型，可以比较好地解决这一问题。
The Mixed Discrete variable Complex Programming method (MDCP) is used to solute the mathematical model of oil pipeline.
文中提出了一种基于改进离散粒子群优化算法求解机组组合问题的新方法。
A solution to unit commitment via an enhanced binary particle swarm optimization (BPSO) algorithm is presented.
分析量子计算的特点，对量子旋转门进行研究，给出了新的量子旋转门调整策略，并与离散二进制粒子群优化算法进行组合，提出了二进制量子粒子群优化算法。
According to the analysis of the characteristics of quantum computing and the research of quantum rotation gate, a new quantum rotation gate adjustment strategy was introduced.
同时，针对整数资源分配这类组合优化问题，提出了相应的离散粒子群算法。
At the same time, a corresponding particle swarm optimization algorithm is presented to solve the optimization problem of integer resource allocation. This algorithm is easy to programming.
同时，针对整数资源分配这类组合优化问题，提出了相应的离散粒子群算法。
At the same time, a corresponding particle swarm optimization algorithm is presented to solve the optimization problem of integer resource allocation. This algorithm is easy to programming.
应用推荐