Considering the characteristics of urban freight transportation and the complexity of the consecutive location selection, the non-restraint location selection problem existing in urban freight transshipping stations is analyzed, on the basis of which an optimized mathematical model to solve the problem is established and the effective genetic algorithm for the model is constructed.
结合城市货物运输的具体特点及连续选址问题的复杂性,在分析城市货物换装站非约束选址问题特点的基础上,建立该问题的优化数学模型,并构造求解问题的有效遗传算法。
Through deeply investigating the properties of DD-graph and analyzing the shortcomings of the algorithm FTPS, an approximate algorithm (called Find_SemiUE) for solving the set of unconstrained arcs is presented, which is simple, quick and very suitable for the large-scale programs.
结构性测试是对过程式和面向对象程序都非常有效的测试方法,分支覆盖准则被实践证明是其中性价比最高的一种策略·通过深入研究DD图的性质并分析FTPS算法的不足,提出了一种简便、快捷和适合于大规模程序的非约束边集近似求解算法Find SemiUE;还给出了基于正(逆)向广度(深度)生成树的分支测试路径用例集的简化生成算法Generate PathSet,该算法在时间和空间开销上较FTPS算法均有较大提高·此外,所证明的关于DD图的结论也值得借鉴用于该图的更深一步研究
However, face recognition under unconstrained condition is paid more attention in recent several years due to requirements of many practical applications.
而近几年中,为避免各种实际应用环境的限制,非约束环境下的人脸识别也得到了很大的发展。
CopyRight © 2020-2024 优校网[www.youxiaow.com]版权所有 All Rights Reserved. ICP备案号:浙ICP备2024058711号