Bi-Velocity Coevolutionary Multiswarm Particle Swarm Optimization for Many-Objective Gateway Placement Optimization

The gateway placement optimization (GPO) is a critical issue in satellite network that aims to obtain an optimal scheme to deploy different gateways in a network to achieve high-performed satellite-ground communication. Existing studies usually treat the GPO as a single-objective optimization problem, which significantly deviates from real-world scenarios and limits practical applicability. However, numerous performances like the gateway traffic load balancing, the distance between gateways, the traffic load of satellites, and the number of gateways within the satellite’s management range should be considered in the GPO problem, indicating that it is inherently a many-objective optimization problem (MaOP). Therefore, in this paper, a new mathematical model is designed which constructs the GPO as an MaOP. To address it, this paper further proposes a bi-velocity coevolutionary multiswarm particle swarm optimization (BCMPSO) algorithm. The BCMPSO follows the multiple populations for multiple objectives framework, running different populations in parallel, each optimizing a specific objective to search different parts of the Pareto front sufficiently. Meanwhile, a binary PSO with a bi-velocity update mechanism and a discrete position update mechanism is proposed as the optimizer in each population. Comparison experiments with several state-of-the-art methods confirm the effectiveness and competitiveness of the BCMPSO for many-objective GPO.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/cec65147.2025.11042963
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Bi-Velocity Coevolutionary Multiswarm Particle Swarm Optimization for Many-Objective Gateway Placement Optimization

Zhi‐Hui Zhan, Qingrui Zhou, Qi-Te Yang, Zhigang Lu et al.
Robotic Path Planning Algorithms
article

Bi-Velocity Coevolutionary Multiswarm Particle Swarm Optimization for Many-Objective Gateway Placement Optimization

Zhi‐Hui Zhan, Qingrui Zhou, Qi-Te Yang, Zhigang Lu, Jian-Yu Li, Chunhua Chen, Ke-Jing Du
article en

Abstract

The gateway placement optimization (GPO) is a critical issue in satellite network that aims to obtain an optimal scheme to deploy different gateways in a network to achieve high-performed satellite-ground communication. Existing studies usually treat the GPO as a single-objective optimization problem, which significantly deviates from real-world scenarios and limits practical applicability. However, numerous performances like the gateway traffic load balancing, the distance between gateways, the traffic load of satellites, and the number of gateways within the satellite’s management range should be considered in the GPO problem, indicating that it is inherently a many-objective optimization problem (MaOP). Therefore, in this paper, a new mathematical model is designed which constructs the GPO as an MaOP. To address it, this paper further proposes a bi-velocity coevolutionary multiswarm particle swarm optimization (BCMPSO) algorithm. The BCMPSO follows the multiple populations for multiple objectives framework, running different populations in parallel, each optimizing a specific objective to search different parts of the Pareto front sufficiently. Meanwhile, a binary PSO with a bi-velocity update mechanism and a discrete position update mechanism is proposed as the optimizer in each population. Comparison experiments with several state-of-the-art methods confirm the effectiveness and competitiveness of the BCMPSO for many-objective GPO.

China Academy of Space Technology (CN), Nankai University (CN), Guangdong University of Finance (CN), Hanyang University (KR), South China University of Technology (CN)
National Research Foundation, National Natural Science Foundation of China, Nankai University, Fundamental Research Funds for the Central Universities, Research and Development
Openalex Percentile: Top 87%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.