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.
介绍了一种求解资源约束条件下的大规模组合优化运输问题的启发式方法。
应用推荐