1 function Kernighan-Lin(G(V,E)): 2 determine a balanced initial partition of the nodes into sets A and B 3do 4 A1 := A; B1 := B 5 compute D valuesforall a in A1 and b in B1 6for(i := 1 to |V|/2) 7 find a[i] from A1 and b[i] from B1, such that g[i] = D...
Kernighan–LinalgorithmKL算法 这个算法主要⽤在⽹络节点的分割。他的思想是将⼀个⽹络节点图分割成两个相等的节点集合。为了连接两个社区的边权最⼩。step1:随机产⽣两个节点的集合A和B.step2:计算A和B中的每个节点的internal cost and external cost step3:将A中的节点与B中的节点进⾏交换，计算两...
Tan, "Recursive Kernighan-Lin algo- rithm (RKL) scheme for cooperative road-side units in Vehic- ular networks," Communications in Computer and Information Science, vol. 405, pp. 321-331, 2014.Y. Weihong, Y. Yuehui, and T. Guozhen, "Recursive kernighan-lin algorithm (rkl) scheme for ...
Kernighan-Lin算法的改进对图 划分问题的研究
关键词:链式Lin-Kernighan算法;旅行商问题;边交集;参照优化边集 中图分类号:TP18文献标志码:A NewstrategyforimprovingperformanceofchainedLin-Kernighanalgorithm WANGDong 1 * ,LIYa 1 ,WUChen 1 ,LINDong-mei 2 (1.CollegeofElectronicsandInformationEngineering,FoshanUniversity,FoshanGuangdong528000,China; 2.Cente...
关键词:链式Lin—Kernighan算法;旅行商问题;边集;随机算法;混合 算法 中图分类号:TP18文献标识码:A StrategyforimprovingtheperformanceofchainedLin-Kernighanalgorithm WANGDong一,WUXiang.bin (1.DepartmentofComputerScienceandTechnology,FoshanUniversity,Fos
If you have ever worked on placement or floorplanning, and probably some other areas of EDA, then you will have heard of "Kernighan and Lin". It's a partitioning algorithm. You might not even have realized that the Kernighan of Kernigh...
Furthermore, we show simulation results with a different number of exchanges in the Lin-Kernighan algorithm used in the proposed technique. 机译:提出了一种指数阻尼阻尼混沌禁忌搜索,该算法通过使用混沌神经元模型的神经网络通过混沌动力学来驱动2-opt局部搜索,是解决二次分配问题(QAP)的出色方法。另一方面...
硕士研究生:于龙振(管理科学与工程)指导教师:**新副教授关键诃:TSP)Lin-Kernighan算法;改进:软件:可视化;TSPLIB ImplementationoftheVisualProcessSoftwareForSolvingTSPbasedonModifiedLin・KernigbanAlgorithmAbstractTSPisatypicalproblemofitsgenre:combinatofialoptimization.furthertTlore.TSPistheoriginalformofmanyrealistic...
EHAS uses 3-opt to initiate the solution and Lin-Kernighan algorithm to build improved solutions. 算法前期使用3-opt这种简单高效的局部搜索的解初始化信息素矩阵,加快收敛速度,后期采用改进的Lin-Kernighan算法生成局部优化解然后依Metropolis接受准则概率接受,有效地避免陷入局部最优,理论分析和TSPLIB中部分实例仿...