The ant colony algorithm has good adaptability when solving combined optimization problems, it isn t very good for continuous optimization problems.
蚁群算法在解决组合优化问题上有着良好的适应性,但直接应用于求解连续优化问题难以获得理想的效果。
Traveling Salesman Problem(TSP) is a classic combined optimization problem and it is proved that TSP is NP hard.
TSP(旅行商)问题作为经典的组合优化问题,已经被证明是一个NP难题。
A combined optimization decision tree algorithm suitable for a large scale and high dimension data-base is presented.
提出了一种适合于大规模高维数据库的组合优化决策树算法。
Finally, a combined optimization model for various transportation modes is deduced based on the above and algorithm is also proposed.
最后在运输方式选择依据和运输网络的基础上得出了多种运输方式组合优化模型,并给出了求解算法。
Container loading is the three-dimensional problem in "cutting and packing" problems. It is combined optimization with complex constraint condition.
集装箱装入问题是“切割和装入”问题领域中的三维空间问题,是具有复杂约束条件的组合优化问题。
Timetable problem is a typical problem of combined optimization in the fields of operational research and systems engineering, which belongs to NP problem.
时间表问题是运筹学领域和系统工程领域中的典型组合优化问题,是由于事件对时间和空间的资源争夺而产生的,属于NP完全类问题。
This algorithm is actually a minimum problem under the restrict conditions, it belongs to the combined optimization problem and its computing burden increases heavily with the number of targets.
此算法实际上是求约束条件下的函数最小值问题,属于组合优化问题,其计算复杂度随着目标数的增加而发生爆炸现象。
This algorithm is actually a minimum problem under the restrict conditions, it belongs to the combined optimization problem and its computing burden increases heavily with the number of targets.
此算法实际上是求约束条件下的函数最小值问题,属于组合优化问题,其计算复杂度随着目标数的增加而发生爆炸现象。
应用推荐