The rational allocation of tasks is a critical issue in enhancing the mission execution capability of unmanned aerial vehicle (UAV) swarms, which is difficult to solve exactly in polynomial time. Evolutionary-algorithm-based approaches are among the popular methods for addressing this problem. However, existing methods often suffer from insufficiently rigorous constraint settings and a focus on single-objective optimization. To address these limitations, this paper considers multiple types of constraints—including temporal constraints, time window constraints, and task integrity constraints—and establishes a model with optimization objectives comprising task reward, task execution cost, and task execution time. A multi-objective multi-population self-adaptive ant lion optimizer (MMSALO) is proposed to solve the problem. In MMSALO, a sparsity-based selection mechanism replaces roulette wheel selection, effectively enhancing the global search capability. A random boundary strategy is adopted to increase the randomness and diversity of ant movement around antlions, thereby improving population diversity. An adaptive position update strategy is employed to strengthen exploration in the early stages and exploitation in the later stages of the algorithm. Additionally, a preference-based elite selection mechanism is introduced to enhance optimization performance and improve the distribution of solutions. Finally, to handle complex multiple constraints, a double-layer encoding mechanism and an adaptive penalty strategy are implemented. Simulation experiments were conducted to validate the proposed algorithm. The results demonstrate that MMSALO exhibits superior performance in solving multi-task, multi-constraint task-allocation problems for UAV swarms.

The stability of communities - whether biological, social, economic, technological or ecological depends on the balance between cooperation and cheating. While cooperation strengthens communities, selfish individuals, or "cheaters," exploit collective benefits without contributing. If cheaters become too prevalent, they can trigger the collapse of cooperation and of the community, often in an abrupt manner. A key challenge is determining whether the risk of such a collapse can be detected in advance. To address this, we use a combination of evolutionary graph theory and machine learning to examine how one can predict the unravel of cooperation on complex networks. By introducing few cheaters into a structured population, we employ machine learning to detect and anticipate the spreading of cheaters and cooperation collapse. Using temporal and structural data, the presented results show that prediction accuracy improves with stronger selection strength and larger observation windows, with CNN-Seq-LSTM and Seq-LSTM best performing models. Moreover, the accuracy for the predictions depends crucially on the type of game played between cooperators and cheaters (i.e., accuracy improves when it is more advantageous to defect) and on the community structure. Overall, this work introduces a machine learning approach into detecting abrupt shifts in evolutionary graph theory and offer potential strategies for anticipating and preventing cooperation collapse in complex social networks.