We investigate the acceleration of an adiabatic process with the same survival probability of the ground state by sweeping a parameter nonlinearly, fast in the wide gap region and slowly in the narrow gap region, in c...We investigate the acceleration of an adiabatic process with the same survival probability of the ground state by sweeping a parameter nonlinearly, fast in the wide gap region and slowly in the narrow gap region, in contrast to the usual linear sweeping. We find the expected acceleration both in the Landau-Zener tunneling model and in the adiabatic quantum computing model for factorizing the number N - 21.展开更多
The CSCM-S algorithm proposed by Lombard et al.is a very attractive tool for solving multidimensional Euler and Navier-Stokes equations.However,it is not economical due to the use of global sweeps in the whole computa...The CSCM-S algorithm proposed by Lombard et al.is a very attractive tool for solving multidimensional Euler and Navier-Stokes equations.However,it is not economical due to the use of global sweeps in the whole computational domain.In this paper we suggest a modified strategy,which combines a single-marching technique for supersonic dominated region with a multi-sweep procedure for pure subsonic and complex flowfield.The new algorithm may save significantly CPU time and is more suitable for engineering applications.展开更多
扫描覆盖问题一直是无线传感网络的热点问题,目前大多数研究主要集中于同构无人机扫描覆盖问题,目标为无人机数量最小的情况下对区域节点达到全覆盖。近年来,扫描覆盖问题衍生出新的方向,即MTMC(min-time max-coverage)问题,即使用有限...扫描覆盖问题一直是无线传感网络的热点问题,目前大多数研究主要集中于同构无人机扫描覆盖问题,目标为无人机数量最小的情况下对区域节点达到全覆盖。近年来,扫描覆盖问题衍生出新的方向,即MTMC(min-time max-coverage)问题,即使用有限无人机对区域节点进行扫描覆盖,使得覆盖率尽可能大的同时任务时间尽可能小。在考虑了无人机异构性的基础上,分析了MTMC问题的数学模型,提出了CWBGAA(CW Based on Genetic Annealing Algorithm optimization)算法解决MTMC问题。上述算法分为两阶段解决问题,第一阶段基于启发式插入算法生成每架无人机对应的飞行路径,第二阶段基于遗传退火算法对生成后路径进行路径优化,使得无人机的飞行时间降低。仿真结果表明,CWBGAA算法相较于其它算法拥有更好的性能,提升覆盖率的同时降低了任务执行时间。展开更多
提出一种新的蚁群算法(Multiple Ant Colonies Algorithm based on Sweep Algorithm, SbMACA)用以求解车辆路径问题(Capacitated Vehicle Routing Problem, CVRP)。该方法同以往蚁群算法的不同之处主要体现在两个方面:第一,首次将扫描...提出一种新的蚁群算法(Multiple Ant Colonies Algorithm based on Sweep Algorithm, SbMACA)用以求解车辆路径问题(Capacitated Vehicle Routing Problem, CVRP)。该方法同以往蚁群算法的不同之处主要体现在两个方面:第一,首次将扫描算法应用于蚁群算法,通过对蚂蚁所构造的初始解中的不同子回路之间的点进行交换优化,该算法可以有效地改进初始解的质量;第二,提出并采用了一种新的多蚁群技术,各个蚁群分别进行各自的搜索,在各个蚁群均停滞后,对蚁群之间的信息素进行交换与更新,以利于蚁群跳离局部最优值。实验结果表明,SbMACA算法具有很强的搜索能力,求取各CVRP的Benchmark问题所得解的质量同最好解相比较而言,平均仅有 0.28%的差距,是求解车辆路径问题的一种十分有效的方法。展开更多
基金supported by the National Natural Science Foundation of China (Grant No. 10904017)the Specialized Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20090071120013)the Shanghai Pujiang Program, China (Grant No. 10PJ1401300)
文摘We investigate the acceleration of an adiabatic process with the same survival probability of the ground state by sweeping a parameter nonlinearly, fast in the wide gap region and slowly in the narrow gap region, in contrast to the usual linear sweeping. We find the expected acceleration both in the Landau-Zener tunneling model and in the adiabatic quantum computing model for factorizing the number N - 21.
基金The project supported by National Natural Science Foundation of China
文摘The CSCM-S algorithm proposed by Lombard et al.is a very attractive tool for solving multidimensional Euler and Navier-Stokes equations.However,it is not economical due to the use of global sweeps in the whole computational domain.In this paper we suggest a modified strategy,which combines a single-marching technique for supersonic dominated region with a multi-sweep procedure for pure subsonic and complex flowfield.The new algorithm may save significantly CPU time and is more suitable for engineering applications.
文摘扫描覆盖问题一直是无线传感网络的热点问题,目前大多数研究主要集中于同构无人机扫描覆盖问题,目标为无人机数量最小的情况下对区域节点达到全覆盖。近年来,扫描覆盖问题衍生出新的方向,即MTMC(min-time max-coverage)问题,即使用有限无人机对区域节点进行扫描覆盖,使得覆盖率尽可能大的同时任务时间尽可能小。在考虑了无人机异构性的基础上,分析了MTMC问题的数学模型,提出了CWBGAA(CW Based on Genetic Annealing Algorithm optimization)算法解决MTMC问题。上述算法分为两阶段解决问题,第一阶段基于启发式插入算法生成每架无人机对应的飞行路径,第二阶段基于遗传退火算法对生成后路径进行路径优化,使得无人机的飞行时间降低。仿真结果表明,CWBGAA算法相较于其它算法拥有更好的性能,提升覆盖率的同时降低了任务执行时间。
文摘提出一种新的蚁群算法(Multiple Ant Colonies Algorithm based on Sweep Algorithm, SbMACA)用以求解车辆路径问题(Capacitated Vehicle Routing Problem, CVRP)。该方法同以往蚁群算法的不同之处主要体现在两个方面:第一,首次将扫描算法应用于蚁群算法,通过对蚂蚁所构造的初始解中的不同子回路之间的点进行交换优化,该算法可以有效地改进初始解的质量;第二,提出并采用了一种新的多蚁群技术,各个蚁群分别进行各自的搜索,在各个蚁群均停滞后,对蚁群之间的信息素进行交换与更新,以利于蚁群跳离局部最优值。实验结果表明,SbMACA算法具有很强的搜索能力,求取各CVRP的Benchmark问题所得解的质量同最好解相比较而言,平均仅有 0.28%的差距,是求解车辆路径问题的一种十分有效的方法。
