As a typical representative of the NP-complete problem, the traveling salesman problem(TSP) is widely utilized in computer networks, logistics distribution, and other fields. In this paper, a discrete lion swarm optim...As a typical representative of the NP-complete problem, the traveling salesman problem(TSP) is widely utilized in computer networks, logistics distribution, and other fields. In this paper, a discrete lion swarm optimization(DLSO) algorithm is proposed to solve the TSP. Firstly, we introduce discrete coding and order crossover operators in DLSO. Secondly, we use the complete 2-opt(C2-opt) algorithm to enhance the local search ability.Then in order to enhance the efficiency of the algorithm, a parallel discrete lion swarm optimization(PDLSO) algorithm is proposed.The PDLSO has multiple populations, and each sub-population independently runs the DLSO algorithm in parallel. We use the ring topology to transfer information between sub-populations. Experiments on some benchmarks TSP problems show that the DLSO algorithm has a better accuracy than other algorithms, and the PDLSO algorithm can effectively shorten the running time.展开更多
In polar regions, floating ice exhibits distinct characteristics across a range of spatial scales. It is well recognized that the irregular geometry of these ice formations markedly influences their dynamic behavior. ...In polar regions, floating ice exhibits distinct characteristics across a range of spatial scales. It is well recognized that the irregular geometry of these ice formations markedly influences their dynamic behavior. This study introduces a polyhedral Discrete Element Method (DEM) tailored for polar ice, incorporating the Gilbert-Johnson-Keerthi (GJK) and Expanding Polytope Algorithm (EPA) for contact detection. This approach facilitates the simulation of the drift and collision processes of floating ice, effectively capturing its freezing and fragmentation. Subsequently, the stability and reli ability of this model are validated by uniaxial compression on level ice fields, focusing specifically on the influence of compression strength on deformation resistance. Additionally, clusters of ice floes nav igating through narrow channels are simulated. These studies have qualitatively assessed the effects of Floe Size Distribution (FSD), initial concentration, and circularity on their flow dynamics. The higher power-law exponent values in the FSD, increased circularity, and decreased concentration are each as sociated with accelerated flow in ice floe fields. The simulation results distinctly demonstrate the con siderable impact of sea ice geometry on the movement of clusters, offering valuable insights into the complexities of polar ice dynamics.展开更多
An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effecti...An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy(IG) algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value.展开更多
A discrete differential evolution algorithm combined with the branch and bound method is developed to solve the integer linear bilevel programming problems, in which both upper level and lower level variables are forc...A discrete differential evolution algorithm combined with the branch and bound method is developed to solve the integer linear bilevel programming problems, in which both upper level and lower level variables are forced to be integer. An integer coding for upper level variables is adopted, and then a discrete differential evolution algorithm with an improved feasibility-based comparison is developed to directly explore the integer solution at the upper level. For a given upper level integer variable, the lower level integer programming problem is solved by the existing branch and bound algorithm to obtain the optimal integer solution at the lower level. In the same framework of the algorithm, two other constraint handling methods, i.e. the penalty function method and the feasibility-based comparison method are also tested. The experimental results demonstrate that the discrete differential evolution algorithm with different constraint handling methods is effective in finding the global optimal integer solutions, but the improved constraint handling method performs better than two compared constraint handling methods.展开更多
It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used suc...It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used successfully to improve the image quality. This paper studies the application of iterative algorithms in radar imaging. A discrete model is first derived, and the iterative algorithms are then adapted to radar imaging. Although such algorithms are usually time consuming, this paper shows that, if the algorithms are appropriately simplified, it is possible to realize them even in real time. The efficiency of iterative algorithms is shown through computer simulations.展开更多
研究了复杂微细导线电容矩阵提取边界元法(boundary element method,BEM)的边界离散问题以及增强计算精度和数值稳定性的有效措施,分析了开阔边界尺寸、开阔边界离散、导线离散对计算精度的影响以及伪解、矩阵奇异性问题,提出了基于导...研究了复杂微细导线电容矩阵提取边界元法(boundary element method,BEM)的边界离散问题以及增强计算精度和数值稳定性的有效措施,分析了开阔边界尺寸、开阔边界离散、导线离散对计算精度的影响以及伪解、矩阵奇异性问题,提出了基于导线离散迭代和开阔边界迭代两阶段自动迭代边界元算法(automatic iterative boundary element method,AIBEM),并结合实例阐述了全域法和区域分解法两种多层介质问题系数矩阵生成方法。研究结果表明,边界环内生成的系数矩阵存在误差均衡协调问题,对复杂模型需合理选择各线段离散单元数及开阔边界尺寸,通过AIBEM可以获得经济的离散参数,有效避免矩阵奇异性,并提高收敛稳定性。将计算结果与有限元法、解析法、传输线法、矩量法进行了对比分析,证实了算法的可靠性。展开更多
针对茶园耕作过程中因土壤板结粘滞特性导致的机具耕作阻力大、作业质量差等问题,基于鼹鼠爪趾生物力学特征创新设计了一款复合仿生耕作铲,通过四杆机构集成设计研制了新型茶园掘耕机。研究过程中,首先基于离散元法(Discrete element me...针对茶园耕作过程中因土壤板结粘滞特性导致的机具耕作阻力大、作业质量差等问题,基于鼹鼠爪趾生物力学特征创新设计了一款复合仿生耕作铲,通过四杆机构集成设计研制了新型茶园掘耕机。研究过程中,首先基于离散元法(Discrete element method,DEM)与多体动力学(Multi-body dynamics,MBD)耦合算法对仿生掘耕机的耕作过程进行动态模拟分析。同时借助Design-Expert 13试验设计软件,采用三因素三水平正交试验法(耕作铲入土角度、驱动臂转速、机具前进速度)开展整机工作参数优化研究,确定在耕作深度100 mm时,安装复合仿生耕作铲的茶园仿生掘耕机最佳工作参数组合为入土角度33.506°、驱动臂转速289.923 r·min^(-1)、机具行进速度0.2 m·s^(-1)。基于此优化参数,通过土壤颗粒运动速度分布特征进行耕作扰动对比仿真分析。最后开展田间验证试验,结果表明:相较于传统原型铲,装配复合仿生耕作铲的掘耕机减阻率为5.70%,碎土率提升至91.05%,其他作业评价指标均有所提升,工作性能能够满足茶园耕作的要求,验证了其仿生结构设计的有效性与工程实用性。展开更多
基金supported by the National Natural Science Foundation of China(61771293)the Key Project of Shangdong Province(2019JZZY010111)。
文摘As a typical representative of the NP-complete problem, the traveling salesman problem(TSP) is widely utilized in computer networks, logistics distribution, and other fields. In this paper, a discrete lion swarm optimization(DLSO) algorithm is proposed to solve the TSP. Firstly, we introduce discrete coding and order crossover operators in DLSO. Secondly, we use the complete 2-opt(C2-opt) algorithm to enhance the local search ability.Then in order to enhance the efficiency of the algorithm, a parallel discrete lion swarm optimization(PDLSO) algorithm is proposed.The PDLSO has multiple populations, and each sub-population independently runs the DLSO algorithm in parallel. We use the ring topology to transfer information between sub-populations. Experiments on some benchmarks TSP problems show that the DLSO algorithm has a better accuracy than other algorithms, and the PDLSO algorithm can effectively shorten the running time.
文摘In polar regions, floating ice exhibits distinct characteristics across a range of spatial scales. It is well recognized that the irregular geometry of these ice formations markedly influences their dynamic behavior. This study introduces a polyhedral Discrete Element Method (DEM) tailored for polar ice, incorporating the Gilbert-Johnson-Keerthi (GJK) and Expanding Polytope Algorithm (EPA) for contact detection. This approach facilitates the simulation of the drift and collision processes of floating ice, effectively capturing its freezing and fragmentation. Subsequently, the stability and reli ability of this model are validated by uniaxial compression on level ice fields, focusing specifically on the influence of compression strength on deformation resistance. Additionally, clusters of ice floes nav igating through narrow channels are simulated. These studies have qualitatively assessed the effects of Floe Size Distribution (FSD), initial concentration, and circularity on their flow dynamics. The higher power-law exponent values in the FSD, increased circularity, and decreased concentration are each as sociated with accelerated flow in ice floe fields. The simulation results distinctly demonstrate the con siderable impact of sea ice geometry on the movement of clusters, offering valuable insights into the complexities of polar ice dynamics.
基金Projects(61174040,61104178,61374136) supported by the National Natural Science Foundation of ChinaProject(12JC1403400) supported by Shanghai Commission of Science and Technology,ChinaProject supported by the Fundamental Research Funds for the Central Universities,China
文摘An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy(IG) algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value.
基金supported by the Natural Science Basic Research Plan in Shaanxi Province of China(2013JM1022)the Fundamental Research Funds for the Central Universities(K50511700004)
文摘A discrete differential evolution algorithm combined with the branch and bound method is developed to solve the integer linear bilevel programming problems, in which both upper level and lower level variables are forced to be integer. An integer coding for upper level variables is adopted, and then a discrete differential evolution algorithm with an improved feasibility-based comparison is developed to directly explore the integer solution at the upper level. For a given upper level integer variable, the lower level integer programming problem is solved by the existing branch and bound algorithm to obtain the optimal integer solution at the lower level. In the same framework of the algorithm, two other constraint handling methods, i.e. the penalty function method and the feasibility-based comparison method are also tested. The experimental results demonstrate that the discrete differential evolution algorithm with different constraint handling methods is effective in finding the global optimal integer solutions, but the improved constraint handling method performs better than two compared constraint handling methods.
文摘It has long been realized that the problem of radar imaging is a special case of image reconstruction in which the data are incomplete and noisy. In other fields, iterative reconstruction algorithms have been used successfully to improve the image quality. This paper studies the application of iterative algorithms in radar imaging. A discrete model is first derived, and the iterative algorithms are then adapted to radar imaging. Although such algorithms are usually time consuming, this paper shows that, if the algorithms are appropriately simplified, it is possible to realize them even in real time. The efficiency of iterative algorithms is shown through computer simulations.
文摘研究了复杂微细导线电容矩阵提取边界元法(boundary element method,BEM)的边界离散问题以及增强计算精度和数值稳定性的有效措施,分析了开阔边界尺寸、开阔边界离散、导线离散对计算精度的影响以及伪解、矩阵奇异性问题,提出了基于导线离散迭代和开阔边界迭代两阶段自动迭代边界元算法(automatic iterative boundary element method,AIBEM),并结合实例阐述了全域法和区域分解法两种多层介质问题系数矩阵生成方法。研究结果表明,边界环内生成的系数矩阵存在误差均衡协调问题,对复杂模型需合理选择各线段离散单元数及开阔边界尺寸,通过AIBEM可以获得经济的离散参数,有效避免矩阵奇异性,并提高收敛稳定性。将计算结果与有限元法、解析法、传输线法、矩量法进行了对比分析,证实了算法的可靠性。
