The Dynamic Multi-objective Optimization Problem (DMOP) is one of the common problem types in academia and industry. The Dynamic Multi-Objective Evolutionary Algorithm (DMOEA) is an effective way for solving DMOPs. Despite the existence of many research works proposing a variety of DMOEAs, the demand for efficient solutions to DMOPs in drastically changing scenarios is still not well met. To this end, this paper is oriented towards DMOEA and innovatively proposes to explore the correlation between different points of the optimal frontier (PF) to improve the accuracy of predicting new PFs for new environments, which is the first attempt, to our best knowledge. Specifically, when the DMOP environment changes, this paper first constructs a spatio-temporal correlation model between various key points of the PF based on the linear regression algorithm; then, based on the constructed model, predicts a new location for each key point in the new environment; subsequently, constructs a sub-population by introducing the Gaussian noise into the predicted location to improve the generalization ability; and then, utilizes the idea of NSGA-II-B to construct another sub-population to further improve the population diversity; finally, combining the previous two sub-populations, re-initializing a new population to adapt to the new environment through a random replacement strategy. The proposed method was evaluated by experiments on the CEC 2018 test suite, and the experimental results show that the proposed method can obtain the optimal MIGD value on six DMOPs and the optimal MHVD value on five DMOPs, compared with six recent research results.

In this paper, we address the edge station deployment problem (ESDP), which aims to determine optimal sites for deploying edge stations so as to maximize user coverage and minimize deployment cost. We first formulate the ESDP as a binary linear programming model and prove its NP-hardness by reducing the set covering problem to a specialized instance of ESDP. To solve the ESDP in polynomial time, we propose a novel heuristic algorithm that prioritizes covering users who are within range of the fewest candidate sites. Our algorithm iteratively selects the site that can cover the most users from among the candidate sites capable of covering those least-covered users. To evaluate the performance of our algorithm, we conduct simulation experiments based on a real-world dataset. Experimental results demonstrate that our algorithm achieves 100% user coverage with lower deployment cost compared to several classical and state-of-the-art algorithms.

Edge computing, characterized by its proximity to users and fast response times, is considered one of the key technologies for addressing low-latency demands in the future. An appropriate edge server deployment strategy can reduce costs for service providers and improve the quality of service for users. However, most previous studies have focused on server coverage or deployment solution consumption time, often neglecting the most critical aspect: minimizing user-request response latency. To address this, we propose an edge deployment strategy based on the queuing search algorithm (QSA), which models the edge deployment problem as a multi-constrained nonlinear optimization problem. The QSA mimics the logic of human queuing behavior and has the ability to perform faster global searches while avoiding local optima. Experimental results show that, compared to the genetic algorithm, simulated annealing algorithm, particle swarm optimization, and other recent algorithms, the average number of “hopping” iterations in QSA is 0.1 to 0.6 times fewer than in the other algorithms. Additionally, QSA is particularly suitable for edge computing environments with a large number of users and devices.