Large-scale multiobjective optimization problems (LSMOPs) continue to be challenging for existing multiobjective evolutionary algorithms (MOEAs). The main difficulties are that: 1) the diversity preservation in both the objective space and the decision space needs to be taken into account when solving LSMOPs and 2) the existing learning structures in current MOEAs usually make the learning operators only coincidentally serve convergence and diversity, leading to difficulties in balancing these two factors. Therefore, balancing convergence and diversity in current MOEAs is difficult. To address these issues, this article proposes a multiobjective particle swarm optimizer with enhanced balance of convergence and diversity (MPSO-EBCD). In MPSO-EBCD, a novel velocity update structure for multiobjective particle swarm optimization is put forward, dividing the convergence, and diversity preservation operations into independent components. Following the proposed update structure, a weighted convergence factor is introduced to serve the convergence strategy, whilst a diversity preservation strategy is built to uniformly distribute the particles in the searched space based on a proposed multidimensional local sparseness degree indicator. By this means, MPSO-EBCD is able to balance convergence and diversity with specific parameters in independent operators. Experimental results on LSMOP benchmarks and a voltage transformer optimization problem demonstrate the competitiveness of the proposed algorithm compared to several state-of-the-art MOEAs.

Unmanned aerial vehicles (UAVs) are increasingly deployed in dynamic environments for applications such as surveillance, delivery, and data collection, where efficient task allocation and path planning are critical to minimizing mission completion time while managing limited energy resources. This paper proposes a novel approach that integrates energy management into a rolling horizon framework for dynamic UAV task allocation and path planning. We introduce an enhanced Particle Swarm Optimization (PSO) algorithm, incorporating adaptive perturbation strategies and a local search mechanism based on simulated annealing, to optimize UAV task assignments and routes. The rolling horizon framework enables the system to adapt to evolving task demands over time. Energy consumption is explicitly modeled, accounting for flight, computation, and recharging at designated stations, ensuring practical applicability. Extensive simulations demonstrate that the proposed method reduces the mission makespan significantly compared to conventional static planning approaches, while effectively balancing energy usage and recharging requirements. These results highlight the potential of our approach for real-world UAV operations in dynamic settings.

Merging activities at freeway merging areas can cause significant recurrent and non‐recurrent bottleneck congestion due to vehicles’ mandatory lateral conflicts. The Connected and Automated Vehicles (CAVs), with their capabilities of real‐time communication and precise trajectory control, hold great potential to prevent or mitigate such critical conflicts at merging areas. However, the performance of CAVs may be impaired by the imbalance of lane flow distribution, and non‐cooperative movements of Human‐driven Vehicles (HDVs) in the mixed traffic environment (i.e. traffic mixed with CAVs and HDVs). In this paper, a novel two‐level hierarchical traffic control framework for multilane merging areas under the mixed traffic environment is developed. Note that this paper assumes that the merging sequence is determined by the high control level and focuses on the low level of the control framework. The low control level not only establishes a trajectory optimization strategy for CAVs with lane‐changing optimization and cooperative merging control, but includes a human‐like merging strategy for HDVs. First, to balance downstream lane flow distribution and provide sufficient merging space for on‐ramp vehicles, a lane‐changing optimization method is proposed to choose a certain number of designated mainline CAVs to perform early lane changes at the upstream mainline. Second, a cooperative merging control method is presented to optimize the longitudinal trajectories of both mainline and on‐ramp CAVs while accounting for the movement of HDVs. Third, Gipps car‐following model and heuristic control are combined to represent the HDVs’ merging maneuvers. The proposed algorithm simulates and performs merging maneuvers at a typical two‐lane freeway merging area and verifies it in various scenarios considering demand level, demand splits and CAV Penetration Rate (PR). The simulation results show that the proposed algorithm can effectively facilitate merging operations, reduce the Total Travel Time (TTT), and increase the Average Travel Speeds (ATS) compared to other merging algorithms. Specifically, compared to the case of using only cooperative merging control method, the proposed algorithm can further reduce TTT by 25.5% and increase ATS by 33.38%. When PR gradually increased, the control performance of the proposed algorithm can be further improved.