This paper discusses the numbers of jump layers of boundary value problems in quasilinear differential equations. In addition, the paper gives several examples to explain why the original equation must be rediscussed ...This paper discusses the numbers of jump layers of boundary value problems in quasilinear differential equations. In addition, the paper gives several examples to explain why the original equation must be rediscussed when the determinate function in reference [1 ] is a/ways equal to zero.展开更多
针对多目标约束的Steiner树问题(MCSTP,multi-constraint Steiner tree problem),提出一种基于双层编码机制和跳跃粒子群优化(JPSO)的启发式算法(JPSO-DE),来构建最优树结构。首先,选择总能耗、网络寿命、收敛时间和通信干扰作为优化约...针对多目标约束的Steiner树问题(MCSTP,multi-constraint Steiner tree problem),提出一种基于双层编码机制和跳跃粒子群优化(JPSO)的启发式算法(JPSO-DE),来构建最优树结构。首先,选择总能耗、网络寿命、收敛时间和通信干扰作为优化约束目标;然后,根据提出的双层编码方案对生成树的解进行编码,同时利用跳跃粒子群优化算法来寻找帕累托最优解;最后,利用提出的混合适应度函数找出近似最优树结构。仿真实验表明,JPSO-DE方法可以产生近似最优的树结构,具有高效性和可行性。展开更多
文摘This paper discusses the numbers of jump layers of boundary value problems in quasilinear differential equations. In addition, the paper gives several examples to explain why the original equation must be rediscussed when the determinate function in reference [1 ] is a/ways equal to zero.
文摘针对多目标约束的Steiner树问题(MCSTP,multi-constraint Steiner tree problem),提出一种基于双层编码机制和跳跃粒子群优化(JPSO)的启发式算法(JPSO-DE),来构建最优树结构。首先,选择总能耗、网络寿命、收敛时间和通信干扰作为优化约束目标;然后,根据提出的双层编码方案对生成树的解进行编码,同时利用跳跃粒子群优化算法来寻找帕累托最优解;最后,利用提出的混合适应度函数找出近似最优树结构。仿真实验表明,JPSO-DE方法可以产生近似最优的树结构,具有高效性和可行性。