构造了两种并行蚁群算法模型,在单机多核下实现了Cilk++并行蚁群算法及OpenMP并行蚁群算法,并应用于真实路网车辆路径问题(Vehicle Routing Problem,VRP)对两者进行了实验对比.实验结果表明,OpenMP模型的并行性能与问题规模有较大关系,OpenMP并行蚁群算法与基于winapi多线程的并行蚁群算法相比效率相近.Cilk++模型在双核下性能优于OpenMP模型,四核下不及OpenMP模型.%Two parallel ant colony algorithm (PACA) models are structured. Cilk++-based PACA and OpenMP-based PACA were realized under single machine with multi-core. The real road vehicle routing problem (VRP) was used to make a experimental comparison for both of the algorithms. Experimental, show that OpenMP model is related to VRP size, and the running efficiency of OpenMP-based PACA is similar to that of Winapi-based PACA. CilkH-h model in the case of double-kernel is better than OpenMP model, but in the case of four-kernel is inferior to OpenMP model.
展开▼
