Transmission network expansion planning is a complicated, nonlinear, large-scale combinatorial optimization problem.
输电网络扩展规划是一个非常复杂的大规模组合优化问题。
Distribution network reconfiguration for loss minimization is a complex, large-scale combinatorial optimization problem.
损失最小化的配电网络重构是一个复杂的，大型的组合优化问题。
This paper introduces a heuristic algorithm to solve a large-scale combinatorial optimization problem for transportation problem with constrained resources.
介绍了一种求解资源约束条件下的大规模组合优化运输问题的启发式方法。
Optimal multistage transmission system expansion planning is a large-scale nonlinear combinatorial optimization problem.
多阶段输电系统规划问题是一个复杂的非线性组合优化问题。
It is difficult to solve in large scale because the LRP is a typical NP-hard problem in combinatorial optimization.
由于定位-车辆路线问题是组合优化问题中一个典型的NP难题，大规模时难以精确求解。
The Algorithm has very wide generality and very good efficiency, its basic principle can widely be used in solving large scale combinatorial optimization problems.
该算法通用性强，效率高，其基本原理可广泛应用于求解大规模的组合优化问题。
The Algorithm has very wide generality and very good efficiency, its basic principle can widely be used in solving large scale combinatorial optimization problems.
该算法通用性强，效率高，其基本原理可广泛应用于求解大规模的组合优化问题。
应用推荐