In this paper,we employ genetic algorithms to solve the migration problem(MP).We propose a new encoding scheme to represent trees,which is composed of two parts:the pre-ordered traversal sequence of tree vertices and ...In this paper,we employ genetic algorithms to solve the migration problem(MP).We propose a new encoding scheme to represent trees,which is composed of two parts:the pre-ordered traversal sequence of tree vertices and the children number sequence of corresponding tree vertices.The proposed encoding scheme has the advantages of simplicity for encoding and decoding,ease for GA operations,and better equilibrium between exploration and exploitation.It is also adaptive in that,with few restrictions on the length of code,it can be freely lengthened or shortened according to the characteristics of the problem space.Furthermore,the encoding scheme is highly applicable to the degree-constrained minimum spanning tree problem because it also contains the degree information of each node.The simulation results demonstrate the higher performance of our algorithm,with fast convergence to the optima or sub-optima on various problem sizes.Comparing with the binary string encoding of vertices,when the problem size is large,our algorithm runs remarkably faster with comparable search capability.展开更多
基金Supported by the National Natural Science Foundation of China(90104005)the Natural science Foundation of Hubei Province and the Hong Kong Poly-technic University under the grant G-YD63
文摘In this paper,we employ genetic algorithms to solve the migration problem(MP).We propose a new encoding scheme to represent trees,which is composed of two parts:the pre-ordered traversal sequence of tree vertices and the children number sequence of corresponding tree vertices.The proposed encoding scheme has the advantages of simplicity for encoding and decoding,ease for GA operations,and better equilibrium between exploration and exploitation.It is also adaptive in that,with few restrictions on the length of code,it can be freely lengthened or shortened according to the characteristics of the problem space.Furthermore,the encoding scheme is highly applicable to the degree-constrained minimum spanning tree problem because it also contains the degree information of each node.The simulation results demonstrate the higher performance of our algorithm,with fast convergence to the optima or sub-optima on various problem sizes.Comparing with the binary string encoding of vertices,when the problem size is large,our algorithm runs remarkably faster with comparable search capability.
文摘优化模型驱动的移动边缘计算(Mobile Edge Computing,MEC)网络任务卸载与迁移策略研究基于物联网设备激增和5G技术推广的背景展开。MEC通过将计算资源迁移至网络边缘,显著降低数据传输延迟和云端压力。为此,提出一系列任务卸载与迁移策略,并通过性能评估验证其效果。实验结果表明,所提策略在典型应用场景中显著优化了关键性能指标:延迟降低约25%,能耗减少30%,任务吞吐量提升20%。具体优化包括:动态资源调度实现负载均衡,改进卸载效率;基于QoS(Qua-lity of Service)保障的迁移机制确保服务稳定性;跨层优化设计提升多任务协作能力。此外,通过机器学习预测技术,动态适应网络波动,提高系统灵活性。研究结论指出,优化模型在确保资源高效分配和任务实时性方面具备突出优势,提升了MEC网络的服务质量和用户体验。策略可广泛适用于异构网络和动态环境,具备进一步拓展的潜力。
