论文部分内容阅读
提出一种使用邻接矩阵保证最优交通小区划分一阶邻接约束的整数规划建模方法.从求解复杂度和质量两个角度,比较并分析了该邻接约束建模方法与其他3种方法对问题求解效率的影响.设计了聚合式层次聚类启发算法以求解所提出的模型.针对较大规模算例,将所提出的建模方法与其他3种邻接约束建模方法的结果进行了对比与分析.结果表明,基于邻接矩阵表示的建模方法能在允许时间内求得满意解,较其他3种方法更适合大规模问题.
This paper proposes a method of integer programming based on the adjacency matrix to ensure that the optimal traffic cells partition first-order adjacency constraints. From the perspective of solution complexity and quality, this method of adjacency constraint modeling and the other three methods are compared and analyzed To solve the effect of efficiency.An aggregated hierarchical clustering heuristic algorithm is designed to solve the proposed model.For the larger scale example, the proposed modeling method is compared with the results of the other three kinds of modeling methods of adjacency constraints The results show that the method based on adjacency matrix representation can find satisfactory solutions within the allowable time, which is more suitable for large-scale problems than the other three methods.