| 注册
首页|期刊导航|计算机与数字工程|基于分解的多目标多小车充电路径规划算法

基于分解的多目标多小车充电路径规划算法

杨康杰 王丽芳

计算机与数字工程2026,Vol.54Issue(4):911-916,6.
计算机与数字工程2026,Vol.54Issue(4):911-916,6.DOI:10.3969/j.issn.1672-9722.2026.04.001

基于分解的多目标多小车充电路径规划算法

A Multi-objective Multi-vehicle Charging Path Planning Algorithm Based on Decomposition

杨康杰 1王丽芳1

作者信息

  • 1. 太原科技大学计算机科学与技术学院 太原 030024
  • 折叠

摘要

Abstract

With the development of wireless energy transmission technology,it is possible to extend the service life of sensor networks indefinitely by charging sensor nodes.Many scholars have proposed various charging schemes for this purpose,but most schemes only consider ordinary networks,and few are designed for large wireless sensor networks using multi-hop clustering routing protocols.Therefore,this paper proposes a multi-objective path planning model for multi-vehicle charging.As a full-coverage charging scheme,it avoids the node death problem.To solve the optimal charging path,a decomposition-based multi-objective opti-mization algorithm is designed,which takes travel distance,node energy utilization rate,and charging cycle as optimization objec-tives and improves the population update method.Simulation results show that the proposed charging scheme can achieve full-cover-age charging and performs better than existing decomposition-based multi-objective optimization algorithms.

关键词

分簇多跳路由协议/无线可充电传感器网络/多目标优化/多小车/路径规划

Key words

clustered multihop routing protocol/WRSNs/multi-objective optimization/multi-vehicle/path planning

分类

信息技术与安全科学

引用本文复制引用

杨康杰,王丽芳..基于分解的多目标多小车充电路径规划算法[J].计算机与数字工程,2026,54(4):911-916,6.

基金项目

国家自然科学基金项目(编号:61876123)资助. (编号:61876123)

计算机与数字工程

1672-9722

访问量0
|
下载量0
段落导航相关论文